Related papers: On the $abc$ and the $abcd$ conjectures

We establish some asymptotic expansions for infinite weighted convolutions of distributions having light subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs…

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…

The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…

In this paper, we give a form of refined Roth's theorem. As an application, we prove a special case of the $abc$-conjecture.

We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…

This paper studies the subexponential prefactor to the random-coding bound for a given rate. Using a refinement of Gallager's bounding techniques, an alternative proof of a recent result by Altu\u{g} and Wagner is given, and the result is…

In this present work, we discuss the Bayesian inference for the bivariate pseudo-exponential distribution. Initially, we assume independent gamma priors and then pseudo-gamma priors for the pseudo-exponential parameters. We are primarily…

Let A be an abelian fourfold. We prove the Standard Conjecture of Hodge type for A. By combining this result with a theorem of Clozel we deduce that numerical equivalence on A coincides with l-adic homological equivalence on A for…

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…

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

We prove the abundance theorem for log canonical $n$-folds such that the boundary divisor is big assuming the abundance conjecture for log canonical $(n-1)$-folds. We also discuss the log minimal model program for log canonical $4$-folds.

We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial…

This note imparts heuristic arguments and theorectical evidences that contradict the abc conjecture over the rational numbers. In addition, the rudimentary datails for transforming this problem into the doimain of equidistribution theory…

We show that the abc Conjecture implies the Weak Diversity Conjecture of Bilu and Luca.

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…