Mathematics Problem Archive

Showing 451-500 of 619 problems (Page 10 of 13)

AMR-011-0028
Open

Some Questions — Question 28

v1.3 research notes

Does every infinite Cayley graph, or every infinite vertex-transitive graph, have a spanning tree without leaves?...

L3
Graph Theory
AMR-011-0029
Open

Some Questions — Question 29

v1.3 research notes

In every infinite Cayley graph, does the density of dead ends tend to zero?...

L3
Graph Theory
AMR-011-0030
Open

Some Questions — Question 30

v1.3 research notes

Are factors of i.i.d. on the $3$-regular tree closed in the weak topology? In particular, is the weak limit of majority functions on $n$-balls a facto...

L3
Graph Theory
AMR-011-0033
Open

Some Questions — Question 33

v1.3 research notes

For every $k>1$, does there exist $C(k)<1$ such that the return probability of every transient $k$-regular Cayley graph is at most $C(k)$?...

L3
Graph Theory
AMR-011-0036
Open

Some Questions — Question 36

v1.3 research notes

Let $(G_n)$ and $(H_n)$ converge to the same graph limit, and let $(T_n)$ be a convergent sequence with each $T_n$ a spanning tree of $G_n$. Do there ...

L3
Graph Theory
AMR-011-0037
Open

Some Questions — Question 37

v1.3 research notes

Let $G$ be a bounded-degree expander, or strongly ergodic, graphing that can be properly colored by $C$ colors with arbitrarily small error. Can it be...

L3
Graph Theory
AMR-027-0203
Open

10 Lectures and 42 Open Problems — The planted clique problem

v1.3 research notes

Is there a polynomial time algorithm that is able to find the largest clique of $G$ (with high probability) for $\omega \ll \sqrt{n}$ ? For example, f...

L3
Graph Theory
AMR-054-0017
Open

Visibility Graph Recognition

v1.3 research notes

Given a visibility graph $G$ and a Hamiltonian circuit $C$, determine in polynomial time whether there is a simple polygon whose vertex visibility gra...

L4
Graph Theory
AMR-054-0046
Open

3D Minimum-Bend Orthogonal Graph Drawings

v1.3 research notes

Does every simple graph with maximum vertex degree $\Delta \leq 6$ have a 3D orthogonal point-drawing with no more than two bends per edge? A 3D ortho...

L3
Graph Theory
AMR-073-0001
Open

Babai's problem

v1.3 research notes

Babai's problem: which groups are Babai invariant groups?...

L3
Graph Theory
AMR-083-0002
Open

O3 — Finding a prime above a bound

v1.3 research notes

Given $n\in\mathbb{N}$, can a prime $p>n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0003
Open

O4 — Finding a prime in an arithmetic progression

v1.3 research notes

Given coprime $a,n\in\mathbb{N}$, can a prime $p\equiv a\pmod n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0004
Open

O5a — Deterministic polynomial-time integer factorization

v1.3 research notes

Is complete integer factorization $C_5$ in deterministic polynomial time $P$?...

L3
Graph Theory
AMR-083-0005
Open

O5b — Randomized polynomial-time integer factorization

v1.3 research notes

Is complete integer factorization $C_5$ in randomized polynomial time $R$?...

L3
Graph Theory
AMR-083-0006
Open

O6 — Factoring a positive-density set of integers

v1.3 research notes

Does there exist a set $S\subset\mathbb{N}$ of positive lower asymptotic density for which complete factorization of every input $n\in S$ is in determ...

L3
Graph Theory
AMR-083-0007
Open

O7a — Computing the squarefree part

v1.3 research notes

Given $n$, can one find $r,s\in\mathbb{N}$ with $n=r^2s$ and $s$ squarefree in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0008
Open

O7b — Factoring from a squarefree-part oracle

v1.3 research notes

Is complete integer factorization randomized polynomial-time reducible to computation of the squarefree part?...

L3
Graph Theory
AMR-083-0010
Open

O9 — Counting distinct prime factors

v1.3 research notes

Can $\omega(n)$, the number of distinct prime factors of $n$, be computed in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0012
Open

