Unsolved Problems

Showing 301-316 of 316 problems (Page 7 of 7)

OPG-491
Open

Odd incongruent covering systems

Conjecture There is no covering system whose moduli are odd, distinct, and greater than 1....

L2
Number Theory
OPG-563
Open

Davenport's constant

For a finite (additive) abelian group $G$, the Davenport constant of $G$, denoted $s(G)$, is the smallest integer $t$ so that every sequence of elemen...

L2
Number Theory
OPG-655
Open

Snevily's conjecture

Conjecture Let $G$ be an abelian group of odd order and let $A,B \subseteq G$ satisfy $|A| = |B| = k$. Then the elements of $A$ and $B$ may be ordered...

L2
Number Theory
OPG-60052
Open

KPZ Universality Conjecture

Conjecture Formulate a central limit theorem for the KPZ universality class....

L2
Probability
OPG-445
Open

The robustness of the tensor product

Problem Given two codes $R,C$, their Tensor Product $R \otimes C$ is the code that consists of the matrices whose rows are codewords of $R$ and whose ...

L2
Computer Science
OPG-163
Open

Subset-sums equality (pigeonhole version)

Problem Let $a_1,a_2,\ldots,a_n$ be natural numbers with $\sum_{i=1}^n a_i < 2^n - 1$. It follows from the pigeon-hole principle that there exist dist...

L2
Computer Science
OPG-2150
Open

Discrete Logarithm Problem

If $p$ is prime and $g,h \in {\mathbb Z}_p^*$, we write $\log_g(h) = n$ if $n \in {\mathbb Z}$ satisfies $g^n = h$. The problem of finding such an int...

L2
Computer Science
OPG-454
Open

Unconditional derandomization of Arthur-Merlin games

Problem Prove unconditionally that $\mathcal{AM}$ $\subseteq$ $\Sigma_2$....

L2
Computer Science
OPG-51618
Open

P vs. BPP

Conjecture Can all problems that can be computed by a probabilistic Turing machine (with error probability < 1/3) in polynomial time be solved by a de...

L2
Computer Science
OPG-36884
Open

Refuting random 3SAT-instances on $O(n)$ clauses (weak form)

Conjecture For every rational $\epsilon > 0$ and every rational $\Delta$, there is no polynomial-time algorithm for the following problem. Given is a...

L2
Computer Science
OPG-1783
Open

Rank vs. Genus

Question Is there a hyperbolic 3-manifold whose fundamental group rank is strictly less than its Heegaard genus? How much can the two differ by?...

L2
Topology
OPG-37154
Open

Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere?

Problem Determine a computable set of invariants that allow one to determine, given a compact boundaryless 3-manifold, whether or not it embeds smooth...

L2
Topology
OPG-37161
Open

Is there an algorithm to determine if a triangulated 4-manifold is combinatorially equivalent to the 4-sphere?

Problem Is there an algorithm which takes as input a triangulated 4-manifold, and determines whether or not this manifold is combinatorially equivalen...

L2
Topology
OPG-37237
Open

Unsolvability of word problem for 2-knot complements

Problem Does there exist a smooth/PL embedding of $S^2$ in $S^4$ such that the fundamental group of the complement has an unsolvable word problem?...

L2
Topology
OPG-60043
Open

Several ways to apply a (multivalued) multiargument function to a family of filters

Problem Let $\mathcal{X}$ be an indexed family of filters on sets. Which of the below items are always pairwise equal? 1. The funcoid corresponding t...

L2
Topology
OPG-581
Open

Rendezvous on a line

Problem Two players start at a distance of 2 on an (undirected) line (so, neither player knows the direction of the other) and both move at a maximum ...

L2
Miscellaneous