Mathematics Problem Archive

Showing 1001-1050 of 3342 problems (Page 21 of 67)

AMR-030-0038
Open

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...

L3
Combinatorics
AMR-030-0039
Solved

Is the weak order on S_(n) (the "inversion" poset) Sperner

v1.3 research notes

Is the weak order on S_(n) (the "inversion" poset) Sperner?...

L2
Combinatorics
AMR-030-0040
Partially Solved

Is the poset of integer partitions ordered by refinement Sperner

v1.3 research notes

Is the poset of integer partitions ordered by refinement Sperner?...

L3
Combinatorics
AMR-030-0041
Open

How many comparisons are needed to determine a linear order of the Boolean poset

v1.3 research notes

Fishburn, 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...

L3
Combinatorics
AMR-030-0042
Open

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...

L3
Combinatorics
AMR-030-0043
Partially Solved

("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 notes

Griggs, 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?...

L3
Combinatorics
AMR-030-0044
Partially Solved

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 notes

Griggs, 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 ...

L3
Combinatorics
AMR-030-0045
Partially Solved

"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 notes

Kislitsyn: "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...

L3
Combinatorics
AMR-030-0046
Open

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?...

L3
Combinatorics
AMR-030-0047
Open

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...

L3
Combinatorics
AMR-030-0048
Partially Solved

Suppose I have a sequence of positive integers whose reciprocals sum to infinity

v1.3 research notes

Erdős: Suppose I have a sequence of positive integers whose reciprocals sum to infinity. Must that sequence contain arbitrarily long arithmetic progre...

L4
Number Theory
AMR-030-0049
Open

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 notes

3n+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...

L4
Number Theory
AMR-030-0050
Partially Solved

In the binary expansion of sqrt(2), are there arbitrarily long sequences of 0's

v1.3 research notes

Erdő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?...

L3
Number Theory
AMR-030-0051
Open

Are the positive integer powers of 3/2 mod 1 uniformly distributed in the unit interval

v1.3 research notes

Are 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...

L4
Number Theory
AMR-030-0052
Partially Solved

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 notes

Alon, 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...

L3
Number Theory
AMR-030-0053
Open

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 notes

Niederreiter: 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...

L3
Number Theory
AMR-030-0054
Partially Solved

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...

L3
Number Theory
AMR-030-0055
Partially Solved

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 notes

Erdő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 ...

L3
Number Theory
AMR-030-0056
Partially Solved

Every sequence of 2n-1 elements from a group of order n (written multiplicatively) has an n element subsequence with pro

v1.3 research notes

Olson: 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...

L3
Number Theory
AMR-030-0057
Partially Solved

Suppose k runners having distinct constant speeds start at a common point and run laps on a unit length circular track

v1.3 research notes

Wills, 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...

L3
Number Theory
AMR-030-0058
Partially Solved

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 notes

Erdő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...

L3
Number Theory
AMR-030-0059
Open

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 notes

Dudeney: 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 ...

L3
Number Theory
AMR-030-0060
Partially Solved

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 notes

Jaeger: 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...

L3
Number Theory
AMR-030-0061
Partially Solved

Is x^(2)+y^(2)=z^(2) partition regular

v1.3 research notes

Graham: 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...

L3
Number Theory
AMR-030-0062
Open

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 notes

Rado: 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...

L3
Number Theory
AMR-030-0063
Partially Solved

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 notes

Erdő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....

L3
Number Theory
AMR-030-0064
Partially Solved

Show that there is some B so that no integer appears more than B times among the binomial coefficients

v1.3 research notes

Singmaster : Show that there is some B so that no integer appears more than B times among the binomial coefficients. See this....

L3
Number Theory
AMR-030-0065
Partially Solved

There is no n so that the only integer m with phi(n) = phi(m) is m=n

v1.3 research notes

Carmichael : 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....

L3
Number Theory
AMR-030-0066
Partially Solved

Is there a dense of points in the real plane so that every two points are at a rational distance

v1.3 research notes

Ulam : Is there a dense of points in the real plane so that every two points are at a rational distance? See this....

L3
Number Theory
AMR-030-0067
Partially Solved

How quickly do the gaps between successive primes grow

v1.3 research notes

How quickly do the gaps between successive primes grow? Is it slower than n^(ľ) for every ľ > 0? See this....

L4
Number Theory
AMR-030-0068
Partially Solved

Is there a prime between n^(2)and (n+1)^(2 )for every n > 0

v1.3 research notes

Erdős: Is there a prime between n^(2)and (n+1)^(2 )for every n > 0?...

L4
Number Theory
AMR-030-0069
Partially Solved

Is the least quadratic residue modulo p at most p^(ľ)^( )for any ľ > 0

v1.3 research notes

Is the least quadratic residue modulo p at most p^(ľ)^( )for any ľ > 0?...

L4
Number Theory
AMR-030-0070
Open

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 notes

Erdő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...

L3
Number Theory
AMR-030-0071
Open

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...

L3
Number Theory
AMR-030-0072
Open

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...

L3
Number Theory
AMR-030-0073
Partially Solved

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 notes

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 codewords by changing at most R bits...

L3
Combinatorics
AMR-030-0074
Open

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 ...

L3
Combinatorics
AMR-030-0075
Open

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...

L3
Combinatorics
AMR-030-0076
Partially Solved

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 notes

Chung/: 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...

L3
Combinatorics
AMR-030-0077
Open

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 notes

Is 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....

L3
Combinatorics
AMR-030-0078
Open

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 notes

Chung/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...

L3
Combinatorics
AMR-030-0079
Partially Solved

There is (essentially) a unique sequence over {1,2} which is its own run-length encoding

v1.3 research notes

Kolakoski: 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...

L3
Combinatorics
AMR-030-0080
Open

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...

L3
Combinatorics
AMR-030-0081
Open

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 notes

Consider 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...

L3
Combinatorics
AMR-030-0082
Open

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. ...

L3
Combinatorics
AMR-030-0083
Partially Solved

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 notes

Alon: 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...

L3
Combinatorics
AMR-030-0084
Partially Solved

What is the probability that a random nXn matrix over Z_(p) has zero permanent as n goes to infinity

v1.3 research notes

Tao: 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.)...

L3
Combinatorics
AMR-030-0085
Open

Let f(p;n,k) = C(n,k) p^(k) (1-p)^(n-k)

v1.3 research notes

Galvin: 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...

L3
Combinatorics
AMR-030-0086
Partially Solved

Is the exponent of matrix multiplication 2

v1.3 research notes

Is the exponent of matrix multiplication 2? In other words, can two n b n matrices be multiplied in O(n^(2+)^(ľ)) steps? See this....

L3
Combinatorics
AMR-030-0087
Open

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 notes

Kahn: 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...

L3
Combinatorics