English
Related papers

Related papers: Covering shrinking polynomials by quasi progressio…

200 papers

We study the asymptotics of Schur polynomials with partitions $\lambda$ which are almost staircase; more precisely, partitions that differ from $((m-1)(N-1),(m-1)(N-2),\ldots,(m-1),0)$ by at most one component at the beginning as…

Probability · Mathematics 2020-09-01 Zhongyang Li

Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…

Numerical Analysis · Mathematics 2022-03-23 Paul Catala , Mathias Hockmann , Stefan Kunis , Markus Wageringel

This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…

Number Theory · Mathematics 2024-02-29 James Leng

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…

Number Theory · Mathematics 2019-11-01 Daniel Altman

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

Numerical Analysis · Computer Science 2015-09-02 Roel Matthysen , Daan Huybrechs

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…

Quantum Physics · Physics 2023-12-21 Jop Briët , Francisco Escudero Gutiérrez

This work is a thorough investigation of skew-orthogonal polynomials with respect to a quartic Freud weight. We provide an explicit method to evaluate skew-orthogonal polynomials of any degree as linear combinations of orthogonal…

Classical Analysis and ODEs · Mathematics 2026-04-27 Costanza Benassi , Marta Dell'Atti

In a recent joint paper with S. Sahi and V. Venkateswaran (2025), families of actions of the double affine Hecke algebra on spaces of quasi-polynomials were introduced. These so-called quasi-polynomial representations led to the…

Representation Theory · Mathematics 2025-10-16 Jasper Stokman

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

Optimization and Control · Mathematics 2023-04-19 Francis Bach , Alessandro Rudi

By assuming some widely-believed arithmetic conjectures, we show that the task of accepting a number that is representable as a sum of $d\geq2$ squares subjected to given congruence conditions is NP-complete. On the other hand, we develop…

Number Theory · Mathematics 2018-09-06 Naser T Sardari

Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…

Number Theory · Mathematics 2020-08-27 Emil-Alexandru Ciolan , Pedro A. García-Sánchez , Pieter Moree

An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called Cover by…

Computational Complexity · Computer Science 2023-12-12 Ivan Bliznets , Jesper Nederlof , Krisztina Szilágyi

We show that smooth numbers are equidistributed in arithmetic progressions to moduli of size $x^{66/107-o(1)}$. This overcomes a longstanding barrier of $x^{3/5-o(1)}$ present in previous works of Bombieri-Friedlander-Iwaniec,…

Number Theory · Mathematics 2025-09-17 Alexandru Pascadi

In this paper, we introduce a family of symmetric polynomials by specializing the factorial Schur polynomials. These polynomials represent the weighted Schubert classes of the cohomology of the weighted Grassmannian introduced by…

Combinatorics · Mathematics 2015-02-02 Hiraku Abe , Tomoo Matsumura

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

This work investigates the invariance of the non-necessarily finite uniform dimension and related concepts for subextensions in skew polynomial rings \mbox{$ \mathbb{S}=R[ \mathbf{\mathrm{X}}; \mathbf{\alpha} , \mathbf{\delta} ]$} of…

Rings and Algebras · Mathematics 2026-02-04 Bertrand Nguefack

The aim of this paper is to investigate the quality of approximation of almost time and almost band-limited functions by its expansion in three classical orthogonal polynomials bases: the Hermite, Legendre and Chebyshev bases. As a…

Classical Analysis and ODEs · Mathematics 2017-05-03 Philippe Jaming , Abderrazek Karoui , Susanna Spektor

Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…

Number Theory · Mathematics 2025-08-15 Kenneth Chung Tak Chiu

The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}X_j^{2m_j}]\geq\prod_{j=1}^{n}E[X_j^{2m_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and $m_1,\dots,m_n\in\mathbb{N}$. In this…

Probability · Mathematics 2022-10-17 Oliver Russell , Wei Sun
‹ Prev 1 3 4 5 6 7 10 Next ›