Related papers: Height bounds for algebraic numbers satisfying spl…
Linear forms in logarithms have an important role in the theory of Diophantine equations. In this article, we prove explicit $p$-adic lower bounds for linear forms in $p$-adic logarithms of rational numbers using Pad\'e approximations of…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…
In this paper, we bound the number of solutions to a quadratic Vinogradov system of equations in which the variables are required to satisfy digital restrictions in a given base. Certain sets of permitted digits, namely those giving rise to…
We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
While currently the $abc$ conjecture and work towards it remains open or is disputed, at the same time much work has been done on weaker versions, as well as on its generalisation to number fields. Given integers satisfying $a+b=c$, Stewart…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…
We provide new general methods in the calculus of variations for the anisotropic Plateau problem in arbitrary dimension and codimension. A new direct proof of Almgren's 1968 existence result is presented; namely, we produce from a class of…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all…
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
Based on the Delsarte-Yudin linear programming approach, we extend Levenshtein's framework to obtain lower bounds for the minimum $h$-energy of spherical codes of prescribed dimension and cardinality, and upper bounds on the maximal…
The main emphasis will be on height upper bounds in the algebraic torus G^{n}_{m}. By height we will mean the absolute logarithmic Weil height. Section 3.2 contains a precise definition of this and other more general height functions. The…
We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.
Let $\F_p = \Z/p\Z$. The \emph{height} of a point $\mathbf{a}=(a_1,..., a_d) \in \F_p^d$ is $h_p(\mathbf{a}) = \min \left\{\sum_{i=1}^d (ka_i \mod p) : k=1,...,p-1\right\}.$ Explicit formulas and estimates are obtained for the values of the…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.
We consider a constrained minimax single facility location problem on the plane with rectilinear distance. The feasible set of location points is restricted to rectangles with sides oriented at a 45 degrees angle to the axes of Cartesian…