Mathematics Problem Archive

Showing 1451-1500 of 3440 problems (Page 30 of 69)

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-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
AMR-030-0088
Open

Let S_(n) be a subset of 2^(n), interpreted as a family of truth assignments to x_(1)

v1.3 research notes

: Let S_(n) be a subset of 2^(n), interpreted as a family of truth assignments to x_(1),...,x_(n). Let S_(n)-SAT be the problem of determining satisfi...

L3
Combinatorics
AMR-030-0089
Open

Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges

v1.3 research notes

Bixby-Flint-Miklos : Let G be a bicolored graph, and let H be the graph whose vertices are the valid pressing sequences of G and whose edges connect t...

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-0011
Open

Combinatorial interpretation of Kronecker coefficients

v1.3 research notes

For partitions $\lambda,\mu,\nu$ of $n$, the Kronecker coefficient $g_{\mu\nu}^{\lambda}$ is defined by $$V_\mu\otimes V_\nu\cong\bigoplus_\lambda g_{...

L3
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-035-0003
Open

Multiplicity-one support 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-0003
Open

Entire solutions of higher-order Briot–Bouquet equations

v1.3 research notes

Classify the entire solutions of $F(y^{(k)},y)=0$ when $F$ is irreducible and its highest-degree homogeneous part has a single distinct linear factor,...

L3
Analysis
AMR-036-0004
Open

Bounded wandering domains of entire functions

v1.3 research notes

Let $f$ be a nonlinear entire function and let $D$ be a Fatou component on which all limit functions of the iterates $f^n$ are constant. Can the set o...

L3
Dynamical Systems
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
AMR-036-0008
Open

Number of degenerate Herman rings

v1.3 research notes

Is the number of degenerate Herman rings of a rational function finite, and can it be bounded in terms of the degree of the rational function?...

L3
Dynamical Systems
AMR-036-0009
Partially Solved

Hypotheses for analytic invariant curves

v1.3 research notes

Let $C$ be an analytic invariant curve of a rational function $f$, suppose $f:C\to C$ is not a homeomorphism, and assume $C$ contains a repelling fixe...

L3
Dynamical Systems