Mathematics Problem Archive

Showing 201-250 of 963 problems (Page 5 of 20)

AMR-030-0006
Partially Solved

Suppose H is a linear 3-uniform hypergraph, i

v1.3 research notes

Kalai : Suppose H is a linear 3-uniform hypergraph, i.e., a subset of the set of all triples of n points with the property that no two edges intersect...

L3
Combinatorics
AMR-030-0008
Partially Solved

Does every thrackle have average degree at most 2

v1.3 research notes

Conway : Does every thrackle have average degree at most 2? A thrackle is a drawing of a graph in the plane so that every two edges share exactly one ...

L3
Combinatorics
AMR-030-0012
Partially Solved

Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n

v1.3 research notes

Erdős-Gyárfás: Is it true that every graph whose vertices have odd degree greater than one contains a cycle of length 2^(n) for some n? This one has k...

L3
Combinatorics
AMR-030-0015
Partially Solved

Suppose G has n vertices and no induced copy of H

v1.3 research notes

Erdős, Hajnal: Suppose G has n vertices and no induced copy of H. Is there an ľ > 0, depending only on H, so that the homogeneous number of G (i.e., t...

L3
Combinatorics
AMR-030-0017
Partially Solved

Define the discrepancy of a graph to be the largest value of D(S,T) = | |S||T|/2 - e(S,T) |, over all disjoint vertex se

v1.3 research notes

Chung, Graham: Define the discrepancy of a graph to be the largest value of D(S,T) = | |S||T|/2 - e(S,T) |, over all disjoint vertex sets S and T. Sup...

L3
Combinatorics
AMR-030-0019
Partially Solved

The "cycle double cover conjecture" states that every bridgeless graph contains a set of cycles which cover each edge of

v1.3 research notes

Seymour/Szekeres: The "cycle double cover conjecture" states that every bridgeless graph contains a set of cycles which cover each edge of the graph e...

L3
Combinatorics
AMR-030-0021
Partially Solved

"Seymour's Second Neighborhood Conjecture" Any oriented graph has a vertex whose outdegree is at most its second outdegr

v1.3 research notes

Seymour: "Seymour's Second Neighborhood Conjecture" Any oriented graph has a vertex whose outdegree is at most its second outdegree (vertices at direc...

L3
Combinatorics
AMR-030-0031
Partially Solved

Is it true that the sum of the k largest Laplacian eigenvalues of a graph with m edges is at most k(k+1)/2+m

v1.3 research notes

Brouwer : Is it true that the sum of the k largest Laplacian eigenvalues of a graph with m edges is at most k(k+1)/2+m?...

L3
Combinatorics
AMR-030-0033
Partially Solved

Given two permutations σ and τ, what is the expected number of copies of σ in a permutation chosen uniformly at random f

v1.3 research notes

: Given two permutations σ and τ, what is the expected number of copies of σ in a permutation chosen uniformly at random from those permutations on n ...

L3
Combinatorics
AMR-030-0035
Partially Solved

Show that the inversion permutation, i

v1.3 research notes

Propp: Show that the inversion permutation, i.e., the one which takes s to 1/s mod p, has longest increasing subsequence of length 2√ p(1+o(1)), i.e.,...

L3
Combinatorics
AMR-030-0036
Partially Solved

What is the length of the shortest sequence in [n]* containing, as a (consecutive) subword, each permutation of [n]

v1.3 research notes

What is the length of the shortest sequence in [n]* containing, as a (consecutive) subword, each permutation of [n]? See this, this, this, this, and t...

L3
Combinatorics
AMR-030-0037
Partially Solved

A d-dimensional permutation of order n is an n-by-n-by

v1.3 research notes

Linal/Luria: A d-dimensional permutation of order n is an n-by-n-by-...-by-n (d+1)-dimensional array of zeroes and ones, with the property that every ...

L3
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-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-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-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-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-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-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-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-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-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-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-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-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-031-0002
Partially Solved

Dittert–Hajek conjecture

v1.3 research notes

Let $A=(a_{ij})$ be an $n\times n$ matrix with nonnegative entries and total entry sum $n$. Define $$\phi(A)=\prod_{i=1}^n\sum_{j=1}^n a_{ij}+\prod_{j...

L3
Combinatorics
AMR-031-0005
Partially Solved

Minimum length of a superpermutation

v1.3 research notes

A superpermutation on $n$ symbols is a string containing every permutation of the $n$ symbols as a contiguous substring. Determine the minimum possibl...

L3
Combinatorics
AMR-031-0008
Partially Solved

Rudin's conjecture on squares in progressions

v1.3 research notes

For positive integers $N,q,a$, let $Q(N;q,a)$ be the number of perfect squares among $a,a+q,\ldots,a+(N-1)q$, and let $Q(N)=\max_{q,a\geq1}Q(N;q,a)$. ...

L4
Combinatorics
AMR-031-0015
Partially Solved

Exact van der Waerden numbers

v1.3 research notes

Let $W(r,k)$ be the least $N$ such that every coloring of $\{1,\ldots,N\}$ with $r$ colors contains a monochromatic arithmetic progression of length $...

L3
Combinatorics
AMR-035-0001
Partially Solved

Conjectural Large Genus Asymptotics of Masur–Veech Volumes

v1.3 research notes

Let $\boldsymbol{d}=(d_1,\ldots,d_n)$ be an unordered partition of $4g-4$ with $d_i\in\{-1,0,1,2,\ldots\}$, and let $\widehat\Pi_{4g-4}$ be the set of...

L3
Analysis
AMR-035-0002
Partially Solved

Conjectural Large Genus Asymptotics of Area Siegel–Veech Constants

v1.3 research notes

Let $\boldsymbol{d}=(d_1,\ldots,d_n)$ be an unordered partition of $4g-4$ with $d_i\in\{-1,0,1,2,\ldots\}$, and let $\widehat\Pi_{4g-4}$ be the set of...

L3
Analysis
AMR-036-0001
Partially Solved

Fuchsian equations with unitary monodromy

v1.3 research notes

Fix singularities $a_1,\ldots,a_n$ and real exponent differences $\alpha_1,\ldots,\alpha_n$ for second-order Fuchsian equations on the Riemann sphere....

L3
Analysis
AMR-036-0002
Partially Solved

Accessory parameters of the Heun equation

v1.3 research notes

For the Heun equation $$y''+\left(\sum_{j=0}^2\frac{1-\alpha_j}{z-a_j}\right)y'+\frac{Az-\lambda}{(z-a_0)(z-a_1)(z-a_2)}y=0,$$ where $\alpha_j>0$, $A=...

L3
Analysis
AMR-036-0005
Partially Solved

Makienko conjecture

v1.3 research notes

Let $f:\widehat{\mathbb C}\to\widehat{\mathbb C}$ be rational with Julia set $J$, and suppose that a component $D$ of $\widehat{\mathbb C}\setminus J$...

L3
Dynamical Systems
AMR-036-0006
Partially Solved

Completely invariant Fatou components

v1.3 research notes

How many completely invariant components can the Fatou set of a transcendental entire function have? In particular, can there be more than one?...

L3
Dynamical Systems
AMR-036-0007
Partially Solved

Analytic degenerate Herman rings

v1.3 research notes

Does there exist a rational function having an analytic invariant Jordan curve on which it is topologically conjugate to an irrational rotation, where...

L3
Dynamical Systems