Unsolved Problems

Showing 651-700 of 916 problems (Page 14 of 19)

EP-1110
Open

Erdős Problem #1110

Let $p>q\geq 2$ be two coprime integers. We call $n$ representable if it is the sum of integers of the form $p^kq^l$, none of which divide each other....

L1
Number Theory
EP-1111
Open

Erdős Problem #1111

If $G$ is a finite graph and $A,B$ are disjoint sets of vertices then we call $A,B$ anticomplete if there are no edges between $A$ and $B$. If $t,c\ge...

L1
Graph Theory
EP-1112
Open

Erdős Problem #1112

Let $1\leq d_1<d_2$ and $k\geq 3$. Does there exist an integer $r$ such that if $B=\{b_1<\cdots\}$ is a lacunary sequence of positive integers with $b...

L1
Number Theory
EP-1113
Open

Erdős Problem #1113

A positive odd integer $m$ such that none of $2^km+1$ are prime for $k\geq 0$ is called a Sierpinski number. We say that a set of primes $P$ is a cove...

L1
Number Theory
EP-1117
Open

Erdős Problem #1117

Let $f(z)$ be an entire function which is not a monomial. Let $ u(r)$ count the number of $z$ with $\lvert z\rvert=r$ such that $\lvert f(z)\rvert=\ma...

L1
Combinatorics
EP-1120
Open

Erdős Problem #1120

Let $f\in \mathbb{C}[z]$ be a monic polynomial of degree $n$, all of whose roots satisfy $\lvert z\rvert\leq 1$. Let $ E= \{ z : \lvert f(z)\rvert \le...

L1
Graph Theory
EP-1122
Open

Erdős Problem #1122

Let $f:\mathbb{N}\to \mathbb{R}$ be an additive function (i.e. $f(ab)=f(a)+f(b)$ whenever $(a,b)=1$). Let $ A=\{ n \geq 1: f(n+1)< f(n)\}. $ If $\lver...

L1
Combinatorics
EP-1129
Open

Erdős Problem #1129

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Geometry
EP-1130
Open

Erdős Problem #1130

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
EP-1131
Open

Erdős Problem #1131

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
EP-1132
Open

Erdős Problem #1132

For $x_1,\ldots,x_n\in [-1,1]$ let $ l_k(x)=\frac{\prod_{i eq k}(x-x_i)}{\prod_{i eq k}(x_k-x_i)}, $ which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$...

L1
Combinatorics
EP-1133
Open

Erdős Problem #1133

Let $C>0$. There exists $\epsilon>0$ such that if $n$ is sufficiently large the following holds. For any $x_1,\ldots,x_n\in [-1,1]$ there exist $y_1,\...

L1
Graph Theory
OPG-3031
Open

trace inequality

Let $A,B$ be positive semidefinite, by Jensen's inequality, it is easy to see $[tr(A^s+B^s)]^{\frac{1}{s}}\leq [tr(A^r+B^r)]^{\frac{1}{r}}$, whenever ...

L1
Algebra
OPG-48715
Open

Sub-atomic product of funcoids is a categorical product

Conjecture In the category of continuous funcoids (defined similarly to the category of topological spaces) the following is a direct categorical prod...

L1
Algebra
OPG-50149
Open

inverse of an integer matrix

Question I've been working on this for a long time and I'm getting nowhere. Could you help me or at least tell me where to look for help. Suppose D is...

L1
Algebra
OPG-57824
Open

Graphs of exact colorings

Conjecture For $c \geq m \geq 1$, let $P(c,m)$ be the statement that given any exact $c$-coloring of the edges of a complete countably infinite graph ...

L1
Algebra
OPG-60031
Open

Waring rank of determinant

Question What is the Waring rank of the determinant of a $d \times d$ generic matrix? For simplicity say we work over the complex numbers. The $d \ti...

L1
Algebra
OPG-36928
Open

Criterion for boundedness of power series

Question Give a necessary and sufficient criterion for the sequence $(a_n)$ so that the power series $\sum_{n=0}^{\infty} a_n x^n$ is bounded for all ...

L1
Analysis
OPG-37185
Open

Something like Picard for 1-forms

Conjecture Let $D$ be the open unit disk in the complex plane and let $U_1,\dots,U_n$ be open sets such that $\bigcup_{j=1}^nU_j=D\setminus\{0\}$. Sup...

L1
Analysis
OPG-41335
Open

Inequality for square summable complex series

Conjecture For all $\alpha=(\alpha_1,\alpha_2,\ldots)\in l_2(\cal{C})$ the following inequality holds $$\sum_{n\geq 1}|\alpha_n|^2\geq \frac{6}{\pi^2}...

L1
Analysis
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
OPG-357
Open

A conjecture on iterated circumcentres

Conjecture Let $p_1,p_2,p_3,\ldots$ be a sequence of points in ${\mathbb R}^d$ with the property that for every $i \ge d+2$, the points $p_{i-1}, p_{i...

L1
Geometry
OPG-588
Open

Big Line or Big Clique in Planar Point Sets

Let $S$ be a set of points in the plane. Two points $v$ and $w$ in $S$ are visible with respect to $S$ if the line segment between $v$ and $w$ contain...

L1
Geometry
OPG-605
Open

Average diameter of a bounded cell of a simple arrangement

Conjecture The average diameter of a bounded cell of a simple arrangement defined by $n$ hyperplanes in dimension $d$ is not greater than $d$....

L1
Geometry
OPG-720
Open

Convex 'Fair' Partitions Of Convex Polygons

Basic Question: Given any positive integer n, can any convex polygon be partitioned into n convex pieces so that all pieces have the same area and sam...

L1
Geometry
OPG-37084
Open

Edge-Colouring Geometric Complete Graphs

Question What is the minimum number of colours such that every complete geometric graph on $n$ vertices has an edge colouring such that: \item[Varian...

L1
Geometry
OPG-37086
Open

Partition of Complete Geometric Graph into Plane Trees

Conjecture Every complete geometric graph with an even number of vertices has a partition of its edge set into plane (i.e. non-crossing) spanning tree...

L1
Geometry
OPG-37286
Open

Point sets with no empty pentagon

Problem Classify the point sets with no empty pentagon....

L1
Geometry