Mathematics Problem Archive
What are the Whitney numbers of the (lattice of contractions of the) n-cube
v1.3 research notes: What are the Whitney numbers of the (lattice of contractions of the) n-cube? What if contractions equivalent under symmetries of the cube are identi...
Is the weak order on S_(n) (the "inversion" poset) Sperner
v1.3 research notesIs the weak order on S_(n) (the "inversion" poset) Sperner?...
Is the poset of integer partitions ordered by refinement Sperner
v1.3 research notesIs the poset of integer partitions ordered by refinement Sperner?...
How many comparisons are needed to determine a linear order of the Boolean poset
v1.3 research notesFishburn, Pekec, Reeds: How many comparisons are needed to determine a linear order of the Boolean poset? That is, what is the fewest number of questi...
Show that the jump number of a random linear extension of a grid poset (i
v1.3 research notes: Show that the jump number of a random linear extension of a grid poset (i.e., a product of chains) is close to the maximum w.h.p. (For the "symmetri...
("Diamond-Free Posets Problem") What is the size of the largest subset of the Boolean lattice B_(n) which includes no B_
v1.3 research notesGriggs, Lu: ("Diamond-Free Posets Problem") What is the size of the largest subset of the Boolean lattice B_(n) which includes no B_(2) as a subposet?...
For any poset P, define ex(n,P) to be the size of the largest subset of the Boolean lattice B_(n) which includes no (inj
v1.3 research notesGriggs, Lu: For any poset P, define ex(n,P) to be the size of the largest subset of the Boolean lattice B_(n) which includes no (injective) copy of P ...
"1/3 - 2/3 Conjecture" For every poset that is not a chain, there is some pair of elements x and y so that x appears abo
v1.3 research notesKislitsyn: "1/3 - 2/3 Conjecture" For every poset that is not a chain, there is some pair of elements x and y so that x appears above y in a random li...
Is enumeration of pressing sequences of bicolored graphs (aka simple pseudographs) #P-hard
v1.3 research notes: Is enumeration of pressing sequences of bicolored graphs (aka simple pseudographs) #P-hard? Is there an FPRAS for sampling them?...
Is the 1/3-2/3 Conjecture for Pressing Sequences true
v1.3 research notes: Is the 1/3-2/3 Conjecture for Pressing Sequences true? That is, if a graph G is not uniquely pressable, is it true that there much be two vertices x...
Suppose I have a sequence of positive integers whose reciprocals sum to infinity
v1.3 research notesErdős: Suppose I have a sequence of positive integers whose reciprocals sum to infinity. Must that sequence contain arbitrarily long arithmetic progre...
Take any positive integer, and apply the following process: (1) divide it by two if it's even, multiply by three and add
v1.3 research notes3n+1 ("Collatz" or "Ulam") problem: Take any positive integer, and apply the following process: (1) divide it by two if it's even, multiply by three a...
In the binary expansion of sqrt(2), are there arbitrarily long sequences of 0's
v1.3 research notesErdős: In the binary expansion of sqrt(2), are there arbitrarily long sequences of 0's? Can you find a single algebraic number with this property?...
Are the positive integer powers of 3/2 mod 1 uniformly distributed in the unit interval
v1.3 research notesAre the positive integer powers of 3/2 mod 1 uniformly distributed in the unit interval? One would think so, but apparently this is a hard question. S...
Given any subset S of the integers modulo a prime p, what is the least K=K(p) for which there always exists an m so that
v1.3 research notesAlon, Peres: Given any subset S of the integers modulo a prime p, what is the least K=K(p) for which there always exists an m so that mS has no gap of...
Show that there exists a B so that, for every n > 0, there exists a k relatively prime to n whose continued fraction has
v1.3 research notesNiederreiter: Show that there exists a B so that, for every n > 0, there exists a k relatively prime to n whose continued fraction has partial quotien...
Finite field Sylvester-Gallai: Suppose S is a tranversal of Z_(p)^(2), i
v1.3 research notes/Solymosi: Finite field Sylvester-Gallai: Suppose S is a tranversal of Z_(p)^(2), i.e., a set of points in the affine plane so that every row and colu...
Suppose that S is a set of positive integers with the property that S+S -- that is, all sums of the form s_(1)+s_(2) for
v1.3 research notesErdős-Turán: Suppose that S is a set of positive integers with the property that S+S -- that is, all sums of the form s_(1)+s_(2) for s_(1), s_(2) in ...
Every sequence of 2n-1 elements from a group of order n (written multiplicatively) has an n element subsequence with pro
v1.3 research notesOlson: Every sequence of 2n-1 elements from a group of order n (written multiplicatively) has an n element subsequence with product 1 (in the given or...
Suppose k runners having distinct constant speeds start at a common point and run laps on a unit length circular track
v1.3 research notesWills, Cusick: Suppose k runners having distinct constant speeds start at a common point and run laps on a unit length circular track. Then for any gi...
Suppose that S is a set of positive integers with the property that no element is the sum of a nonempty set of other ele
v1.3 research notesErdős: Suppose that S is a set of positive integers with the property that no element is the sum of a nonempty set of other elements. Such a set is ca...
Is it possible to choose 2n points in an n by n grid in the plane so that no three are collinear
v1.3 research notesDudeney: Is it possible to choose 2n points in an n by n grid in the plane so that no three are collinear? Conjecture: no. In fact, it is conjectured ...
If F is a finite field with at least 4 elements and A is an invertible n by n matrix over F, then there are vectors x, y
v1.3 research notesJaeger: If F is a finite field with at least 4 elements and A is an invertible n by n matrix over F, then there are vectors x, y in F^(n) which haveal...
Is x^(2)+y^(2)=z^(2) partition regular
v1.3 research notesGraham: Is x^(2)+y^(2)=z^(2) partition regular? That is, is it true that every coloring of the positive integers by a finite number of colors contains...
Is it true that, for every n, there is an integer M(n), so that whenever a linear homogeneous equation in n variables is
v1.3 research notesRado: Is it true that, for every n, there is an integer M(n), so that whenever a linear homogeneous equation in n variables is Ramsey (in the positive...
Is it possible, for each positive integer n, to find positive integers a, b, and c so that 4/n = 1/a + 1/b + 1/c
v1.3 research notesErdős-Strauss : Is it possible, for each positive integer n, to find positive integers a, b, and c so that 4/n = 1/a + 1/b + 1/c ? See this....
Show that there is some B so that no integer appears more than B times among the binomial coefficients
v1.3 research notesSingmaster : Show that there is some B so that no integer appears more than B times among the binomial coefficients. See this....
There is no n so that the only integer m with phi(n) = phi(m) is m=n
v1.3 research notesCarmichael : There is no n so that the only integer m with phi(n) = phi(m) is m=n. ("phi" is the Euler phi/totient function). See this....
Is there a dense of points in the real plane so that every two points are at a rational distance
v1.3 research notesUlam : Is there a dense of points in the real plane so that every two points are at a rational distance? See this....
How quickly do the gaps between successive primes grow
v1.3 research notesHow quickly do the gaps between successive primes grow? Is it slower than n^(ľ) for every ľ > 0? See this....
Is there a prime between n^(2)and (n+1)^(2 )for every n > 0
v1.3 research notesErdős: Is there a prime between n^(2)and (n+1)^(2 )for every n > 0?...
Is the least quadratic residue modulo p at most p^(ľ)^( )for any ľ > 0
v1.3 research notesIs the least quadratic residue modulo p at most p^(ľ)^( )for any ľ > 0?...
What is Σ_(n≥1 )φ(n)/2^(n), where φ(n) is the Euler phi (totient) function, counting the number of integers less than n
v1.3 research notesErdős: What is Σ_(n≥1 )φ(n)/2^(n), where φ(n) is the Euler phi (totient) function, counting the number of integers less than n which are relatively pr...
Let f be the formal power series over Z/2Z whose nth coefficient is the parity of the divisor function Ă_(0)(n)
v1.3 research notes/Riasanovsky: Let f be the formal power series over Z/2Z whose nth coefficient is the parity of the divisor function Ă_(0)(n). Is it true that the den...
Let f be the formal power series over Z/2Z whose nth coefficient is independently chosen to be 1 with probability Ü(n^(
v1.3 research notes: Let f be the formal power series over Z/2Z whose nth coefficient is independently chosen to be 1 with probability Ü(n^(-2)) (and probability 1 for n...
A covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewo
v1.3 research notesA covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewords by changing at most R bits...
An asymmetric covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one o
v1.3 research notes/Ellis/Kahng: An asymmetric covering code of radius R is a set of binary n-words so that every binary n-word can be reached from one of the codewords ...
An asymmetric packing code of radius R is a set of binary n-words so that no binary n-word can be reached from more than
v1.3 research notes/Ellis/Kahng: An asymmetric packing code of radius R is a set of binary n-words so that no binary n-word can be reached from more than one of the code...
A de Bruijn covering code of radius R is a binary string so that the set of words appearing as n consecutive symbols (wi
v1.3 research notesChung/: A de Bruijn covering code of radius R is a binary string so that the set of words appearing as n consecutive symbols (with wrap-around) is a c...
Is there a word which is unavoidable over a k letter alphabet, but not a (k-1) letter alphabet, for each integer k > 1
v1.3 research notesIs there a word which is unavoidable over a k letter alphabet, but not a (k-1) letter alphabet, for each integer k > 1? See this....
For each k and every sufficiently large n with k dividing ((n-1) choose (k-1)), there is a universal cycle for the k-sub
v1.3 research notesChung/Diaconis/Graham: For each k and every sufficiently large n with k dividing ((n-1) choose (k-1)), there is a universal cycle for the k-subsets of...
There is (essentially) a unique sequence over {1,2} which is its own run-length encoding
v1.3 research notesKolakoski: There is (essentially) a unique sequence over {1,2} which is its own run-length encoding. Is the density of 1's in this sequence 1/2? See t...
Is it true that, for some k, if all (K-1)-words are encountered by a t-ary word at the same rate as a uniform random t-a
v1.3 research notes/Rorabaugh: Is it true that, for some k, if all (K-1)-words are encountered by a t-ary word at the same rate as a uniform random t-ary word, then this...
start at (0,0), at each point in time, we take a step from (x, y) to (x+1, y), (x-1, y), (x, y+1), or (x, y-1) with prob
v1.3 research notesConsider the following walk: start at (0,0), at each point in time, we take a step from (x, y) to (x+1, y), (x-1, y), (x, y+1), or (x, y-1) with proba...
Consider p(v, t), the probability that a walk beginning from the origin ends at the point v on the d-dimensional integer
v1.3 research notes/Spencer: Consider p(v, t), the probability that a walk beginning from the origin ends at the point v on the d-dimensional integer lattice in time t. ...
What is the threshold function n = f(k) for the event that a random permutation on n symbols contains all patterns on k
v1.3 research notesAlon: What is the threshold function n = f(k) for the event that a random permutation on n symbols contains all patterns on k symbols? Conjecture: f(k...
What is the probability that a random nXn matrix over Z_(p) has zero permanent as n goes to infinity
v1.3 research notesTao: What is the probability that a random nXn matrix over Z_(p) has zero permanent as n goes to infinity? (Surely 1/p... as long as p is not 2.)...
Let f(p;n,k) = C(n,k) p^(k) (1-p)^(n-k)
v1.3 research notesGalvin: Let f(p;n,k) = C(n,k) p^(k) (1-p)^(n-k). If p is not 0, 1/2, or 1, is it possible for f(p;n,k) = f(p;n,l) and f(p;n,k') = f(p;n,l') for distin...
Is the exponent of matrix multiplication 2
v1.3 research notesIs the exponent of matrix multiplication 2? In other words, can two n b n matrices be multiplied in O(n^(2+)^(ľ)) steps? See this....
If A is an invertible n x n matrix, is there always an n x n submatrix B of [A A] so that perm(B) is nonzero
v1.3 research notesKahn: If A is an invertible n x n matrix, is there always an n x n submatrix B of [A A] so that perm(B) is nonzero. The notation perm(B) means the per...