English
Related papers

Related papers: An Efficient Version of the Bombieri-Vaaler Lemma

200 papers

In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of CNF formulas is always an upper bound on the width needed to refute them. Their proof is beautiful…

Computational Complexity · Computer Science 2014-09-11 Yuval Filmus , Massimo Lauria , Mladen Mikša , Jakob Nordström , Marc Vinyals

Let $k$ be a number field. For $\mathcal{H}\rightarrow \infty$, we give an asymptotic formula for the number of algebraic integers of absolute Weil height bounded by $\mathcal{H}$ and fixed degree over $k$.

Number Theory · Mathematics 2014-09-12 Fabrizio Barroero

Masser and Vaaler have given an asymptotic formula for the number of algebraic numbers of given degree $d$ and increasing height. This problem was solved by counting lattice points (which correspond to minimal polynomials over $\mathbb{Z}$)…

Number Theory · Mathematics 2018-03-16 Robert Grizzard , Joseph Gunther

We evaluate the variance of the number of lattice points in a small randomly rotated spherical ball on a surface of 3-dimensional sphere centered at the origin. Previously, Bourgain, Rudnick, and Sarnak showed conditionally on the…

Number Theory · Mathematics 2022-08-02 Andrei Shubin

We obtain the exact value of the Hausdorff dimension of the set of coefficients of Gauss sums which for a given $\alpha \in (1/2,1)$ achieve the order at least $N^{\alpha}$ for infinitely many sum lengths $N$. For Weyl sums with polynomials…

Number Theory · Mathematics 2021-08-25 Roger C. Baker , Changhao Chen , Igor E. Shparlinski

The fundamental problem of the calculus of variations on time scales concerns the minimization of a delta-integral over all trajectories satisfying given boundary conditions. In this paper we prove the second Euler-Lagrange necessary…

Optimization and Control · Mathematics 2011-02-22 Zbigniew Bartosiewicz , Natalia Martins , Delfim F. M. Torres

Following N. Elkies ("ABC implies Mordell") we show that the abc conjecture of Masser-Oesterle implies an effective version of Siegel's theorem about integral points on algebraic curves, i.e. an upper bound for the S-integral points where…

Number Theory · Mathematics 2007-05-23 Andrea Surroca

We establish a new upper bound for the number of rationals up to a given height in a missing-digit set, making progress towards a conjecture of Broderick, Fishman, and Reich. This enables us to make novel progress towards another conjecture…

Number Theory · Mathematics 2026-01-21 Sam Chow , Péter P. Varjú , Han Yu

Let B_n={x_i \cdot x_j=x_k, x_i+1=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let \xi(n) denote the smallest positive integer b such that for each system S \subseteq B_n with a unique solution in positive integers x_1,...,x_n, this…

Logic · Mathematics 2017-08-21 Apoloniusz Tyszka

Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…

Number Theory · Mathematics 2021-11-18 Elisa Bellah

We introduce a smooth variance sum associated to a pair of positive definite symmetric integral matrices $A_{m\times m}$ and $B_{n\times n}$, where $m\geq n$. By using the oscillator representation, we give a formula for this variance sum…

Number Theory · Mathematics 2019-04-18 Naser T. Sardari

We develop a variety of new techniques to treat Diophantine equations of the shape $x^2+D =y^n$, based upon bounds for linear forms in $p$-adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch…

Number Theory · Mathematics 2022-08-01 Michael A. Bennett , Samir Siksek

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

Number Theory · Mathematics 2010-03-17 Michael Stoll

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…

Number Theory · Mathematics 2013-08-19 Lenny Fukshansky , Glenn Henshaw

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

Number Theory · Mathematics 2020-12-29 Tomohiro Yamada

In this paper we present a new method of solving the classical diophantine equation $A^4+B^4=C^4+D^4$. Two methods of solving this equation, given by Euler, yield parametric solutions given by polynomials of degrees 7 and 13. Several other…

Number Theory · Mathematics 2023-05-16 Ajai Choudhry

We establish the existence of weak solutions of a nonlinear radiation-type boundary value problem for elliptic equation on divergence form with discontinuous leading coefficient. Quantitative estimates play a crucial role on the real…

Analysis of PDEs · Mathematics 2015-07-23 Luisa Consiglieri

The Riemann-Lebesque Theorem is commonly proved in a few strokes using the theory of Lebesque integration. Here, the upper bound $2\pi|c_k(f)|\le S_k(f)-s_k(f)$ for the Fourier coefficients $c_k$ is proved in terms of majoring and minoring…

funct-an · Mathematics 2008-02-03 Maurice H. P. M. van Putten

In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints ($\mathcal{L}_{\lvert\cdot\rvert}$) to a decision procedure for $\mathcal{L}_{\lvert\cdot\rvert}$ extended with set terms…

Logic in Computer Science · Computer Science 2026-05-05 Maximiliano Cristiá , Gianfranco Rossi