Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Are all expander graph sequences superexpanders, meaning that they satisfy a uniform Poincare inequality for every superreflexive Banach space?
Let M≥ 1 and N be sufficiently large in terms of M. Is it true that for every Sidon set A⊂ 1,…,N there is another Sidon set B⊂ 1,…,N of size M such that (A-A)∩(B-B)=0?
Let G be a cycle C_n and let h be a hat function such that 2 ≤ h(v) ≤ 4 for every vertex v. Let A∈ V(G) be such that h(A)=2. The game G=⟨ G,h⟩ is winning only in the following cases: n=3; there is one more vertex besides A with hatness 2;…
Let G be a graph containing K_2,3 as a minor, and let the 3-subdivision of G be the graph obtained by subdividing every edge of G three times. Equip it with its shortest path metric. Negative type conjecture. There is no graph G with a…
Does there exist a universal constant C>0 such that, for every connected graph G=(V,E) with boundary B, maximum degree d_max, and genus g, one has σ_k(G,B)≤ C d_maxg+k/|B| for every integer k satisfying 1≤ k≤ |B|, where σ_k(G,B) is the…
For each integer k≥1, define U_k(q)=∑_ℓ=1^⌊ k/2⌋q^2ℓ(ℓ+1)[genfrac0ptk2ℓ]_q-∑_ℓ=1^⌊ k/3⌋(-1)^ℓ q^ℓ(9ℓ+5)/2[genfrac0ptk3ℓ]_q. Here A(q)≥_qB(q) denotes coefficientwise comparison, so U_k(q)≥_q0 means that all coefficients of U_k(q) are…
Let α∈[0,1/2) and n,t≥ 1. Let F^(t)(n,α) be the smallest m such that we can 2-colour the edges of the complete t-uniform hypergraph on n vertices such that if X⊆ [n] with lvert Xrvert ≥ m then there are at least α binomlvert Xrvertt many…
Q. First, assuming some assumptions on the point set A, find a better dependence (sub-linear) on p. Q. Characterize configurations for which the bound O(pε^-2) is tight. status
Determine the least positive integer n_1 and the greatest negative integer n_2 for which a D(n_i)-quintuple exists.
Let C_n be the n-th order standard circulant matrix. Define the triangular number T_n-1=(n-1)n/2. Let APD_m(C_n) denote its alternating power difference. Standard-circulant first appearance value conjecture. For n ≥ 2,…
Let G be a finite graph without loops, possibly with multiple edges. A graph is Z_3-connected if, for every zero-sum function β:V(G)→Z_3, there is an orientation D such that d_D^+(v)-d_D^-(v)=β(v)pmod 3 for every vertex v∈ V(G). Jaeger,…
Is it true that every smooth polytope has the integer decomposition property?
Question Are there graphs for which ch^OL-ch is arbitrarily large?
Let G be a finite permutation group. Call G semiprimitive if every normal subgroup of G is transitive or semiregular, and call G graph-restrictive if there is a constant c(G) such that, for every locally G pair (Γ,H), the order of a vertex…
Let M be a matroid (say graphic) of rank d with ground set E with m elements. Let S_1, …, S_n ⊆ E (not necessarily disjoint). Let α ∈ mathbbZ^n_≥ 0 with |α| = ∑_i=1^n α_i = d. We define c_α to be the number of bases B of the matroid M s.t.…
Find an analogue of the Deuring Lifting Theorem for Darmon–Heegner points.
Let G be a graph, let f be a nonedge of G, and let G ∪ f denote the graph obtained by adding f. An atom of G ∪ f is a graph-theoretic atom containing f, and an f-preserving d-forbidden minor is a forbidden minor in which f is not…
Let M_i and N_i be nonnegative integers such that |M_i-N_i|≤ k for i=1,…,r. Define the sums ∑_l∏_i=1^r M_i+N_ichoose M_i-klcos(lx) and ∑_l∏_i=1^r M_i+N_ichoose M_i-klsin(|l|x)/sin(x). Generalized positivity conjecture. The first sum is a…
For every finite simple connected graph G containing a cycle, define t(G)=max|S|:S⊆ V(G) and G[S] is a tree, let g(G) be the length of a shortest cycle in G, and define δ'(G)=mindeg_G(v):v∈ V(G), deg_G(v)≥ 2. Then t(G) δ'(G)≥ g(G)+1.
Problem Does there exist a graph with no subgraph isomorphic to K_4 which cannot be expressed as a union of ℵ_0 triangle free graphs?