English
Related papers

Related papers: Exponential Separation Between Powers of Regular a…

200 papers

Askey and Gasper (1976) proved a trigonometric inequality which improves another trigonometric inequality found by M. S. Robertson (1945). Here these inequalities are reformulated in terms of the Chebyshev polynomial of the first kind $T_n$…

Classical Analysis and ODEs · Mathematics 2020-01-22 Geno Nikolov

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & *…

Group Theory · Mathematics 2023-12-20 Yuri Santos Rego

Decision trees have long been recognized as models of choice in sensitive applications where interpretability is of paramount importance. In this paper, we examine the computational ability of Boolean decision trees in deriving, minimizing,…

Artificial Intelligence · Computer Science 2021-09-07 Gilles Audemard , Steve Bellart , Louenas Bounia , Frédéric Koriche , Jean-Marie Lagniez , Pierre Marquis

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

Computational Complexity · Computer Science 2014-09-10 Albert Atserias , Massimo Lauria , Jakob Nordström

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

Number Theory · Mathematics 2026-01-21 Alina Ostafe , Igor E. Shparlinski

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

Number Theory · Mathematics 2023-07-21 Mayank Pandey , Maksym Radziwiłł

We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…

History and Overview · Mathematics 2026-01-08 A. Skopenkov

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

Number Theory · Mathematics 2015-08-24 John Abbott

Recently, Shen (2016) and Alanazi et al. (2016) studied the arithmetic properties of the $\ell$-regular overpartition function $\overline{A}_\ell (n)$, which counts the number of overpartitions of $n$ into parts not divisible by $\ell$. In…

Number Theory · Mathematics 2017-06-12 Shane Chern

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…

Information Theory · Computer Science 2016-11-17 Neri Merhav

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…

Computational Geometry · Computer Science 2010-08-03 Daniel Werner , Matthias Lenz

This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…

Numerical Analysis · Mathematics 2024-05-08 Markus Holzleitner , Sergei Pereverzyev

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

Logic in Computer Science · Computer Science 2023-07-28 Fabian Mitterwallner , Aart Middeldorp , René Thiemann

We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful…

Computational Complexity · Computer Science 2016-02-09 Siu On Chan , James R. Lee , Prasad Raghavendra , David Steurer

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

Classical Analysis and ODEs · Mathematics 2017-10-31 Evgeniy Pustylnik

In this paper, we study the growth of transcendental entire solutions of linear difference equations \begin{equation} P_m(z)\Delta^mf(z)+\cdots+P_1(z)\Delta f(z)+P_0(z)f(z)=0,\tag{+} \end{equation} where $P_j(z)$ are polynomials for…

Complex Variables · Mathematics 2025-04-04 Xiong-Feng Liu , Zhi-Tao Wen , Can-Xin Zhu

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

Number Theory · Mathematics 2021-11-11 Igor E. Shparlinski

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Probability · Mathematics 2010-04-13 Vladimir Nikulin