Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract

For instance, several conjectures are formulated with the Faltings height because it does not depend on the projective embedding of A that you may choose, but one may fix an ample

We propose a totally explicit lower bound for the N´eron-Tate height of algebraic points of infinite order of abelian varieties.. Let k be a number field of degree D = [k :

Shamir asked whether the results on frequency Turing machines and frequency finite automata hold for pushdown automata as well.. The difficulty of the question is in the fact that

Under suitable boundary conditions and assuming a maximum principle for the interior points, we obtain a uniform convergence similar to that of Theorem 1.1.. Theorem 2.1 below can

As an application of nested distance desert automata, we give a new proof and the first ever complexity bound for the star height problem: given an integer h and an

If members of a particular ethnic group are on average taller than Whites, and the hypergamous norm is shared by all ethnic groups, then men of the taller group face a larger share

Zannier, “A uniform relative Dobrowolski’s lower bound over abelian extensions”. Delsinne, “Le probl` eme de Lehmer relatif en dimension sup´

Our method naturally extends to a Drinfeld module with at least one prime of supersingular reduction, whereas Ghioca’s theorem provides a bound of Lehmer strength in the