Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For n=1 and given p, what are the (lengths of the) possible periods of φ?
Let M be an exact symplectic manifold satisfying Assumption, and let SH^*(M) longrightarrow HH^*( F(M), F(M)) be the natural open–closed string map from symplectic cohomology to the Hochschild cohomology of the Fukaya category. Open–closed…
Any graph on n vertices can be decomposed into O(n) many edge-disjoint cycles and edges.
Let G be a reductive group and let X be a curve. For each standard parabolic P⊂ G, let LocSys_P and LocSys_G denote the corresponding stacks of local systems, and let Nilp_glob⊂Sing(LocSys_G) be the global nilpotent cone. For every P, let…
I just discovered in it a forgotten conjecture of mine, which might still be of interest. Let p_n be the sequence of consecutive primes. Is it true that ∑_n=1^∞(-1)^n(n/p_n) converges? If not, what happens to the partial sums?
Find a good definition of “rank varieties”.
Let (g, J_α) be a nilpotent hypercomplex Lie algebra. Here, H-solvability means that the descending H-central series defined by g_0^H=g and g_k^H=H[g_k-1^H,g_k-1^H] eventually reaches zero. Solvability conjecture. Every nilpotent…
Let H_*(c^+_∞)^Sp be the symplectic-invariant homology algebra, let A^+(φ) be the subalgebra generated by the positive-degree elements of A(φ), and let E=H_*(c^+_∞)^Sp/I(A^+(φ)) be the resulting free graded commutative algebra. The…
An edge-ordered graph is a graph whose edges are equipped with a linear ordering. A graph is d-degenerate if every induced subgraph has a vertex of degree at most d. For an edge-ordered graph H, let r_edge(H) be its edge-ordered Ramsey…
Let (X,Δ) be a log klt pair and let fcolon X→ Y be a surjective morphism such that the Kodaira dimension of K_X+Δ restricted to the general fibre is zero. Assume K_X+Δ=f^*(K_Y+B_Y+M_Y), where B_Y is the discriminant divisor and M_Y is the…
Let G_4=(A,B,E) be the bipartite incidence graph of the complete graph K_4, with A=E(K_4), B=V(K_4), and (e,v)∈ E exactly when v∈ e. Let P_G_4,A and P_G_4,B be the associated posets, and let La(n,P_G_4,A,P_G_4,B) denote the maximum size of…
Let G be a subgraph of the Cartesian product G_1square…square G_m. Here, VC-dens^*(G) denotes the VC-density of G. VC-density conjecture. |E(G)|/|V(G)|≤ VC-dens^*(G). The conjecture strengthens the paper's density bounds for subgraphs of…
Question 3 3. (Poonen) Instead of counting points of bounded height on a va-riety, count points of bounded height in a Diophantine set. (I.e., counting points in a base the fibre above which has a rational point.) What rates of growth can…
Let G be a triangle-free graph with minimum degree delta geq 2. Triangle-free zero-forcing conjecture. 2δ -2 ≤ Z(G). This is the g=4 specialization of the broader girth–minimum-degree conjecture and concerns improving the trivial…
Let G be an n-vertex graph. A bipartite cut is a cut whose induced subgraph on one side is bipartite. Bogdanov–Neustroeva–Sokolov–Volostnov–Russkin–Voronov conjecture. Any n-vertex graph with fewer than 3n-6 edges admits a bipartite cut,…
Let Y^*=bigcup_k∈N∖0Y^k be the set of nonempty finite strings over Y, let Y_k:k∈N be the Markov chain associated with the NAND 2D regular grid, and let F_k:k∈N be the filtration generated by the chain and the binary symmetric channels…
Let B be a homothecy invariant density basis of bounded convex sets in R^n. For a measurable set E⊂R^n with 0<|E|<∞, let C_B(α)=sup_E1/|E||x∈R^n:M_Bχ_E(x)>α|. Solyanik limit conjecture. The associated Tauberian constants satisfy…
A 1977 conjecture of Erdős and Hajnal [5] predicts a very different behaviour in graphs with a forbidden induced subgraph; formally, their conjecture says that: Conjecture 1 (Erdős–Hajnal). This conjecture remains open despite a…
For an Artin group A, which Artin groups A' embed in A such that A' is not a parabolic subgroup?
A 3-graph F is linear if any two of its edges share at most one vertex. For fixed F, let r(F,K_n^(3)) be the least N such that every red-blue coloring of K_N^(3) contains a red copy of F or a blue copy of K_n^(3). Polynomial-exponent…