English
Related papers

Related papers: Supersymmetric Schur polynomials have saturated Ne…

200 papers

This paper investigates the number of supports of the Schubert polynomial $\mathfrak{S}_w(x)$ indexed by a permutation $w$. This number also equals the number of lattice points in the Newton polytope of $\mathfrak{S}_w(x)$. We establish a…

Combinatorics · Mathematics 2024-12-05 Peter L. Guo , Zhuowei Lin

We show that the Newton polytope of a polynomial has a strong impact on the distribution of its mass and zeros. The basic theme is that Newton polytopes determine allowed and forbidden regions for these distributions. We equip the space of…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$,…

Mathematical Physics · Physics 2015-03-12 Olivier Blondeau-Fournier , Pierre Mathieu

We prove, combinatorially, that the product of a Schubert polynomial by a Stanley symmetric polynomial is a truncated Schubert polynomial. Using Monk's rule, we derive a nonnegative combinatorial formula for the Schubert polynomial…

Combinatorics · Mathematics 2017-02-02 Sami Assaf

It is a classical fundamental result that Schur-positive specializations of the ring of symmetric functions are characterized via totally positive functions whose parametrization describes the Edrei-Thoma theorem. In this paper we study…

Combinatorics · Mathematics 2020-02-24 Damir Yeliussizov

A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…

Metric Geometry · Mathematics 2007-05-23 Martin Grötschel , Martin Henk

We study in this paper properties of Schur multipliers of Schatten von Neumann classes $\boldsymbol{S}_p$. We prove that for $p\le1$, Schur multipliers of $\boldsymbol{S}_p$ are necessarily completely bounded. We also introduce for $p\le1$…

Functional Analysis · Mathematics 2019-10-21 Aleksei Aleksandrov , Vladimir Peller

We prove a generalization of the Shapiro-Shapiro conjecture on Wronskians of polynomials, allowing the Wronskian to have complex conjugate roots. We decompose the real Schubert cell according to the number of real roots of the Wronski map,…

Algebraic Geometry · Mathematics 2021-07-12 Jake Levinson , Kevin Purbhoo

Let $1\leq k \leq n$ and let $X_n = (x_1, \dots, x_n)$ be a list of $n$ variables. The {\em Boolean product polynomial} $B_{n,k}(X_n)$ is the product of the linear forms $\sum_{i \in S} x_i$ where $S$ ranges over all $k$-element subsets of…

Combinatorics · Mathematics 2019-03-01 Sara C. Billey , Brendon Rhoades , Vasu Tewari

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

alg-geom · Mathematics 2008-02-03 Piotr Pragacz

Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the…

Number Theory · Mathematics 2020-08-27 Emil-Alexandru Ciolan , Pedro A. García-Sánchez , Pieter Moree

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…

Combinatorics · Mathematics 2013-10-11 Cristina Ballantine , Rosa Orellana

We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…

Algebraic Geometry · Mathematics 2022-10-04 Mario Kummer

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

We show that the support of the Grothendieck polynomial $\mathfrak G_w$ of any fireworks permutation is as large as possible: a monomial appears in $\mathfrak G_w$ if and only if it divides $\mathbf x^{\mathrm{wt}(\overline{D(w)})}$ and is…

Combinatorics · Mathematics 2025-08-14 Jack Chen-An Chou , Linus Setiabrata

In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…

Computational Complexity · Computer Science 2025-10-01 Katzper Michno

Netzer and Sanyal proved that every smooth hyperbolicity cone is a spectrahedral shadow. We generalize and sharpen this result at the same time, by showing that every Nash-smooth hyperbolicity cone is even second-order cone representable…

Algebraic Geometry · Mathematics 2025-10-07 Claus Scheiderer

We show that symmetric polynomials previously introduced by the author satisfy a certain differential equation. After a change of variables, it can be written as a non-stationary Schr\"odinger equation with elliptic potential, which is…

Mathematical Physics · Physics 2014-06-16 Hjalmar Rosengren

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…

Combinatorics · Mathematics 2017-03-23 Sami Assaf
‹ Prev 1 3 4 5 6 7 10 Next ›