O11a — Quadratic residuosity modulo a composite

v1.3 research notes

Can one decide in deterministic polynomial time whether a coprime integer $a$ is a square modulo a composite $n$?...

L3
Graph Theory
AMR-083-0013
Open

O11b — Factoring from composite quadratic residuosity

v1.3 research notes

Is complete integer factorization randomized polynomial-time reducible to deciding quadratic residuosity modulo a composite?...

L3
Graph Theory
AMR-083-0014
Open

O12 — Finding a quadratic nonresidue

v1.3 research notes

Given a prime $p$, can a quadratic nonresidue modulo $p$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0015
Open

O13 — Realizing a prescribed quadratic signature

v1.3 research notes

Given a sign vector $\varepsilon\in\{-1,1\}^k$, can the least prime $p$ satisfying $(p_i/p)=\varepsilon_i$ for every $i\le k$ be found in deterministi...

L3
Graph Theory
AMR-083-0016
Open

O14 — Square roots modulo a prime

v1.3 research notes

Given a prime $p$ and a quadratic residue $a$, can a square root $x^2\equiv a\pmod p$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0017
Open

O15 — Polynomial roots modulo a prime

v1.3 research notes

Given a prime $p$ and $f\in(\mathbb{Z}/p\mathbb{Z})[x]$ known to have a root, can a root be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0018
Open

O16 — Factoring polynomials modulo a prime

v1.3 research notes

Given a prime $p$ and $f\in(\mathbb{Z}/p\mathbb{Z})[x]$, can the complete irreducible factorization of $f$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0020
Open

O18a — Recognizing primitive roots deterministically

v1.3 research notes

Given a prime $p$ and $b$, can one decide in deterministic polynomial time whether $b$ generates $(\mathbb{Z}/p\mathbb{Z})^*$?...

L3
Graph Theory
AMR-083-0021
Open

O18b — Recognizing primitive roots randomly

v1.3 research notes

Is recognition of primitive roots modulo a prime in randomized polynomial time $R$?...

L3
Graph Theory
AMR-083-0022
Open

O19 — Finding a primitive root modulo a prime

v1.3 research notes

Given a prime $p$, can a generator of $(\mathbb{Z}/p\mathbb{Z})^*$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0023
Open

O20 — Computing multiplicative orders modulo a prime

v1.3 research notes

Given a prime $p$ and $a$ coprime to $p$, can $\operatorname{ord}_p(a)$ be computed in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0024
Open

O21 — Discrete logarithms modulo a prime

v1.3 research notes

Given a prime $p$ and elements $g,b$ with $b$ in the subgroup generated by $g$, can an exponent $x$ satisfying $g^x\equiv b\pmod p$ be found in determ...

L3
Graph Theory
AMR-083-0025
Open

O22a — Discrete logarithms modulo a composite

v1.3 research notes

Given $g,b,n$ such that $g^x\equiv b\pmod n$ has a solution, can such an exponent $x$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0029
Open

O25 — Solving binary quadratic congruences

v1.3 research notes

Given $k,m,n$ with odd $n$ and $\gcd(km,n)=1$, can integers $x,y$ satisfying $x^2-ky^2\equiv m\pmod n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0030
Open

O26 — Discrete logarithm versus Diffie–Hellman key distribution

v1.3 research notes

Is discrete logarithm modulo a prime randomized polynomial-time reducible to computing $g^{xy}$ from $g,g^x,g^y$?...

L4
Graph Theory
AMR-083-0031
Open

O27 — Elliptic curves of prescribed order

v1.3 research notes

Given a prime $p$ and $n$, can one construct in deterministic polynomial time an elliptic curve over $\mathbb{F}_p$ having exactly $n$ points whenever...

L3
Graph Theory
AMR-083-0032
Open

O28 — Discrete logarithms in elliptic-curve groups

v1.3 research notes

Given an elliptic curve over $\mathbb{F}_p$ and points $P,Q$ such that $P=nQ$ for some $n$, can such an $n$ be found in deterministic polynomial time?...

L3
Graph Theory
AMR-083-0039
Open

O34 — Solvability of the negative Pell equation

v1.3 research notes

