Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let k≥ 2, let R_k be the state space of the finite k-chain, let π be its stationary distribution, and set M_k=∏_j=1^kbinom2jj. For each λ∈R_k, write A_λ for an integer. Integer-numerator conjecture. For every λ∈R_k, we have π(λ)=A_λ/M_k.…
Let G_n be the partition graph, let K_n be its clique complex, let L_r(n) denote the vertices of local simplex dimension r, let Δ(n) be the maximal local simplex dimension, and let τ(r) be the least n for which the layer L_r(n) is…
Let g_0(n,α) and g_1(n,α) be the functions introduced in the paper, and let x_0(α) and x_1(α) denote the largest real roots of g_0(n,α)=0 and g_1(n,α)=0, respectively. Root-separation conjecture. For any αthe 2, g_0(n,α)=0 has exactly one…
Let G be a bounded-degree expander, or strongly ergodic, graphing that can be properly colored by C colors with arbitrarily small error. Can it be properly C-colored?
Let G be a graph, let Bbbk be a field, and let R_G denote the quotient by the binomial edge ideal associated to G. Write p for the characteristic of the base field. Matsuda's conjecture. R_G is F-pure for all sufficiently large primes p>0.…
Let H be a Sidorenko graph, and let T be a tree that is a retract of H, meaning that there is a graph homomorphism from H to T whose restriction to T is the identity. Say that T is smooth in H when it satisfies the smoothness condition…
For d700>0, there is a positive constant C_0 such that, for every C≥ C_0 and m∈ N, the following holds. Let G be a graph on N=Cm vertices, and let δ(G) denote its minimum degree. Spanning subdivision conjecture. If δ(G)≥ (1+ε)N/2, then G…
Can we find examples on a slice? For all indicator functions f on the slice with Ef “ 1{2, does there exist a sub-balanced slice of dimension log˚ n (or growing) on which Ef ą 0.51?} Jacques Verstraete Let G be a graph of edge-density p P…
Does a variant of the graph removal lemma hold under the L\infty distance? Local Removal Lemmas Fan Wei (joint work with Jacob Fox, Hung Le, Ruilin Shi)
Let S(Z_n) denote the permutations of Z_n, let [π] be the coset of a permutation π under cyclic shifts, and let t([π]) be the minimum number of transpositions needed to sort that coset. A permutation π is affine if π(x)=ax+b for some…
Let G=(V,E) be a graph with m vertices, and let n be the sample dimension. The graph is n-estimable when its score matching estimator exists with probability one. Lauritzen's conjecture. The graph G is n-estimable if and only if #V+#E≤…
Is it true that \alpha\pi1 pGq{\alphaF2 pGq is unbounded?} Jacob Fox This question arises out of current work of Conlon, Fox, Pham, and Yepremyan. Question 11. Let f pnq be the maximum size (number of elements) of a monochro- matic…
Let G be a bridgeless graph of order n and minimum degree δ≥ 2, and let overrightarrowdiam(G) denote the minimum diameter over all strongly connected orientations of G. Bau–Dankelmann's oriented diameter conjecture. There exists a constant…
Efficiently solve for, or characterize all relevant roots of, x^2-1 modulo a composite integer N in the setting of the slides.
A graph is 5-vertex-critical if it has chromatic number 5 and deleting any vertex lowers its chromatic number; a graph is co-gem-free if it has no induced subgraph isomorphic to the complement of the gem. The paper reports a list of 327…
Chung, Graham: Define the discrepancy of a graph to be the largest value of D(S,T) = | |S||T|/2 - e(S,T) |, over all disjoint vertex sets S and T. Suppose that G has no induced copy of some graph H. How large must the discrepancy be?
What are the simple normal surface singularities? The conjecture is that they are exactly the rational singularities whose resolution graphs arise from graphs of rational double points and rational triple points by making some vertex…
Let p be prime, k,n≥ 1, and R= Z/p^k Z. For each primitive direction b∈ P(R)^n-1 modulo multiplication by units and each λ∈ R, let H_b,λ=x∈ R^n:⟨ b,x⟩=λ, and let A(p^k,n) be the 0-1 matrix whose rows are the indicators of these distinct…
For x_1,…,x_n∈ [-1,1] let l_k(x)=frac∏_i eq k(x-x_i)∏_i eq k(x_k-x_i), which are such that l_k(x_k)=1 and l_k(x_i)=0 for i eq k. Let x_0=-1 and x_n+1=1 and Υ(x_1,…,x_n)=min_0≤ i≤ nmax_x∈[x_i,x_i+1] ∑_k lvert l_k(x)rvert. Is it true that…
Let G be an isolate-free forest of order n. In the domination game, Dominator starts in Dominator-start game, whose game domination number is denoted by γ_g(G), while γ_g'(G) denotes the corresponding Staller-start game number.…