Related papers: On the $abc$ and the $abcd$ conjectures
In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…
Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete…
In this paper we study the upper bound of wavefront sets of irreducible admissible representations of connected reductive groups defined over non-Archimedean local fields of characteristic zero. We formulate a new conjecture on the upper…
In this article, we derive better results concerning powered numbers in short intervals, both unconditionally and conditionally on the $abc$-conjecture. We make use of sieve method, a polynomial identity, and a recent breakthrough result on…
We prove a central limit theorem for a sequence of random variables whose means are ambiguous and vary in an unstructured way. Their joint distribution is described by a set of measures. The limit is (not the normal distribution and is)…
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended…
In a paper of Tate and the author, we conjectured a uniform bound for the p-adic distance of torsion points on a semiabelian variety, not lying in a subvariety, to that subvariety. We survey the progress made on that conjecture and on…
The asymptotic tail behaviour of sums of independent subexponential random variables is well understood, one of the main characteristics being the principle of the single big jump. We study the case of dependent subexponential random…
Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
We make the subconvex exponent for $\mathrm{GL}_2$ cuspidal representation in the work of Michel \& Venkatesh explicit. The result depends on an effective dependence on the `fixed' $\mathrm{GL}_2$ representation in our former work on the…
This paper presents the best known bounds for a conjecture of Gluck and a conjecture of Navarro.
Abductive explanations (AXp's) are widely used for understanding decisions of classifiers. Existing definitions are suitable when features are independent. However, we show that ignoring constraints when they exist between features may lead…
Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…
Let $p$ be an odd prime and $F_{\infty}$ a $p$-adic Lie extension of a number field $F$. Let $A$ be an abelian variety over $F$ which has ordinary reduction at every primes above $p$. Under various assumptions, we establish asymptotic upper…
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…
We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…