Problems
No problem here has yet been reviewed by a person.
If CT_(k) is generated by all horizontal class transpositions with modulus at most k, is CT_(k) ≅ S_lcm(2,…,k) for every k ≥ 4?
Crouzeix conjectured in 2004 that for every square complex matrix A and every polynomial p, lVert p(A)rVert ≤ 2 max_z ∈ W(A) |p(z)|, where W(A) is the numerical range of A - that is, the numerical range is a 2-spectral set. Crouzeix proved…
Must the right-relatively convex subgroups of a right-orderable nonabelian group form a sublattice of its subgroup lattice? A construction shows they need not.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
For which lattice parameters does a totally positive window function generate a Gabor frame? Gröchenig and Stöckler initiated the program in 2013; this paper gives the complete characterization, together with a Kadets-type theorem for…
For a semistable one-parameter family of complex projective varieties with smooth nearby fiber X_t and monodromy T, is the map H^1(X, Z) → H^1(X_t, Z)^T surjective? True in degree one, although the integral statement fails in higher degree.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
For a family F of an odd number n of unit disks in the plane, let OA(F) be the area covered by an odd number of disks. It was conjectured that OA(F) ≥ π, the area of a single disk. False: configurations exist with smaller odd area.
Can a complete edge-coloured, complex-weighted graph realize perfect-matching amplitudes of one on every monochromatic inherited vertex colouring and zero otherwise? Nonexistence is proved in the diagonal family N = D for every even N ≥ 4,…
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
Let R(3;k) be the least n such that every k-colouring of the edges of K_n contains a monochromatic triangle. Determine lim_k→∞ R(3;k)^1/k (a $250 Erdős prize problem). A superexponential lower bound resolves the problem: the limit is…
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
VibeMathed records no statement for this problem. See erdosproblems.com for the original.
For a finite connected graph G, let L_s(G) be the maximum number of leaves in a spanning tree and ℓ(G) the average local independence number. Must L_s(G) ≥ 2(ℓ(G) - 1)?
Estimate the number F(x) of minimal distinct covering systems whose moduli all lie in [1, x]. The candidate proof gives loglog F(x)/log x → 1, i.e. F(x) = exp(x^1+o(1)).
VibeMathed records no statement for this problem. See erdosproblems.com for the original.