English
Related papers

Related papers: Exponential sums equations and the Exponential Clo…

200 papers

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

Logic · Mathematics 2007-05-23 Fredrik Engström

A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…

General Mathematics · Mathematics 2020-08-21 Ken Surendran , Desarazu Krishna Babu

For two matrices $A$ and $B$, and large $n$, we show that most products of $n$ factors of $e^{A/n}$ and $n$ factors of $e^{B/n}$ are close to $e^{A + B}$. This extends the Lie-Trotter formula. The elementary proof is based on the relation…

Combinatorics · Mathematics 2022-07-19 Michael Anshelevich , Austin Pritchett

Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…

Numerical Analysis · Mathematics 2021-06-15 Ibrahim Alabdulmohsin

We consider a class of double exponential sums studied in a paper of Sinai and Ulcigrai. They proved a linear bound for these sums along the sequence of denominators in the continued fraction expansion of $\alpha$, provided $\alpha$ is…

Number Theory · Mathematics 2015-10-28 Christopher J. White

Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…

Neural and Evolutionary Computing · Computer Science 2023-12-15 Esteban Real , Yao Chen , Mirko Rossini , Connal de Souza , Manav Garg , Akhil Verghese , Moritz Firsching , Quoc V. Le , Ekin Dogus Cubuk , David H. Park

Suppose that h in F[x,y,z], char F=2, defines a nodal cubic. In earlier papers we made a precise conjecture as to the Hilbert-Kunz functions attached to the powers of h. Assuming this conjecture we showed that a class of characteristic 2…

Commutative Algebra · Mathematics 2009-08-10 Paul Monsky

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…

Number Theory · Mathematics 2024-03-05 Takafumi Miyazaki , István Pink

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…

Number Theory · Mathematics 2025-04-15 Maohua Le , Takafumi Miyazaki

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Number Theory · Mathematics 2011-02-21 S. G. Dani , Arnaldo Nogueira

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

Number Theory · Mathematics 2023-02-23 Valentin Blomer , Lasse Grimmelt , Junxian Li , Simon L. Rydin Myerson

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

Information Theory · Computer Science 2019-04-18 Jingbo Liu , Mohammad H. Yassaee , Sergio Verdú

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…

Optimization and Control · Mathematics 2026-05-28 Amir Ali Ahmadi , Sanjeeb Dash , Yixuan Hua , Bartolomeo Stellato

Several asymptotic expansions and formulas for cubic exponential sums are derived. The expansions are most useful when the cubic coefficient is in a restricted range. This generalizes previous results in the quadratic case and helps to…

Number Theory · Mathematics 2017-07-13 Ghaith A. Hiary

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

Artificial Intelligence · Computer Science 2019-03-07 Nico Potyka

Let A be an idempotent algebra on a finite domain. By mediating between results of Chen and Zhuk, we argue that if A satisfies the polynomially generated powers property (PGP) and B is a constraint language invariant under A (that is, in…

Computational Complexity · Computer Science 2021-06-25 Catarina Carvalho , Florent Madelaine , Barnaby Martin , Dmitriy Zhuk

Exponential families comprise a broad class of statistical models and parametric families like normal distributions, binomial distributions, gamma distributions or exponential distributions. Thereby the formal representation of its…

Statistics Theory · Mathematics 2020-06-23 Patrick Michl

We determine the exact Borel class of the points whose iterates under $\exp(z)+a$ tend to infinity. We also prove that the sets of non-escaping Julia points for many of these functions are topologically equivalent.

General Topology · Mathematics 2024-04-02 David S. Lipham
‹ Prev 1 8 9 10 Next ›