English
Related papers

Related papers: Sommes friables d'exponentielles et applications

200 papers

We study averages over squarefree moduli of the size of exponential sums with polynomial phases. We prove upper bounds on various moments of such sums, and obtain evidence of un-correlation of exponential sums associated to different…

Number Theory · Mathematics 2021-07-15 Emmanuel Kowalski , Kannan Soundararajan

We propose an iterative estimating equations procedure for analysis of longitudinal data. We show that, under very mild conditions, the probability that the procedure converges at an exponential rate tends to one as the sample size…

Statistics Theory · Mathematics 2007-12-18 Jiming Jiang , Yihui Luan , You-Gan Wang

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

We propose a quadrature-based formula for computing the exponential function of matrices with a non-oscillatory integral on an infinite interval and an oscillatory integral on a finite interval. In the literature, existing quadrature-based…

Numerical Analysis · Mathematics 2024-12-02 Masato Suzuki , Ken'ichiro Tanaka

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is…

Formal Languages and Automata Theory · Computer Science 2011-12-13 Luke Schaeffer , Jeffrey Shallit

Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…

Combinatorics · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Number Theory · Mathematics 2026-04-22 Takafumi Miyazaki , Reese Scott , Robert Styer

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

Number Theory · Mathematics 2026-04-13 E. Malavika , Olivier Ramaré

We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging…

Optimization and Control · Mathematics 2022-10-17 Scott B. Lindstrom , Bruno F. Lourenço , Ting Kei Pong

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

Number Theory · Mathematics 2020-03-27 Samuel Porritt

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

Information Theory · Computer Science 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

Determination of linear combination of exponential functions with unknown rate constants from its sampled values is a problem of considerable interest. Here we present a constructive and explicit solution to this problem. Moments of such…

Classical Analysis and ODEs · Mathematics 2023-12-27 Pierce Ellingson , Farhad Jafari

We obtain asymptotic for the quantity $\int_0^1 \bigg|\sum_{n\le X}\tau_k(n)e(n\alpha)\bigg|d\alpha$ where $\tau_k(n) = \sum_{d_1\dots d_k = n} 1$. This follows from a quick application of the circle method. Along the way, we find minor arc…

Number Theory · Mathematics 2020-01-03 Mayank Pandey

We find estimates on the norms commutators of the form [f(x), y] in terms of the norm of [x, y] assuming that x and y are contractions in a C*-algebra A, with x normal and with spectrum within the domain of f. In particular we discuss [x^2,…

Operator Algebras · Mathematics 2015-04-16 Terry A. Loring , Fredy Vides

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

Number Theory · Mathematics 2015-06-12 Thomas Reuss

We consider large values of long linear exponential sums involving Fourier coefficients of holomorphic cusp forms. The sums we consider involve rational linear twists $e(nh/k)$ with sufficiently small denominators. We prove both pointwise…

Number Theory · Mathematics 2016-08-10 Esa V. Vesalainen

This paper is devoted to the construction of exponential integrators of first and second order for the time discretization of constrained parabolic systems. For this extend, we combine well-known exponential integrators for unconstrained…

Numerical Analysis · Mathematics 2019-07-08 Robert Altmann , Christoph Zimmer

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Symbolic Computation · Computer Science 2014-08-12 Qing-Hu Hou , Rong-Hua Wang