Related papers: Local ABC theorems for analytic functions

We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial…

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

In this paper, we focus on the difference analogue of the Stothers-Mason theorem for entire functions of order less than 1, which can be seen as difference $abc$ theorem for entire functions. We also obtain the difference analogue of…

A local Tb theorem is an L^2 boundedness criterion by which the question of the global behavior of an operator is reduced to its local behavior, acting on a family of test functions b_Q indexed by the dyadic cubes. We present several…

This paper explores two generalizations of the classical Aubin-Lions Lemma. First we give a sufficient condition to commute weak limit and multiplication of two functions. We deduce from this criteria a compactness Theorem for degenerate…

For an analytic function $f(z)=\sum_{k=0}^\infty a_kz^k$ on a neighbourhood of a closed disc $D\subset {\bf C}$, we give assumptions, in terms of the Taylor coefficients $a_k$ of $f$, under which the number of intersection points of the…

We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…

The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…

We prove local inequalities for analytic functions defined on a convex body in $\Re^{n}$ which generalize well-known classical inequalities for polynomials.

Approximate Bayesian computation (ABC) is a popular likelihood-free inference method for models with intractable likelihood functions. As ABC methods usually rely on comparing summary statistics of observed and simulated data, the choice of…

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Let $p$ be a prime. We discuss methods of solution of congruences modulo $p^n$ using $p$-adic numbers; these methods are similar to computations with real numbers (local methods). Examples of relations between local and global methods are…

The Gauss--Lucas and B\^{o}cher--Grace--Marden theorems are classical results in the geometry of polynomials. Proofs of the these results are available in the literature, but the approaches are seemingly different. In this work, we show…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…