2,148 problems
Conjecture (strong, or binary, Goldbach conjecture). Every even integer is the sum of two primes: …
Let and let , where . Here denotes the multiset of -minors of the standard Young tableau . Multiset re…
Let be integers with and . For , let denote the set of compositions of with non-negative…
Recurrent-component cardinality conjecture. For , , and , one has
Let be a finite projective plane of order , let be the infection rate, and let denote the percolation time of a percolating set . Two-round minimal perco…
Let be the coefficient of in , so that for , … The first entries are positive, while is negative and the subsequent entries ap…
Let and be the polynomials whose ratio is under consideration. Lower-bound conjecture. If and , then … This conjecture is prese…
Let be a finite set of finite strings. For strings and , let be the maximum length of a string that is simultaneously a suffix of and a pref…
Problem. Is every finite uniformly dense matroid of rank cyclically orderable?
For a permutation of and a permutation of , say that contains as a pattern if there are indices…
For every connected graph with vertices, the edges of admit a decomposition into at most paths.
Let be a finite family of distinct finite sets that is union-closed, i.e. … and suppose and . For an elem…
Let , , and let be positive integers. Write and, for an integer , write…
Setting. For a Navier-Stokes velocity field with vorticity , direction , and peak set (the high-vorticity region), define the scale-invariant…
Let be a finite set and let be a clutter on , meaning a family of subsets of in which no member properly contains another. Its blocker…
For a compact set , an integer , and points , let … where denotes the area of the triangle with…
Let A2 be the triangular lattice scaled to density1 in R^2. A configuration C is a discrete closed subset with lim(R-infinity)|C intersect BR(0)|/area(BR(0))=1. For p(r)=f(r^2), wh…
Let with , and let . Cone asymptotic-size conjecture. Is … Nume…
Let and let be the constructed maximal commutative algebraic system in . asymptotic-size conjecture. Is … Numerical checks th…
Let be the Rueppel sequence. Let be the Hankel transform of the sequence , and let be the Hankel transform of the first-difference sequence .…
Let be the graph associated with , and let denote the number of paths of length in that start at a vertex labeled and end at a vertex…
Let be an appropriate sequence of positive integers, and let be the action graph associated with . For , write for the number of new vertices labe…
The q-log-convexity conjecture. (i) The sequence is -log-convex; for every integer , the sequence…
Let be the generating function for the cyclic shift strategy of length , and let be the generating function for a deranged strategy , meaning a strategy…
For each integer , let and be the polynomials defined in the paper, and let the ULC inequality refer to the ultra-log-concavity inequality for their coefficien…