English
Related papers

Related papers: Discriminants of Symmetric Polynomials

200 papers

The simplest partition function, associated with homogeneous symmetric forms S of degree r in n variables, is integral discriminant J_{n|r}(S) = \int e^{-S(x_1 ... x_n)} dx_1 ... dx_n. Actually, S-dependence remains the same if e^{-S} in…

Mathematical Physics · Physics 2009-12-07 A. Morozov , Sh. Shakirov

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

Commutative Algebra · Mathematics 2012-10-18 Laurent Busé , Jean-Pierre Jouanolou

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

Combinatorics · Mathematics 2020-10-27 Leonid G. Fel

Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…

Commutative Algebra · Mathematics 2014-07-11 Laurent Busé , Anna Karasoulou

We define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…

Commutative Algebra · Mathematics 2019-09-24 Dongming Wang , Jing Yang

In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…

Number Theory · Mathematics 2017-11-16 Zhi-Hong Sun

For a pair of positive integers (k,r) with r>1 such that k+1 and r-1 are relatively prime, we describe the space of symmetric polynomials in variables x_1,...,x_n which vanish at all diagonals of codimension k of the form…

Quantum Algebra · Mathematics 2007-05-23 B. Feigin , M. Jimbo , T. Miwa , E. Mukhin , Y. Takeyama

For any natural $d \ge k \ge 2$ we calculate the cohomology groups of the space of homogeneous polynomials $R^2 \to R$ of degree $d$, which do not vanish with multiplicity $\ge k$ on real lines. For $k=2$ this problem provides the simplest…

Algebraic Topology · Mathematics 2014-07-29 Victor A. Vassiliev

In this paper we find the number of homogeneous polynomials of degree d such that they vanish on cuspidal modular forms of even weight $m\geq 2$ that form a basis for $S_m(\Gamma_0(N))$. We use these cuspidal forms to embedd $X_0(N)$ to…

Number Theory · Mathematics 2024-05-20 Iva Kodrnja , Helena Koncul

Every symmetric polynomial p(x)=p(x_1,...,x_g) (with real coefficients) in g noncommuting variables x_1, ..., x_g can be written as a sum and difference of squares of noncommutative polynomials. Let s(p), the negative signature of p, denote…

Functional Analysis · Mathematics 2009-03-12 Harry Dym , Jeremy M. Greene , J. William Helton , Scott A. McCullough

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

Symbolic Computation · Computer Science 2007-05-23 Guillaume Moroz

A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…

Classical Analysis and ODEs · Mathematics 2023-02-02 Shaul Zemel

Let $K$ be a field. In this article, we derive a formula for the discriminant of a sequence $\{r_{A,n}+c r_{A,n-1}\}$ of polynomials. Here, $c \in K$ and $\{r_{A,n} \}$ is a sequence of polynomials satisfying a certain recurrence relation…

Number Theory · Mathematics 2023-03-29 Hideki Matsumura

We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…

Classical Analysis and ODEs · Mathematics 2009-02-03 Diego Dominici , Kathy Driver , Kerstin Jordaan

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Dynamical Systems · Mathematics 2014-10-02 Vladimir Dragovic , Katarina Kukic

In the paper we study the distribution of the discriminant $D(P)$ of polynomials $P$ from the class $\mathcal{P}_{n}(Q)$ of all integer polynomials of degree $n$ and height at most $Q$. We evaluate the asymptotic number of polynomials $P\in…

Number Theory · Mathematics 2018-08-31 Dzianis Kaliada

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

Complex Variables · Mathematics 2017-04-04 Keisuke Uchimura

By using a generalization of Sturm-Liouville problems in discrete spaces, a basic class of symmetric orthogonal polynomials of a discrete variable with four free parameters, which generalizes all classical discrete symmetric orthogonal…

Classical Analysis and ODEs · Mathematics 2012-10-12 Mohammad Masjed-Jamei , Iván Area

For certain negative rational numbers k0, called singular values, and associated with the symmetric group S_N on N objects, there exist homogeneous polynomials annihilated by each Dunkl operator when the parameter k = k0. It was shown by de…

Representation Theory · Mathematics 2009-09-04 Charles F. Dunkl

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

Computational Complexity · Computer Science 2009-07-16 Pavel Hrubes , Amir Yehudayoff
‹ Prev 1 2 3 10 Next ›