相关论文: Supersymmetric Schur polynomials have saturated Ne…

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

We use the matrix model to describe the N=2 SO(N)/Sp(N) supersymmetric gauge theories with massive hypermultiplets in the fundamental representation. By taking the tree level superpotential perturbation made of a polynomial of a scalar…

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…

On the set of complex number $\mathbb{C}$ it is possible to define $n$-valued group for any positive integer $n$. The $n$-multiplication defines a symmetric polynomial $p_n = p_n(x, y, z)$ with integer coefficients. By the theorem on…

An integrable supersymmetric generalization of the trigonometric Ruijsenaars-Schneider model is presented whose symmetry algebra includes the super Poincar\'e algebra. Moreover, its Hamiltonian is showed to be diagonalized by the recently…

By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

The plethysm product of Schur functions corresponds to composing polynomial representations of infinite general linear groups. Finding the plethysm coefficients $\langle s_\nu \circ s_\mu, s_\lambda\rangle$ that express an arbitrary…

The Schur index in four-dimensional $\mathcal{N}=4$ super Yang-Mills theory with $U(N)$ gauge group has a natural two-parameter deformation. We find that a matrix integral in such a deformed Schur index can be exactly evaluated by using…

We provide a characterisation of Schur multiplicative maps on both finite and infinite dimensional matrix spaces, and show that every surjective Schur multiplicative contraction is automatically an isometry. We also generalise this result…

A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Consider a polynomial $f$ with a convenient Newton polytope $P$ and generic complex coefficients. By the global version of the Kouchnirenko formula, the hypersurface $\{f = 0\} \subset \mathbb{C}^n$ has the homotopy type of a bouquet of…