English
Related papers

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

200 papers

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…

Number Theory · Mathematics 2022-08-12 Pagdame Tiebekabe , Serge Adonsou , Ismaïla Diouf

In this paper, we present a simple analytic proof of Siegel's theorem that concerns the lower bound of $L(1,\chi)$ for primitive quadratic $\chi$. Our new method compares an elementary lower bound with an analytic upper bound obtained by…

Number Theory · Mathematics 2022-02-02 Zihao Liu

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

Number Theory · Mathematics 2019-02-12 S. Subburam , J. Tanti

In 2016, Ananyan and Hochster gave the first proof of a positive answer to Stillman's Question, which asked for a bound on the projective dimension of a graded polynomial ideal purely in terms of the number and degrees of its generators.…

Commutative Algebra · Mathematics 2026-05-18 Zachary Greif , Paolo Mantero , Jason McCullough

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

This paper is devoted to study the existence of solutions and the monotone method of second-order periodic boundary value problems when the lower and upper solutions $\alpha$ and $\beta$ violate the boundary conditions $…

Classical Analysis and ODEs · Mathematics 2016-10-25 Faouzi Haddouchi , Slimane Benaicha

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

Number Theory · Mathematics 2024-08-22 Lara Tatli , Paul Stevenson

We consider an inverse boundary value problem for a semilinear wave equation on a time-dependent Lorentzian manifold with time-like boundary. The time-dependent coefficients of the nonlinear terms can be recovered in the interior from the…

Analysis of PDEs · Mathematics 2021-01-27 Peter Hintz , Gunther Uhlmann , Jian Zhai

The goal of this paper is to obtain lower bounds on the height of an algebraic number in a relative setting, extending previous work of Amoroso and Masser. Specifically, in our first theorem we obtain an effective bound for the height of an…

Number Theory · Mathematics 2017-04-12 Shabnam Akhtari , Kevser Aktaş , Kirsti Biggs , Alia Hamieh , Kathleen Petersen , Lola Thompson

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Number Theory · Mathematics 2021-09-27 Szabolcs Tengely , Maciej Ulas

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

Number Theory · Mathematics 2025-11-26 Sebastian Heintze , Armand Noubissie , Robert F. Tichy

We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…

Information Theory · Computer Science 2021-03-12 Hedongliang Liu , Hengjia Wei , Sven Puchinger , Antonia Wachter-Zeh , Moshe Schwartz

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

Combinatorics · Mathematics 2021-08-12 Hongyi Jiang , Amitabh Basu

The number of lattice points in $d$-dimensional hyperbolic or elliptic shells $\{m : a<Q[m]<b\}$, which are restricted to rescaled and growing domains $r\;\Omega$, is approximated by the volume. An effective error bound of order…

Number Theory · Mathematics 2021-11-16 Paul Buterus , Friedrich Götze , Thomas Hille , Gregory Margulis

The use of limiting methods for high-order numerical approximations of hyperbolic conservation laws generally requires defining an admissible region/bounds for the solution. In this work, we present a novel approach for computing solution…

Numerical Analysis · Mathematics 2025-02-26 Tarik Dzanic , Luigi Martinelli

In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.

Number Theory · Mathematics 2012-08-31 Ilya D. Shkredov

We show that if $u$ is a solution to a linear elliptic differential equation of order $2m\geq 2$ in the half-space with $t$-independent coefficients, and if $u$ satisfies certain area integral estimates, then the Dirichlet and Neumann…

Analysis of PDEs · Mathematics 2017-03-22 Ariel Barton , Steve Hofmann , Svitlana Mayboroda

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Number Theory · Mathematics 2010-03-23 Bas Edixhoven , Jean-Marc Couveignes , Robin de Jong , Franz Merkl , Johan Bosman

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

Symbolic Computation · Computer Science 2013-07-16 Jean-Charles Faugère , Pierrick Gaudry , Louise Huot , Guénaël Renault
‹ Prev 1 8 9 10 Next ›