Can one decide in deterministic polynomial time whether $x^2-dy^2=-1$ has an integral solution?...

L3
Graph Theory
AMR-084-0001
Open

Absolute bounds for rational Diophantine tuples

v1.3 research notes

Is there an absolute upper bound for the size of a rational Diophantine $m$-tuple, a set of nonzero rationals for which the product of every two disti...

L4
Graph Theory
AMR-084-0002
Open

Exceptional parameters without D(n)-quadruples

v1.3 research notes

For each $n\in\{-3,3,5,8,12,20\}$, prove that no set of four distinct positive integers has property $D(n)$, meaning that every pairwise product plus ...

L3
Graph Theory
AMR-084-0003
Open

Finiteness of parameters admitting at most two D(n)-quadruples

v1.3 research notes

Let $U$ be the set of integers $n\not\equiv2\pmod4$ for which there are at most two distinct $D(n)$-quadruples. Is $U$ finite?...

L4
Graph Theory
AMR-084-0004
Open

Finiteness of D(n)-quadruples for nonsquare n

v1.3 research notes

For every nonzero integer $n$ that is not a square, are there only finitely many $D(n)$-quadruples?...

L3
Graph Theory
AMR-084-0006
Open

Triples having property D(n) for several parameters

v1.3 research notes

Are there infinitely many Diophantine triples that are also $D(n)$-triples for three distinct integers $n\ne1$?...

L4
Graph Theory
AMR-084-0009
Open

Existence of a strong rational Diophantine quadruple

v1.3 research notes

Does there exist a set of four nonzero rational numbers $\{a_1,a_2,a_3,a_4\}$ such that $a_i a_j+1$ is a rational square for every $1\le i,j\le4$, inc...

L3
Graph Theory
AMR-084-0010
Open

Degree-only bounds for polynomial D(n)-tuples

v1.3 research notes

Let $P_n$ be the supremum of the sizes of nondegenerate polynomial $D(n)$-tuples over $\mathbb{Z}[X]$. Find an upper bound for $P_n$ depending only on...

L4
Graph Theory
AMR-086-0001
Open

Problem 1.1

v1.3 research notes

Let $f\in\mathbb{Z}[X,Y]$ be a polynomial such that the equation $f(x,y)=0$ has only finitely many solutions $(x,y)\in \mathbb{Z}\times\mathbb{Z}$. Gi...

L3
Graph Theory
AMR-086-0003
Open

Conjecture 1.4 — Shorey

v1.3 research notes

There exists a positive number $C$ which depends only on $L$ and $H$ with the following property. Let $m$, $x$ and $y$ be rational integers with $m\ge...

L3
Graph Theory
AMR-086-0004
Open

Conjecture 1.5

v1.3 research notes

Let $k\ge 2$ be an integer and $\alpha_1,\ldots,\alpha_n$ be non-zero elements in a field $K$ of zero characteristic, such that no quotient $\alpha_i/...

L3
Graph Theory
AMR-086-0006
Open

Conjecture 1.7

v1.3 research notes

If there is no prime in the interval $[n+1,n+k]$, then the product $(n+1)\cdots(n+k)$ has at least $k$ distinct prime divisors....

L3
Graph Theory
AMR-086-0007
Open

Conjecture 1.8 — Langevin

v1.3 research notes

Given an increasing sequence $n_1<n_2<\cdots<n_k$ of positive integers such that $n_1,n_2,\ldots,n_k$ are multiplicatively dependent, there exists a p...

L3
Graph Theory
AMR-086-0008
Open

Conjecture 1.9

v1.3 research notes

Fix a positive integer $m$ for which the equation $$ m^2 + m_1^2 + m_2^2 = 3 mm_1m_2 $$ has a solution in positive integers $(m_1,m_2)$ with $0<m_1\le...

L3
Graph Theory
AMR-086-0012
Open

Conjecture 2.4 — Philippon

v1.3 research notes

There exist real numbers $\varepsilon$, $\alpha$ and $\beta$ with $0<\varepsilon<1/2$, $\alpha\ge 1$ and $\beta\ge 0$, and a positive integer $B$, suc...

L3
Graph Theory