Related papers: Heights of polynomials over lemniscates

We investigate the classification of quasihomogeneous polynomials in two variables with real coefficients under semialgebraic bi-Lipschitz equivalence in a neighborhood of the origin in ${\mathbb R}^2$. Building on the work of Birbrair,…

In these lectures we cover basics of the theory of heights starting with the heights in the projective space, heights of polynomials, and heights of the algebraic curves. We define the minimal height of binary forms and moduli height for…

An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…

We consider a generalization of the Mahler measure of a multivariable polynomial $P$ as the integral of $\log^k|P|$ in the unit torus, as opposed to the classical definition with the integral of $\log|P|$. A zeta Mahler measure, involving…

We continue to investigate the relation between the Mahler measure of certain two variable polynomials, the values of the Bloch--Wigner dilogarithm $D(z)$ and the values $\zeta_F(2)$ of zeta functions of number fields. Specifically, we…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Consider the sub level set K := {x : g(x) $\le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Let $M(\alpha)$ denote the (logarithmic) Mahler measure of the algebraic number $\alpha$. Dubickas and Smyth, and later Fili and the author, examined metric versions of $M$. The author generalized these constructions in order to associate,…

We formulate Lehmer's Problem about the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant,…

A basic closed semialgebraic subset of $\mathbb{R}^{n}$ is defined by simultaneous polynomial inequalities $p_{1}\geq 0,\ldots,p_{m}\geq 0$. We consider Lasserre's relaxation hierarchy to solve the problem of minimizing a polynomial over…

For a non-zero algebraic number $\alpha$ of degree $d$, let $h(\alpha)$ denote its logarithmic Weil height. It is known that when $h(\alpha)$ is small, and $d$ is large, the conjugates of $\alpha$ are clustered near the unit circle and have…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

We derive Mehler--Heine type asymptotic formulas for Charlier and Meixner polynomials, and also for their associated families. These formulas provide good approximations for the polynomials in the neighborhood of $x=0,$ and determine the…

We construct new examples of Krall discrete orthogonal polynomials, i.e., orthogonal polynomials with respect to a measure which are also eigenfunctions of a higher order difference operator. The new examples include the orthogonal…

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

In any cubic polynomial, the average of the slopes at the $3$ roots is the negation of the slope at the average of the roots. In any quartic, the average of the slopes at the $4$ roots is twice the negation of the slope at the average of…