Related papers: Tschirnhaus transformations after Hilbert

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…

In this work we develop a novel fully discrete version of the plates complex, an exact Hilbert complex relevant for the mixed formulation of fourth-order problems. The derivation of the discrete complex follows the discrete de Rham…

In 1921 Mellin published a Comptes Rendu paper computing the principal root of the polynomial $Z^n + x_1Z^{n_1} + \cdots + x_pZ^{n_p} - 1$ using hypergeometric functions of its coefficients $x_1,...,x_p.$ He used an integral transform…

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial…

Motivated by higher vanishing multiplicity generalizations of Alon's Combinatorial Nullstellensatz and its applications, we study the following problem: for fixed $k\geq 1$ and $n$ large with respect to $k$, what is the minimum possible…

We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r+3, thus improving a bound conjectured by Farzad et al. (STACS…

In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…

Let $p(t)$ be an admissible Hilbert polynomial in $\PP^n$ of degree $d$. The Hilbert scheme $\hilb^n_p(t)$ can be realized as a closed subscheme of a suitable Grassmannian $ \mathbb G$, hence it could be globally defined by homogeneous…

We describe the Hilbert schemes parametrizing curves on a cubic threefold of degree at most 5. In a forthcoming paper, we use this description to give a new proof and extension of a theorem of Iliev, Markushevich and Tikhimirov.

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…

The solution to the general univariate polynomial equation has been sought for centuries. It is well known there is no general solution in radicals for degrees five and above. The hyper-Catalan numbers $C[m_2,m_3,m_4,\ldots]$ count the ways…

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

In this article, we describe the irreducible components of the Hilbert scheme of $d$ points on $\mathbb{A}^n$ for $d=9,10$. The main techniques we use are the variety of commuting matrices and analyzing loci of local algebras with a…

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…