English
Related papers

Related papers: Mixed Discriminants

200 papers

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

Combinatorics · Mathematics 2017-02-14 Seongmin Ok , Peter Tittmann

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

Algebraic Geometry · Mathematics 2025-03-28 László M. Fehér , András P. Juhász

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

Combinatorics · Mathematics 2025-05-09 Jason I. Brown , Ian C. George

The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…

Symbolic Computation · Computer Science 2020-04-08 Claus Fieker , Tommy Hofmann , Carlo Sircana

Cayley's hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a 2 x 2 x 2 array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts…

Representation Theory · Mathematics 2025-12-09 Murray R. Bremner , Mikelis G. Bickis , Mohsen Soltanifar

We prove that, over a field of characteristic $0$, the degrees of factors of a binomial $t^n-\alpha$ are divisible by the least such degree. As a consequence, we deduce that for relatively prime natural numbers $m,n$, a polynomial has the…

Number Theory · Mathematics 2026-02-03 Matthew Bolan , Ben Williams

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Number Theory · Mathematics 2014-02-26 Yann Bugeaud , Andrej Dujella

This paper defines and investigates nonsymmetric Macdonald polynomials with values in an irreducible module of the Hecke algebra of type $A_{N-1}$. These polynomials appear as simultaneous eigenfunctions of Cherednik operators. Several…

Combinatorics · Mathematics 2011-06-07 C. F. Dunkl , J. -G. Luque

Using Cayley trick, we define the notions of mixed toric residues and mixed Hessians associated with $r$ Laurent polynomials $f_1,...,f_r$.We conjecture that the values of mixed toric residues on the mixed Hessians are determined by mixed…

Algebraic Geometry · Mathematics 2007-05-23 Victor V. Batyrev , Evgeny N. Materov

We show that any differential operator of the form $L(y)=\sum_{k=0}^{k=N} a_{k}(x) y^{(k)}$, where $a_k$ is a real polynomial of degree $\leq k$, has all real eigenvalues in the space of polynomials of degree at most n, for all n. The…

Classical Analysis and ODEs · Mathematics 2010-02-28 H. Azad , M. T. Mustafa

We prove that the Cayley-Menger determinant of an $n$-dimensional simplex is an absolutely irreducible polynomial for $n\geq3.$ We also study the irreducibility of polynomials associated to related geometric constructions.

Commutative Algebra · Mathematics 2007-05-23 Carlos D'Andrea , Martin Sombra

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…

Symbolic Computation · Computer Science 2011-01-17 Manuel Kauers , Carsten Schneider

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

Combinatorics · Mathematics 2025-09-23 Chong Shangguan , Yulin Yang , Tao Zhang

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

Algebraic Geometry · Mathematics 2015-10-26 Hwangrae Lee , Bernd Sturmfels

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

Information Theory · Computer Science 2014-04-22 Vakhtang Lomadze

We define a class of multivariate Laurent polynomials closely related to Chebyshev polynomials, and prove the simple but somewhat surprising (in view of the fact that the signs of the coefficients of the Chebyshev polynomials themselves…

Classical Analysis and ODEs · Mathematics 2007-05-23 Igor Rivin

In this article, we prove an asymptotic formula for mean values of long Dirichlet polynomials with higher order shifted divisor functions, assuming a smoothed additive divisor conjecture for higher order shifted divisor functions. As a…

Number Theory · Mathematics 2022-10-18 Alia Hamieh , Nathan Ng

Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…

Algebraic Geometry · Mathematics 2010-04-23 Arkadiusz Pĺoski
‹ Prev 1 4 5 6 7 8 10 Next ›