Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
conjecture . . . . . . . . . . . . . . . . . . . 2755 Shai Keidar Ambidexterity and Chromatic Cyclotomic Extensions . . . . . . . . . . . . . . . . 2759 Qingyuan Bai Cyclotomic and polygonic spectra . . . . . . . . . . . . . . . . . . . .…
Let a(G,X) denote the algebraic connectivity of a graph G in a normed space X, let K_2d be the complete graph on 2d vertices, and let T_d be the tree defined in the paper. Algebraic-connectivity conjecture. a(K_2d,ℓ_∞^d)=a(T_d) for d≥ 4.…
Let w be an affine permutation with AMBC data w oversetAMBClongleftrightarrow(P,Q,ρ), where P and Q are tabloids of shape λ, and let r(w) denote the rotation of w. For a vector, call its dominant representative the representative specified…
Fix an integer d≥ 3. For each n≥ 1, let H=(H_i,α:i∈[n],lvertαrvert=d) be a collection of complex numbers, and let Ψ_i,j^α(H) and Φ_i^α(H) denote the combinatorial quantities defined in the paper. The combinatorial Jacobian conjecture.…
Let [n]=1,…,n, let s^n,k=1/kbinomn+12 be an integer, and let a partition of [n] implement p_i_i=1^k when its blocks can be bijectively matched with the prescribed sizes p_1,…,p_k. Call a partition equitable when every block has sum s^n,k.…
Let n≥ 3 be odd, and let ML(n) denote the maximal length of a solvable board of size n. The paper establishes the lower bound ML(n)≥ 3n for all n≥ 11 and the trivial upper bound ML(n)≤ n^2. Subquadratic upper bound conjecture. As n→∞,…
Let π be a 123-avoiding permutation, and let its boundary grid be the associated skew Young diagram. The downcore graph has the boxes of the boundary grid as vertices, with an edge between (i,j) and (k,ℓ) when either i<k and j>ℓ, or i>k…
Let a longest path of a connected graph be a path of maximum length. Zamfirescu's conjecture. For every connected graph, any 3 of its longest paths have a common vertex. This is an open case of Gallai's question about common vertices of…
We direct the reader to [17, 18] for sharp pointwise decay results. In the case |a| = M , based on the heuristic works [8, 12] and the recent proof of scalar azimuthal instabilities by Gajic [10], one may conjecture: Conjecture 1 (Extremal…
Let TGr_m,n be the toroidal grid graph formed from the Cartesian product of the cycle graphs C_m and C_n, with m,n≥ 3, and let R(G) denote the representation number of a graph G. Representation-number conjecture. If n,m≥ 3 and m+n≥ 8, then…
Let G be a graph, and let span_0(G) denote the homological span of its degree-0 chromatic symmetric homology. Chromatic symmetric homology interval conjecture. The groups H_i,0(G;C) are non-trivial for every integer i satisfying 0 ≤ i ≤…
Let r be a positive integer. A graph is uniquely K_r-saturated if it is K_r-free and adding any missing edge creates exactly one copy of K_r; a dominating vertex is a vertex adjacent to every other vertex. A graph is regular if all its…
/Dutle : What are the (homogeneous adjacency) spectra of the ultracube and the complete hypergraph? (Ultracube = cartesian power of a hyperedge.)
Let k be a positive integer and let S_n be the set of permutations of [n]. A permutation is k-universal if it contains every pattern in S_k. For fixed ε>0, consider a uniformly random permutation of length (1+ε)k^2/4. Alon's universality…
If there is no prime in the interval [n+1,n+k], then the product (n+1)…(n+k) has at least k distinct prime divisors.
What is the generalization to zero forcing with multiple colors? Maybe the colors are linearly ordered, i.e. red can force purple, purple can force blue, etc. Maybe the graph has an underlying coloring and filled vertices force according…
For r∈Q^+ and an integer k≥ 1, define the integer trace of the generalized q-binomial coefficient by retaining its integer exponents, and write [ genfrac0ptr+kk ]_q|_Z=∑_d≥ 0c_r(d)q^d. For power series with nonnegative coefficients, write…
Is there a constant c_t, where c_t→ ∞ as t→ ∞, such that if F is a finite family of finite sets, all of size at least t, and for every set X there are <c_tlvert Xrvert many A∈ F with A⊆ X, then F has chromatic number 2 (in other words, has…
Problem Let H_1 and H_2 be two r-uniform hypergraph on the same vertex set V. Does there always exist a partition of V into r classes V_1, …, V_r such that for both i=1,2, at least r!m_i/r^r -o(m_i) hyperedges of H_i meet each of the…
Alice and Bob play a game on the edges of K_n, alternating colouring edges by red (Alice) and blue (Bob). Alice goes first, and wins if at the end the largest red clique is larger than any of the blue cliques. Does Bob have a winning…