Related papers: On RSA Moduli with Almost Half of the Bits Prescri…

The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

We present RSLR, an implicit higher-order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error probability smaller than 1/2. Analogously, a (less implicit) characterization of…

This paper considers '$\delta$-almost Reed-Muller codes', i.e., linear codes spanned by evaluations of all but a $\delta$ fraction of monomials of degree at most $d$. It is shown that for any $\delta > 0$ and any $\varepsilon>0$, there…

Let \rho be a modulo p representation of the absolute Galois group of a totally real number field. Under the assumptions that \rho has large image and admits a low weight crystalline modular deformation we show that any low weight…

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…

We analyse the representation of positive polynomials in terms of Sums of Squares. We provide a quantitative version of Putinar's Positivstellensatz over a compact basic semialgebraic set S, with a new polynomial bound on the degree of the…

We develop an explicit algebriac de Rham theory for relative completion of $\mathrm{SL}_2(\mathbb{Z})$. This allows the construction of iterated integrals involving modular forms of the second kind, generalizing iterated integrals of…

This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…

In this article, we collect the recent results concerning the representations of integers as sums of an even number of squares that are inspired by conjectures of Kac and Wakimoto. We start with a sketch of Milne's proof of two of these…

We have known that most sequences in $\mathcal{M}=\{1,2,\dots, M\}$ with length $n$ will miss $Me^{-\lambda}$ of the total numbers of $\{1,2,\dots,M\}$ as the ratio $n/M$ tends to $\lambda$. Now we consider a more general case where the…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

In our earlier paper we made a combinatorial study of (k,l)-admissible partitions. This object appeared already in the work of M. Primc as a label of a basis of level k-integrable modules over $\hat{sl}_l$. We clarify the relation between…

In this paper we study the effective degrees of freedom of a general class of reduced rank estimators for multivariate regression in the framework of Stein's unbiased risk estimation (SURE). We derive a finite-sample exact unbiased…

Automorphism Ensemble (AE) decoding has recently drawn attention as a possible alternative to list decoding of polar codes. In this letter, we investigate the distribution of Partially-Symmetric Reed-Muller (PS-RM) codes, a family of polar…

We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…

We introduce partial secondary invariants associated to complete Riemannian metrics which have uniformly positive scalar curvature outside a prescribed subset on a spin manifold. These can be used to distinguish such Riemannian metrics up…

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

To improve accuracy and speed of regressions and classifications, we present a data-based prediction method, Random Bits Regression (RBR). This method first generates a large number of random binary intermediate/derived features based on…

We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…