Unsolved Problems

Showing 1-23 of 23 problems

OPG-426
Open

Long rainbow arithmetic progressions

For $k\in \mathbb{N}$ let $T_k$ denote the minimal number $t\in \mathbb{N}$ such that there is a rainbow $AP(k)$ in every equinumerous $t$-coloring of...

L1
Combinatorics
OPG-478
Open

Rainbow AP(4) in an almost equinumerous coloring

Problem Do 4-colorings of $\mathbb{Z}_{p}$, for $p$ a large prime, always contain a rainbow $AP(4)$ if each of the color classes is of size of either ...

L1
Combinatorics
OPG-618
Open

Monotone 4-term Arithmetic Progressions

Question Is it true that every permutation of positive integers must contain monotone 4-term arithmetic progressions?...

L1
Combinatorics
OPG-1797
Open

2-accessibility of primes

Question Is the set of prime numbers 2-accessible?...

L1
Combinatorics
OPG-1825
Open

3-accessibility of Fibonacci numbers

Question Is the set of Fibonacci numbers 3-accessible?...

L1
Combinatorics
OPG-2063
Open

Wide partition conjecture

Conjecture An integer partition is wide if and only if it is Latin....

L1
Combinatorics
OPG-37222
Open

Dividing up the unrestricted partitions

Begin with the generating function for unrestricted partitions: (1+x+x^2+...)(1+x^2+x^4+...)(1+x^3+x^6+...)... Now change some of the plus signs to ...

L1
Combinatorics
OPG-37226
Open

Sequence defined on multisets

Conjecture Define a $2 \times n$ array of positive integers where the first row consists of some distinct positive integers arranged in increasing ord...

L1
Combinatorics
OPG-37228
Open

Square achievement game on an n x n grid

Problem Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an $n \times n$ grid. The first player (if...

L1
Combinatorics
OPG-37230
Open

Transversal achievement game on a square grid

Problem Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an $n \times n$ grid. The first player (if...

L1
Combinatorics
OPG-37416
Open

Length of surreal product

Conjecture Every surreal number has a unique sign expansion, i.e. function $f: o\rightarrow \{-, +\}$, where $o$ is some ordinal. This $o$ is the leng...

L1
Combinatorics
OPG-60000
Open

The Double Cap Conjecture

Conjecture The largest measure of a Lebesgue measurable subset of the unit sphere of $\mathbb{R}^n$ containing no pair of orthogonal vectors is attain...

L1
Combinatorics
OPG-60002
Open

Saturation in the Hypercube

Question What is the saturation number of cycles of length $2\ell$ in the $d$-dimensional hypercube?...

L1
Combinatorics
OPG-60003
Open

Extremal $4$-Neighbour Bootstrap Percolation in the Hypercube

Problem Determine the smallest percolating set for the $4$-neighbour bootstrap process in the hypercube....

L1
Combinatorics
OPG-60006
Open

Turán Problem for $10$-Cycles in the Hypercube

Problem Bound the extremal number of $C_{10}$ in the hypercube....

L1
Combinatorics
OPG-37196
Open

Perfect 2-error-correcting codes over arbitrary finite alphabets.

Conjecture Does there exist a nontrivial perfect 2-error-correcting code over any finite alphabet, other than the ternary Golay code?...

L1
Combinatorics
OPG-762
Open

Combinatorial covering designs

A $(v, k, t)$ covering design, or covering, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained i...

L1
Combinatorics
OPG-151
Open

The permanent conjecture

Conjecture If $A$ is an invertible $n \times n$ matrix, then there is an $n \times n$ submatrix $B$ of $[A A]$ so that $perm(B)$ is nonzero....

L1
Combinatorics
OPG-152
Open

The Alon-Tarsi basis conjecture

Conjecture If $B_1,B_2,\ldots B_p$ are invertible $n \times n$ matrices with entries in ${\mathbb Z}_p$ for a prime $p$, then there is a $n \times (p-...

L1
Combinatorics
OPG-692
Open

Equality in a matroidal circumference bound

Question Is the binary affine cube $AG(3,2)$ the only 3-connected matroid for which equality holds in the bound $$E(M) \leq c(M) c(M^*) / 2$$where$c(M...

L1
Combinatorics
OPG-59928
Open

Saturated $k$-Sperner Systems of Minimum Size

Question Does there exist a constant $c>1/2$ and a function $n_0(k)$ such that if $|X|\geq n_0(k)$, then every saturated $k$-Sperner system $\mathcal{...

L1
Combinatorics
OPG-404
Open

Concavity of van der Waerden numbers

For $k$ and $\ell$ positive integers, the (mixed) van der Waerden number $w(k,\ell)$ is the least positive integer $n$ such that every (red-blue)-colo...

L1
Combinatorics
OPG-2359
Open

Edge-antipodal colorings of cubes

We let $Q_d$ denote the $d$-dimensional cube graph. A map $\phi: E(Q_d) \rightarrow \{0,1\}$ is called edge-antipodal if $\phi(e) \neq \phi(e')$ whene...

L1
Combinatorics