Related papers: Iterated and mixed discriminants
What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…
Let $X$ be a smooth irreducible nondegenerate projective variety and let $X^*$ denote its dual variety. It is well known that $\sigma_2(X)^*$, the dual of the 2-secant variety of $X$, is a component of the singular locus of $X^*$. The locus…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
The Segre determinant is a polynomial which encodes the condition for points to lie on a bilinear hypersurface in the product of projective spaces. We study Segre determinants and compute them in various coordinate systems. We show that the…
Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…
Integral discriminants provide a simple and fundamental model for non-Gaussian integrals, associated with homogeneous polynomials of degree r in n variables. We argue that, in this context, the study of correlators is equally if not more…
In this paper the notion of an M-th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a…
We introduce and study the base locus and the strong base locus of a projective variety X. The base locus of X parametrizes configurations of smooth points of X where the span of the tangent spaces of X at these points intersects X at some…
On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
Graeffe iteration was the choice algorithm for solving univariate polynomials in the XIX-th and early XX-th century. In this paper, a new variation of Graeffe iteration is given, suitable to IEEE floating-point arithmetics of modern digital…
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…
We give an explicit expression for the contact loci of hyperplane arrangements and show that their cohomology rings are combinatorial invariants. We also give an expression for the restricted contact loci in terms of Milnor fibers of…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…
Identification of multinomial choice models is often established by using special covariates that have full support. This paper shows how these identification results can be extended to a large class of multinomial choice models when all…
In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…
In this work, we study superconvergence properties for some high-order orthogonal polynomial interpolations.The results are two-folds: When interpolating function values, we identify those points where the first and second derivatives of…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…