Related papers: Newton Polytopes in Algebraic Combinatorics

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…

In this paper, we provide a simple criterion for the Schubitope $\mathcal{S}_{D}$ associated to a diagram $D$ to be lattice-free. We further show that $\mathcal{S}_{D}$ is lattice-free if and only if its Ehrhart polynomial is equal to the…

Let $s_\nu \circ s_\mu$ denote the plethystic product of the Schur functions $s_\nu$ and $s_\mu$. In this article we define an explicit polynomial representation corresponding to $s_\nu \circ s_\mu$ with basis indexed by certain…

A positroid is the matroid of a real matrix with nonnegative maximal minors, a positroid variety is the closure of the locus of points in a complex Grassmannian whose matroid is a fixed positroid, and a positroid class is the cohomology…

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We…

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

There are representations of the type-A Hecke algebra on spaces of polynomials in anti-commuting variables. Luque and the author [S\'em. Lothar. Combin. 66 (2012), Art. B66b, 68 pages, arXiv:1106.0875] constructed nonsymmetric Macdonald…

We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

We study normal directions to facets of the Newton polytope of the discriminant of the Laurent polynomial system via the tropical approach. We use the combinatorial construction proposed by Dickenstein, Feichtner and Sturmfels for the…

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

We study the Newton polytopes of determinants of square matrices defined over rings of twisted Laurent polynomials. We prove that such Newton polytopes are single polytopes (rather than formal differences of two polytopes); this result can…

We study algebras satisfying a two-term multilinear identity, namely one of the form $x_1 \cdots x_n= q x_{\sigma(1)} \cdots x_{\sigma(n)}$, where $q$ is a parameter from the base field. We show that such algebras with $q=1$ and $\sigma$…

We introduce generalization of famous Macdonald polynomials for the case of super-Young diagrams that contain half-boxes on the equal footing with full boxes. These super-Macdonald polynomials are polynomials of extended set of variables:…

A conjecture of Le says that the Deligne polytope $\Delta_d$ is generically ordinary if $p\equiv 1\ (\!\!\bmod\ D(\Delta_d))$, where $D(\Delta_d)$ is a combinatorial constant determined by $\Delta_d$. In this paper a counterexample is given…

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…