English
Related papers

Related papers: Pattern-Avoiding Polytopes

200 papers

Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in…

We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…

Combinatorics · Mathematics 2023-06-22 Mitchell Paukner , Lucy Pepin , Manda Riehl , Jarred Wieser

Let $A_k$ be the set of permutations in the symmetric group $S_k$ with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns $A_k$. We present a bijection between symmetric Schroder paths of length…

Combinatorics · Mathematics 2008-10-30 Eva Y. P. Deng , Mark Dukes , Toufik Mansour , Susan Y. J. Wu

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

Combinatorics · Mathematics 2013-01-10 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

In Ehrhart theory, the $h^*$-vector of a rational polytope often provide insights into properties of the polytope that may be otherwise obscured. As an example, the Birkhoff polytope, also known as the polytope of real doubly-stochastic…

Combinatorics · Mathematics 2015-04-28 Robert Davis

Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation $\pi$ on $\{1,1,2,2,\ldots, n,n\}$ is called non-crossing if it avoids the crossing patterns $\{1212,2121\}$ and is called…

Combinatorics · Mathematics 2025-05-12 Kassie Archer , Robert P. Laudone

In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare…

Combinatorics · Mathematics 2012-06-21 Michael Dairyko , Lara Pudwell , Samantha Tyner , Casey Wynn

We introduce the "Median Inverse Problem" for metric spaces. In particular, having a permutation $\pi$ in the symmetric group $S_n$ (endowed with the breakpoint distance), we study the set of all $k$-subsets $\{x_1,...,x_k\}\subset S_n$ for…

Combinatorics · Mathematics 2017-12-11 Poly H. da Silva , Arash Jamshidpey , David Sankoff

We investigate the convex hulls of the eight dihedral symmetry classes of $n \times n$ alternating sign matrices, i.e., ASMs invariant under a subgroup of the symmetry group of the square. Extending the prefix-sum description of the ASM…

Combinatorics · Mathematics 2026-02-23 Péter Madarasi

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…

Combinatorics · Mathematics 2010-11-15 Andrew Crites

Given a root system $\Phi$ of type $A_n$, $B_n$, $C_n$, or $D_n$ in Euclidean space $E$, let $W$ be the associated Weyl group. For a point $p \in E$ not orthogonal to any of the roots in $\Phi$, we consider the $W$-permutohedron $P_W$,…

Algebraic Geometry · Mathematics 2021-05-13 Tatsuya Horiguchi , Mikiya Masuda , John Shareshian , Jongbaek Song

The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we…

Algebraic Geometry · Mathematics 2022-07-13 Miruna-Stefana Sorea

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

Symbolic Computation · Computer Science 2022-06-13 Thi Xuan Vu

We study the PBW filtration on irreducible finite--dimensional representations for the Lie algebra of type $\tt B_n$. We prove in several cases, including all multiples of the adjoint representation and all irreducible finite--dimensional…

Representation Theory · Mathematics 2018-08-22 Teodor Backhaus , Deniz Kus

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein…

Combinatorics · Mathematics 2012-12-19 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…

Combinatorics · Mathematics 2026-01-21 Sergi Elizalde , Amya Luo

A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…

Combinatorics · Mathematics 2022-10-12 Nicolas Bonichon , Pierre-Jean Morel

In the first of this series of two articles, we studied some geometrical aspects of the Birkhoff polytope, the compact convex set of all $n \times n$ doubly stochastic matrices, namely the Chebyshev center, and the Chebyshev radius of the…

Metric Geometry · Mathematics 2023-10-24 Ludovick Bouthat , Javad Mashreghi , Frédéric Morneau-Guérin

We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of…

Combinatorics · Mathematics 2023-06-22 David Bevan

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

Combinatorics · Mathematics 2016-05-06 Alexander Diaz-Lopez , Pamela E. Harris , Erik Insko , Mohamed Omar
‹ Prev 1 4 5 6 7 8 10 Next ›