English
Related papers

Related papers: Newton Polytopes in Algebraic Combinatorics

200 papers

A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…

Optimization and Control · Mathematics 2026-04-03 Wenqi Zhu , Coralia Cartis

In this paper, we study the Newton polytopes of $F$-polynomials in a TSSS cluster algebra $\mathcal A$ and generalize them to a larger set consisting of polytopes $N_{h}$ associated to vectors $h\in\Z^{n}$ as well as $\widehat{\mathcal{P}}$…

Representation Theory · Mathematics 2025-05-06 Fang Li , Jie Pan

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

Combinatorics · Mathematics 2018-08-17 Benjamin Braun , Andrés R. Vindas-Meléndez

We provide a list of new natural $\mathsf{VNP}$-intermediate polynomial families, based on basic (combinatorial) $\mathsf{NP}$-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in…

Computational Complexity · Computer Science 2016-03-16 Meena Mahajan , Nitin Saurabh

We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…

Combinatorics · Mathematics 2023-04-04 Sami H. Assaf

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

Combinatorics · Mathematics 2025-03-28 Ming Yean Lim

A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…

Commutative Algebra · Mathematics 2011-04-11 Olga Holtz , Amos Ron

For each partition $\tau$ of $N$ there are irreducible modules of the symmetric groups $\mathcal{S}_{N}$ or the corresponding Hecke algebra $\mathcal{H}_{N}\left( t\right) $ whose bases consist of reverse standard Young tableaux of shape…

Representation Theory · Mathematics 2019-02-07 Charles F. Dunkl

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

Dynamical Systems · Mathematics 2018-06-20 Jarkko Kari , Etienne Moutot

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

Combinatorics · Mathematics 2023-08-31 Christopher de Vries , Masahiko Yoshinaga

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron…

Combinatorics · Mathematics 2010-03-29 Cristian Lenart , Frank Sottile

In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…

Mathematical Physics · Physics 2020-06-16 Mohammad Masjed-Jamei , Zahra Moalemi , Nasser Saad

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

Metric Geometry · Mathematics 2013-06-14 Karim Alexander Adiprasito , Arnau Padrol

Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…

Quantum Algebra · Mathematics 2007-05-23 L. Lapointe , A. Lascoux , J. Morse

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Metric Geometry · Mathematics 2021-07-15 Mariia Dospolova

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

Number Theory · Mathematics 2024-05-07 Anton Shakov

We solve the Schr\"odinger-Newton problem of Newtonian gravity coupled to a nonrelativistic scalar particle for solutions with axial symmetry. The gravitational potential is driven by a mass density assumed to be proportional to the…

High Energy Physics - Theory · Physics 2024-12-30 A. Flores , C. Stegner , S. S. Chabysheva , J. R. Hiller

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

Let $P_{\lambda\Sigma_n}$ be the Ehrhart polynomial associated to an intergal multiple $\lambda$ of the standard symplex $\Sigma_n \subset \mathbb{R}^n$. In this paper we prove that if $(M, L)$ is an $n$-dimensional polarized toric manifold…

Differential Geometry · Mathematics 2022-06-29 Andrea Loi , Fabio Zuddas

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

Logic in Computer Science · Computer Science 2015-07-01 Libor Barto , Marcin Kozik
‹ Prev 1 4 5 6 7 8 10 Next ›