Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For the proposed exchangeability-based notion of independence, extremality for the free and Boolean products is open but expected. Are there examples beyond the five natural products, and what changes if extremal shift-invariance is…
Let n be a positive integer. A Latin square of order n is an n× n array with entries in [n]=1,…,n, in which every element occurs precisely once in each row and each column. Its sign is the product of the signs of the 2n row and column…
by Op|EpG1 q||EpG2 q|q, where the constant in the Op¨q is independent of the genus. The best known bound on this general problem is Opg|EpG1 q||EpG2 q|q, also due to Negami [12]. See also [1] and [14] for more results around this…
Does there exist a strongly regular graph with parameters (99,14,1,2)?
Let G be a graph with |V(G)|≥ 2. The prime bound p(G) is the smallest integer such that G admits a prime p(G)-extension; here α(G) denotes the stability number and ω(G) the clique number. Brignall's prime bound conjecture.…
If a graph G contains odd cycles of at most k different lengths, must χ(G)≤2k+2, with equality only when G contains K_2k+2?
What is the size of the largest homogeneous set (i.e., clique or independent set) that is guaranteed to exist in every such H_n? Let r_f(n) = min_H_n maxα(H_n), ω(H_n) denote the above quantity. \emph{Known:} From bounds on Ramsey numbers…
Let S be a finite set of primes with #S≥2, and let G be its S-unit graph. A cycle is nondegenerate if its edge differences have no proper nonempty zero subsum, and induced if it has no edges between nonconsecutive vertices. The conjecture.…
Let r,s be positive integers, let Φ(x,j) be the generating-function expression used in the preceding propositions, and write [x^r+1] and [y^s+1] for coefficient extraction. The resulting expression is a polynomial in free cumulants.…
Let (p_n)_n≥ 1=(2,3,5,7,11,13,…) be the increasing sequence of all prime numbers, and define an array of nonnegative integers d_n^k for n≥ 1, k≥ 1 by d_n^k= p_n+1-p_n, k=1, [5pt] |d_n+1^k-1-d_n^k-1|, k≥ 2. Then d_1^k=1 for every k≥ 1.
Let G be a finite graph with an initial chip configuration. Call (G,c_0) tight if the resulting diffusion-game process is eventually fixed or periodic with period length 2. Tightness conjecture. Every finite graph and initial configuration…
For every connected graph G that is not a cycle, the mixed metric dimension satisfies mdim(G)≤ ℓ(G)+2c(G), where ℓ(G) is the number of leaves and c(G) is the cyclomatic number. Moreover, equality holds if and only if G is either a cactus…
Let (G,<) be a preference system with ties where in every odd cycle there is a node that prefers its clockwise neighbour to its other neighbour, and there is another node that prefers its anti-clockwise neighbour to its other neighbour.…
Let n and k be nonnegative integers with n>k. Let G^k+1_(k)(n) denote the coefficient used in the orthogonal Weingarten expansion, and let Cat_k denote the Catalan number. The one-row second-order conjecture. The quantity G^k+1_(k)(n) is…
Given a graph G and a uniformly random k-vertex subset A, let X_G,k be the number of edges induced by A. Define I(n,k,ℓ):=maxP[X_G,k=ℓ]:v(G)=n, and ind(k,ℓ):=lim_n→∞I(n,k,ℓ). Edge-statistics conjecture. For all k,ℓ∈N with 0<ℓ<binomk2, we…
Characterize the typical arithmetic structure of #E(F_q) for elliptic curves over finite fields.
Let h(x)=∑_k=0^∞λ_kx^k be the function introduced in the heuristic asymptotic analysis, and let C_T be the positive constant appearing in the asymptotic formula for the Takeuchi numbers. Series representation conjecture. The constant C_T…
Let H be a planar graph, and let an H-expansion denote a subdivision of H. The edge-Erdős–Pósa property concerns whether, for every graph in the family of H-expansions, either there are many pairwise edge-disjoint copies or a bounded edge…
Can every ergodic unimodular random network that is almost surely an infinite tree be obtained as the limit of an expander family?
Let C be a neural code, meaning a collection of subsets of a neuron set, and call a codeword maximal if it is not properly contained in another codeword. A code is convex if it can be realized as the code of a collection of convex open…