Related papers: Height bounds for algebraic numbers satisfying spl…
Christol and, independently, Denef and Lipshitz showed that an algebraic sequence of $p$-adic integers (or integers) is $p$-automatic when reduced modulo $p^\alpha$. Previously, the best known bound on the minimal automaton size for such a…
We give lower bounds on the number of effective divisors of degree $\leq g-1$ with respect to the number of places of certain degrees of an algebraic function field of genus $g$ defined over a finite field. We deduce lower bounds and…
Optimal upper and lower error estimates for strong full-discrete numerical approximations of the stochastic heat equation driven by space-time white noise are obtained. In particular, we establish the optimality of strong convergence rates…
Let $G$ be a commutative algebraic group defined over a number field $K$ that is disjoint over $K$ to $\mathbb G_a$ and satisfies the condition of semistability. Consider a linear form $l$ on the Lie algebra of $G$ with algebraic…
Let $k$ be a number field. For $\mathcal{H}\rightarrow \infty$, we give an asymptotic formula for the number of algebraic integers of absolute Weil height bounded by $\mathcal{H}$ and fixed degree over $k$.
Graph theoretical problems based on shortest paths are at the core of research due to their theoretical importance and applicability. This paper deals with the geodetic number which is a global measure for simple connected graphs and it…
In contrast to regular ordinary differential equations, the problem of accurately setting initial conditions just emerges in the context of differential-algebraic equations where the dynamic degree of freedom of the system is smaller than…
We consider upper and lower bounds on the minimal height of an irrational number lying in a particular real quadratic field.
We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…
We give a computable lower bound on the distance between two distinct periods of a given quartic surface defined over the algebraic numbers. The main ingredient is the determination of height bounds on components of the Noether--Lefschetz…
We provide bounds on the size of polynomial differential equations obtained by executing closure properties for D-algebraic functions. While it is easy to obtain bounds on the order of these equations, it requires some more work to derive…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
A minimal geodesic on a Riemannian manifold is a geodesic defined on $\mathbb{R}$ that lifts to a globally distance minimizing curve on the universal covering. Bangert proved that there is a lower bound for the number of geometrically…
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…
We develope new lower bounds for the $A$-numerical radius of semi-Hilbertian space operators, and applying these bounds we obtain upper bounds for the $A$-numerical radius of the commutators of operators. The bounds obtained here improve on…