Related papers: Factorization tests and algorithms arising from co…

In a 1987 letter, Serre proves that the systems of Hecke eigenvalues arising from mod $p$ modular forms (of fixed level $\Gamma(N)$ coprime to $p$, and any weight $k$) are the same as those arising from functions $\Omega(N) \to \bar{\mathbb…

We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column…

Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as…

In this article, we are interested in modular forms with non-vanishing central critical values and linear independence of Fourier coefficients of modular forms. The main ingredient is a generalization of a theorem due to VanderKam to…

We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

In this paper we construct a modular form f of weight one attached to an imaginary quadratic field K. This form, which is non-holomorphic and not a cusp form, has several curious properties. Its negative Fourier coefficients are non-zero…

In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Let $R$ be a root datum with affine Weyl group $W^e$, and let $H = H (R,q)$ be an affine Hecke algebra with positive, possibly unequal, parameters $q$. Then $H$ is a deformation of the group algebra $\mathbb C [W^e]$, so it is natural to…

In this paper we study the compatible family of degree-4 Scholl representations $\rho_{\ell}$ associated with a space $S$ of weight $\kappa> 2$ noncongruence cusp forms satisfying Quaternion Multiplications over a biquadratic field $K$. It…

Let $\ell \geq 5$ be a prime, and let $\nu_\eta$ denote the Dedekind eta multiplier. For an odd integer $r$, and a real Dirichlet character $\psi$, recent work of Ahlgren, Andersen, and the author showed that quadratic congruences modulo…

Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…

Given an positive integer $k$, let $n:=\binom{k+1}{2}$. In 2012, during a talk at UCLA, Jan Saxl conjectured that all irreducible representations of the symmetric group $S_n$ occur in the decomposition of the tensor square of the…

Let T_{n,k}(X) be the characteristic polynomial of the n-th Hecke operator acting on the space of cusp forms of weight k for the full modular group. We show that if there exists n>1 such that T_{n,k}(X) is irreducible and has the full…

We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring $S$, of which the…

The total multiplicity in the decomposition into irreducibles of the tensor product i x j of two irreducible representations of a simple Lie algebra is invariant under conjugation of one of them sum_k N_{i j}^{k}= sum_k N_{ibar j}^{k}. This…

The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…

We characterize the integers n such that $x\mapsto x^3$ describes a bijection from the set $\mathbb{Z}/n\mathbb{Z}$ to itself and we determine the frequency of these integers. Precisely, denoting by $W$ the set of these integers, we prove…

Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum…