Related papers: Tschirnhaus transformations after Hilbert

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…

We prove a closed formula for the generating function $\mathsf Z_d(t)$ of the motives $[\mathrm{Hilb}^d(\mathbb A^n)_0] \in K_0(\mathrm{Var}_{\mathbb C})$ of punctual Hilbert schemes, summing over $n$, for fixed $d>0$. The result is an…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

The diagonal in a product of projective spaces is cut out by the ideal of 2x2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally…

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanced with a roll-back idea allowing to sequentially retrace…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

We develop the tools to bound extreme roots of multivariate real zero polynomials globally. This is done through the use of a relaxation that approximates their rigidly convex sets. This relaxation can easily be constructed using the degree…

We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and n(n-1)/2 relations…

Let $A^{[[n]]}$ denote the $2(n - 1)$-dimensional generalised Kummer variety constructed from the abelian surface $A$. Further, let $X$ be an arbitrary smooth projective surface with $\int_X c_1(X)^2 \neq 0$, and $X^{[k]}$ the Hilbert…

Using the Grosshans Principle, we develop a method for proving lower bounds for the maximal degree of a system of generators of an invariant ring. This method also gives lower bounds for the maximal degree of a set of invariants that define…

Translation of the Latin original, "Methodus generalis investigandi radices omnium aequationum per approximationem" (1776). E643 in the Enestrom index. Euler gives a series to find powers of roots of polynomials.

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

This is an English translation of G.N. Chebotarev's classical paper "On the Problem of Resolvents," which was originally written in Russian and published in Vol. 114, No. 2 of the Scientific Proceedings of the V.I. Ulyanov-Lenin Kazan State…

We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…

In the recent paper [arXiv:1612.06893] P. B\"urgisser and A. Lerario introduced a geometric framework for a probabilistic study of real Schubert Problems. They denoted by $\delta_{k,n}$ the average number of projective $k$-planes in…

We prove two results on Kloosterman sums over finite fields, using Stickelberger's theorem and the Gross-Koblitz formula. The first result concerns the minimal polynomial over Q of a Kloosterman sum, and the second result gives a…

Finding a good bound on the maximal edge diameter $\Delta(d,n)$ of a polytope in terms of its dimension $d$ and the number of its facets $n$ is one of the basic open questions in polytope theory \cite{BG}. Although some bounds are known,…