Related papers: On the Complexity of Modulo-q Arguments and the Ch…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

We study the category of $\mathbf{P}$-equivariant modules over the infinite variable polynomial ring, where $\mathbf{P}$ denotes the subgroup of the infinite general linear group $\mathbf{GL}(\mathbf{C}^\infty)$ consisting of elements…

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…

Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teuli\'e asked whether $\inf_{q \ge 1} \, q \cdot || q \alpha || \cdot |…

We study the query complexity analogue of the class TFNP of total search problems. We give a way to convert partial functions to total search problems under certain settings; we also give a way to convert search problems back into partial…

A path query extracts vertex tuples from a labeled graph, based on the words that are formed by the paths connecting the vertices. We study the computational complexity of measuring the contribution of edges and vertices to an answer to a…

The question of whether all problems in NP class are also in P class is generally considered one of the most important open questions in mathematics and theoretical computer science as it has far-reaching consequences to other problems in…

We define a new class of predicates called equilevel predicates on a distributive lattice which eases the analysis of parallel algorithms. Many combinatorial problems such as the vertex cover problem, the bipartite matching problem, and the…

Following attempts at an analytic proof of the Pentagonal Number Theorem, we report on the discovery of a general principle leading to an unexpected cancellation of oscillating sums. After stating the motivation, and our theorem, we apply…

The problem of estimating the spectral gap of a local Hamiltonian is known to be contained in the class $P^{QMA[log]}$: polynomial time with access to a logarithmic number of QMA queries. The problem was shown to be hard for…

We study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

We present a formula for the Poincar\'e dual in the flag manifold of the equivariant fundamental class of any regular nilpotent or regular semisimple Hessenberg variety as a polynomial in terms of certain Chern classes. We then develop a…

Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…

We present a heuristic algorithm to compute the ideal class group, and a generator of a principal ideal in $\mathbb{Q}(\zeta_{p^s})$ in time $2^{O(n^{1/2+\varepsilon})}$ for $n:= deg(K)$ and arbitrarily small $\varepsilon$. This yields an…

The distribution of $\alpha p$ modulo one, where $p$ runs over the rational primes and $\alpha$ is a fixed irrational real, has received a lot of attention. It is natural to ask for which exponents $\nu>0$ one can establish the infinitude…

This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive…

Let $P = \Bbbk[x1,x2,x3]$ be a unimodular quadratic Poisson algebra and let $G$ be a finite subgroup of the graded Poisson automorphism group of $P$. In this paper, we prove a variant of the Shephard-Todd-Chevalley theorem for $P$ and…

In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…