Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Reconstruct the connectivity of a large neuronal network from limited, noisy, and incomplete observations.
For every nontrivial planar graph G, the bondage number satisfies b(G)≤ Δ(G)+1, where b(G)=minlvert Frvert:F⊆ E(G), γ(G-F)>γ(G) and γ(G) is the domination number of G.
Let H be a numerical monoid, and for k,l∈ N let α_k,l(H) be the number of k-element atoms of P_fin,0(H) whose maximum is at most l. Unimodality Conjecture. For every l∈ N, there is an index k∈llbracket 0,lrrbracket such that…
Let F be a field of zero characteristics. For positive integers k,n, let M_k,n(F) be the set of k-by-n matrices over F, and let M_k,n(± 1) be the subset whose entries are ± 1. Write M_n=M_n,n, let rk A denote the rank of A, and let per A…
Let σ_1 and σ_2 be valence sequences with σ_1<σ_2, and let underlineλ_σ and overlineλ_σ denote the lower and upper bounds of growth rates among face-homogeneous tessellations with valence sequence σ. Strong growth-order conjecture.…
Let M be the move set of a piece P, with basic moves (c_r,d_r), and write hat d_r:=max(|c_r|,|d_r|), Λ:=lcmhat d_r:m_r∈M. Let γ_3 denote the third coefficient of the quasipolynomial u_ P(q;n). The γ_3 period conjecture. The period of γ_3…
Use lattice reduction together with average-case problems to solve computational problems in algebraic number theory.
Let G=(V,E) be a finite simple undirected graph. Call a set of three edges of G a triangle if these edges form a cycle of length 3, i.e. if they are u,v,v,w,u,w for three distinct vertices u,v,w ∈ V. Two triangles are edge-disjoint if they…
Finding examples. Find counter examples to the polynomial Bogolyubov Ruzsa theorem. Find interesting examples of subset A⊂ F_2^n so that A+A is far from all of F_2^n. Find interesting examples of A⊂ [N] of density α so that 4A does not…
Let G be a graph with a path factor, let Δ(G) be its maximum degree, and let P_n be the path on n vertices. The Cartesian product P_nsquare G is balanced bipartite when its two bipartition classes have equal size. The balanced-bipartite…
Let π be a matching and let p be an integer with 1≤ p≤|π|-1 such that m_p(π)=0. Write π=α∘β, where |α|=p, and define G_α=A_α(-|α|). Negative-integer factorization conjecture. A_π(-p)=G_α A_β. This conjecture concerns the special values at…
Let G range over all graphs on n vertices, and let the lcm-density refer to the lcm-density of the edge ideal of G. Consider the behavior of this quantity across the set of all such graphs as n tends to infinity. Phase transition…
(40) Jordan Ellenberg: "Is there a Deligne-Mumford stack on graphs?" (a) Matt Baker: "We have a paper on metric graphs that accom-plishes some of this." (b) Jordan: "But there is still a question of what are harmonic group actions on…
Let G be a unicyclic graph of order n whose cycle has size k. The path energy PE(G) is defined for such graphs. Path energy conjecture for unicyclic graphs. PE(G) depends only on the parameters n and k. For fixed n, PE(G) is a…
Let G be a connected Delta-regular graph of order n for some Delta geq 3. Baste–Fürst–Henning–Mohr–Rautenbach conjecture. γ(G) ≤ 2Δ-1/4Deltan + 1/2. This conjecture concerns the edge domination number of connected regular graphs and would…
Must every Cayley graph of superlinear growth contain, up to rough isometric embedding, either the square grid Z^2 or an infinite binary tree?
Given an elliptic curve E:y^2=x^3+Ax+B over Q, determine whether E has infinitely many rational points.
Let D=(V,E) be an oriented graph: a finite directed graph with no self-loops, no parallel edges, and no directed cycle of length two (equivalently, for all u,v ∈ V at most one of (u,v) and (v,u) lies in E). For a vertex v ∈ V let N^+(v)=u…
Consider the following walk: start at (0,0), at each point in time, we take a step from (x, y) to (x+1, y), (x-1, y), (x, y+1), or (x, y-1) with probability proportional to one plus the number of steps we have already taken from (x, y) to…
Let F_k be the free group on k generators, let S be a shape on F_k, and let P be an S-filling closed set. An S-contour of P is a contour computed with respect to a corner, and the S-solitaire orbit is the set of contours reachable from it…