Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Problem 4.8 (I. Łaba). Suppose that α is transcendental, and |A|=n. What is the best lower bound for |A+α A|? Remark(s). Konyagin and Łaba have shown that this cardinality is ≫ nlog n/loglog n. The best example (lowest known cardinality)…
Let Y=X/G be the quotient of a regular two-dimensional scheme by a finite group action in characteristic p>0, and consider its isolated wild singularities, where p divides |G|. Classify all such singularities up to analytic isomorphism,…
Let M and N be sixth-root-of-unity matroids, and let Λ_E(M) and Λ_E(N) denote their Eisenstein flow lattices. Write M_• and N_• for the associated pointed matroids. The lattices are isometric when there is a bijection preserving their…
Let G be a graph of order n, let overlineG be its complement, and choose π∈gp,mp, where gp and mp denote general and monophonic position, respectively. Let χ_π_rm i(G) denote the chromatic number whose color classes are independent…
Let d,k∈N_+, s∈N, p be a prime, and let McolonF_p^d→F_p be a non-degenerate quadratic form. Let G be the relation graph of a subset of Γ^s_k(M). If d≫_k,s1 and p≫_d1, then #_cc(G)=O_d, #_dd(G)(1). Clique-covering bound for relation graphs.…
Are there entire transcendental functions f(z) such that if x is a Liouville number then so is f(x)?
Let a superposition be a product of mutually compatible slices, and let a slice be a component obtained by a slicing algorithm from the initial syntax of a superposition. An order-1 fragment is a fragment of order one, and the vector of…
Is every integer n≡5,6, or 7pmod 8 a congruent number?
Let G be an n-vertex graph whose rooted balls of size k are all isomorphic. If k>n/2, or if k is within a fixed constant of diam(G), must G be vertex-transitive? Separately, for odd n, is the degree of a uniformly chosen vertex-transitive…
Let di-sk trees be the combinatorial objects considered in the paper, and let omi, riop, rpop, iop, and pop denote the statistics on them. For statistics A_1,…,A_k, write (A_1,…,A_k)~(B_1,…,B_k) when the corresponding statistic tuples are…
Sidorenko conjecture: for every bipartite graph H and every graphon W, t_H(W) \ge t_{K_2}(W)^{|E(H)|}.
(37) James Propp: "What is known about harmonic maps (in the sense of Baker and Norine [8], Cory [15], etc.) between Markov chains?" (a) Matt Baker: "The paper of Urakawa's [33] that we cite in our original article already is aware of this…
Let z_i≥2 be positive integers, and define F=∑_s≥0a_s(r,j)/n^s+∑_i c_i j(j-1)…(j-z_i+1)frac1n^z_ir^z_i∑_s≥0a_s(r,j-z_i)/n^s. For coefficient extraction, [j^k n^-h] denotes the coefficient of j^k n^-h. The awesome conjecture. [j^k n^-h]…
Let an m× n grid be the point configuration consisting of the lattice points in an m× n rectangular grid, and let a subdivision be a subdivision of this point configuration. For n≥ 2, denote by D_n-1 the (n-1)th central Delannoy number.…
Let T_n,m(x) be the n× n matrix T_n,m(x):=[binomx+mj-i+m-binomx+mm-i-j-1]_i,j=0^n-1. Determinant evaluation conjecture. The determinant satisfies det T_n,m(x)=∏_i=1^n∏_j=1^m(x+i-j)(x+2i+j-2)/(x+2i-j)(i+j-1). This evaluation is a…
Let hatS_p^n be the generalized Sierpiński triangle graph with integers n≥ 3 and p≥ 4, and let f(G) denote the feedback vertex number of a graph G, namely the minimum number of vertices whose deletion makes G acyclic. Feedback vertex…
Let K_s,t be the complete bipartite graph with part sizes s and t, where s≤ t, and let C_k(G) denote the k-coalition number of a graph G. Complete bipartite graph coalition conjecture. For s≤ t, C_k(K_s,t)=t-k+2. The paper proves the lower…
Let H be a realizable graph. A clique cover of H is a collection of cliques whose union covers all edges of H, and let n be the smallest number of cliques in such a cover. Minimal-clique-cover conjecture. There is always a digraph G…
Show H(S_n)≥ H(S_n-1)+log_2 √[]n/n-1 - o(1).
For n≥ 4, let P(n,n-2) be the directed overlap graph whose vertices are the (n-2)-permutations of [n]=1,…,n, with an arc from (a_1,…,a_n-2) to (a_2,…,a_n-2,b) whenever (a_1,…,a_n-2,b) is an (n-1)-permutation of [n]. Does P(n,n-2) contain a…