Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let f=∑_n=0^∞ a_nz^n be a transcendental entire function. What is the greatest possible value of liminf_r→ ∞ fracmax_nlvert a_nr^nrvertmax_lvert zrvert=rlvert f(z)rvert?
Let G be a fullerene graph, and let W(G) denote its Wiener index. A graph is nanotubical if it belongs to one of the nanotubical fullerene families with caps of types a--d described in the preceding propositions. Maximal Wiener index…
Must every graph with uniform exponential volume growth contain an infinite subgraph, possibly a tree, having positive Cheeger constant?
Let widehatS_1 be the class of standard-imaginary strategies and let widehatM_1 be the class of imaginary strategies used in the continuous Levine game. For measurable strategies k and g in widehatS_1×widehatM_1, let ε denote the…
Let G be a finite connected graph, possibly with multiple edges but no loops. A tree T in G is weakly even if all leaves of T that have maximum degree in G belong to the same part of the bipartition of T. A tree is spanning if it contains…
Let S_ Z be the group of finitely supported bijections of Z. A down-up Monk move is a down-up Bruhat move wt_a,bt_c,d=w' satisfying either a≤ c<b≤ d or c≤ a<d≤ b. Equivalently, it connects two permutations occurring with nonzero…
For a simplicial 4-polytope P with n vertices in which every three vertices contain an edge, must its graph contain a clique of size at least n/10? Given two continuous probability measures on S^2 and 0<\alpha<1/2, must some spherical cap…
Let d_n denote the discrepancy associated with the grid of size n. The discrepancy-2 conjecture. There are infinitely many n such that d_n=2. In particular, for all k∈N, d_2· 3^k-1=2. This parallels Sutner's result that there are…
Let R_n^(1,3) be the (1,3)-bosonic-fermionic coinvariant ring, let Frob(R_n^(1,3);1;1,1,1) denote its Frobenius series with all grading variables specialized to 1, and let s_(1^n) be the Schur function of the sign representation. Let F_n…
Let T be a finite tree, and let crn(T) denote its class reconstruction number. For the class of trees, write crn(T)=max_Tcrn(T), where T is the class of finite trees. Harary and Lauri's conjecture. The class reconstruction number of the…
Suppose a_1, …, a_k are integers which do not satisfy Rado's condition. Is c(a_1, …, a_k) bounded in terms of k only?
Problem 1. Let G = SLn (say), F a finite field. Let A \subset G(F) be a set gener- ating G(F). Assume A contains all permutation matrices. Prove a good bound on diam(Γ(G(F), A)). (Perhaps ≪ (log |G(F)|)O(1) ?) correspond to chains of…
Are there graphs on n vertices requiring more than floor(n/2) copies of each letter for word-representation?
Conjecture 2. Let G be an even-hole-free graph.
Let G be a graph on n vertices, and let α(G) denote its independence number, the maximum size of a set of pairwise nonadjacent vertices. The graph is triad-free when α(G)≤ 2. Clique cover conjecture for triad-free graphs. If α(G)≤ 2, then…
Given a finite graph G with no isolated vertices and domination number γ(G)=2, determine exactly which graphs satisfy γ_t(G)=2; equivalently, characterize all finite graphs G without isolated vertices such that γ(G)=γ_t(G)=2.
Proposed by Ashwin Sah Problem 4. Let tp pF, Gq “ p´epF q |G|´|F | hompF, Gq, the p-normalized homomorphism count of F within graph G. Is it possible to con- struct a sequence of graphs Gn with |Gn | Ñ 8‘ with edge densities pn “ |Gn…
Let H(I,J) be the least positive integer n such that there exist I disjoint Golomb rulers, each a J-subset of 1,2,…,n . Regularity conjecture. For every integer I≥8, H(I,I+2)=I(I+2). Thus the conjecture predicts regular disjoint Golomb…
Let P_n and P_m be paths, and let P_n× P_m denote their Cartesian product. Write b( · ) for the bondage number. Path-product bondage conjecture. For mgeqslant5, b(P_n× P_m)leqslant2. The source motivates this by the behavior of vertex…
Given a prime p and n, can one construct in deterministic polynomial time an elliptic curve over F_p having exactly n points whenever one exists?