16 problems

Let $\mathcal{A}$ be a matrix. A set of initial minors is a set of minors of $\mathcal{A}$ whose cardinality is bounded by a polynomial or a sub-exponential function in the size of…

Let $p>3$ be prime. A primitive root modulo $p$ is an element generating $(\mathbb Z/p\mathbb Z)^*$. Brizolis's conjecture. There exist an integer $x$ and a primitive root…

Let $p$ be prime, let $g$ and $h$ range over the parameters defining the fixed-point counting function, and let $N_{, g \mathop\mathsf{ANY}, h \mathop\mathsf{ANY}}(p)$ denote the c…

Average auxiliary-count conjecture.

Average fixed-point conjectures.

Relative-primitivity scaling conjectures.

Two-cycle count conjectures.

Auxiliary solution-count conjectures.

Two-cycle counting conjectures.

Fixed-point counting conjectures.

Let $q$ be a prime power and let $\textbf{F}_{q^n}$ be a finite field. Let $g\in\textbf{F}_{q^n}$ satisfy the conditions in Theorem, and suppose that $n\geq\log q$. Large-order con…

Two-cycle counting conjectures. The paper conjectures

Let $l\in\mathbb{N}$, set $q=2^l$, and let $\beta\in\mathbb{F}_{q^6}^*$. Suppose that the quadratic equation … has two solutions $u_1,u_2\in\mathbb{F}_{q^6}$. Menezes–Teske–Weng's…

Let $\mathbb F_q$ be a finite field of odd characteristic. The polynomials $h_1,h_2\in\mathbb F_{q^d}[X]$ are required to be coprime and have degree at most $2$. Stronger polynomia…

Discrete logarithm problem conjecture. In well-chosen groups, computing $a$ from $(g,x)$ is conjectured to be very difficult, although exponentiation $(g,a)\mapsto g^a$ is very fas…

Pollard's conjecture. The same result as for powers of $2$ holds for powers of any integer $n\geq 2$ under this assumption.