Related papers: Extremal Real Algebraic Geometry and A-Discriminan…

Faltings proved that there are finitely many abelian varieties of genus $g$ over a number field $K$, with good reduction outside a finite set of primes $S$. Fixing one of these abelian varieties $A$, we prove that there are finitely many…

In this paper we apply for the first time a new method for multivariate equation solving which was developed in \cite{gh1}, \cite{gh2}, \cite{gh3} for complex root determination to the {\em real} case. Our main result concerns the problem…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees counted only non-degenerate roots and even then gave much larger…

We introduce and begin the topological study of real rational plane curves, all of whose inflection points are real. The existence of such curves is a corollary of results in the real Schubert calculus, and their study has consequences for…

An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We show that the maximum likelihood degree of a smooth very affine variety is equal to the signed topological Euler characteristic. This generalizes Orlik and Terao's solution to Varchenko's conjecture on complements of hyperplane…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

This paper establishes an analog of the Erd\H{o}s-Ko-Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins. A $k$-uniform family of subsets of a set of finite size $n$ is $l$-intersecting…

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…

We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…

In this work we deal with dicritical divisors, curvettes and polynomials. These objects have been one of the main research interests of S.S. Abhyankar during his last years. In this work we provide some elementary proofs of some S.S.…

Let $X \subset \mathbb{C}^n$ be an algebraic variety, and let $\Lambda \subset \mathbb{C}^n$ be a discrete subgroup whose real and complex spans agree. We describe the topological closure of the image of $X$ in $\mathbb{C}^n / \Lambda$,…

The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…

We introduce a new invariant, the real (logarithmic)-Kodaira dimension, that allows to distinguish smooth real algebraic surfaces up to birational diffeomorphism. As an application, we construct infinite families of smooth rational real…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

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…

Geometry of sparse systems of polynomial equations (i.e. the ones with prescribed monomials and generic coefficients) is well studied in terms of their Newton polytopes. The results of this study are colloquially known as the…