Related papers: Height bounds for algebraic numbers satisfying spl…

Finding the global minimum of a multivariate function efficiently is a fundamental yet difficult problem in many branches of theoretical physics and chemistry. However, we observe that there are many physical systems for which the…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

Let $Y$ be a projective submanifold of the total space of the inverse of a very ample line bundle $\pi:L^{-1}\rightarrow B$ over a projective manifold $B$. Any section of $L^{-1}\rightarrow B$ is isomorphic to $B$ and the Hodge numbers of…

We present sharp lower bounds for the A-numerical radius of semi-Hilbertian space operators. We also present an upper bound. Further we compute new upper bounds for the $B$-numerical radius of $2 \times 2$ operator matrices where $B =…

We consider the problem of explicitly computing Beilinson--Bloch heights of homologically trivial cycles on varieties defined over number fields. Recent results have established a congruence, up to the rational span of logarithms of primes,…

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

We give a mathematical structure on an arithmetic surface, that has algebraic meanings over finite places and can estimate the canonical norm for a relative differential form on the arithmetic surface. This will give a lower bound for the…

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice ${\bf Z}^n$. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optimal value of the…

For an arrangement of $n$ pseudolines in the real projective plane let us denote by $t_i$ the number of vertices incident to $i$ lines. We obtain a linear on $t_i$ inequality similar to the Hirzebruch one, but with an elementary proof. We…

In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.

We study the behavior of canonical height functions $\widehat{h}_f$, associated to rational maps $f$, on totally $p$-adic fields. In particular, we prove that there is a gap between zero and the next smallest value of $\widehat{h}_f$ on the…

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

We give an expression for a generalized numerical radius of Hilbert space operators and then apply it to obtain upper and lower bounds for the generalized numerical radius. We also establish some generalized numerical radius inequalities…

In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…