English
Related papers

Related papers: Enumerations and Bijections for Stanley Polyominoe…

200 papers

The nonelliptic $\mathsf{A_2}$-webs with $k$ "$+$"s on the top boundary and $3n-2k$ "$-$"s on the bottom boundary combinatorially model the space $\mathsf{Hom}_{\mathfrak{sl}_3}(\mathsf{V}^{\otimes (3n-2k)}, \mathsf{V}^{\otimes k})$ of…

Combinatorics · Mathematics 2014-04-22 Georgia Benkart , Soojin Cho , Dongho Moon

Based on the author's previous work on the Jacobi identity for twisted relative vertex operator algebras and modules and on the generating function identities for affine Lie algebras, we interpret the second difference sequence of the…

Number Theory · Mathematics 2018-04-27 Cristiano Husu

In this paper, we mainly consider a combinatoric explanation for block Pfaffians in terms of non-intersecting paths, as a generalization of results obtained by Stembridge. As applications, we demonstrate how are generating functions of…

Combinatorics · Mathematics 2024-04-02 Zong-Jun Yao , Shi-Hao Li

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,..., x_n]$ generated by monomials $u_1,u_2,..., u_t$. We show that $S/I$ is pretty clean if either: 1) $u_1,u_2,..., u_t$ is a filter-regular sequence, 2)…

Commutative Algebra · Mathematics 2013-12-16 Somayeh Bandari , Kamran Divaani-Aazar , Ali Soleyman Jahan

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

Combinatorics · Mathematics 2019-06-27 Eric Marberg , Brendan Pawlowski

In this paper we consider a restricted class of convex polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like…

Combinatorics · Mathematics 2007-05-23 Enrica Duchi , Simone Rinaldi , Gilles Schaeffer

In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections…

Combinatorics · Mathematics 2022-06-01 Hyunsoo Cho , JiSun Huh , Hayan Nam , Jaebum Sohn

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…

Commutative Algebra · Mathematics 2013-12-16 Somayeh Bandari , Kamran Divaani-Aazar , Ali Soleyman Jahan

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

Combinatorics · Mathematics 2010-06-29 William Y. C. Chen , Kathy Q. Ji , Albert J. W. Zhu

The Stern poset $\mathcal{S}$ is a graded infinite poset naturally associated to Stern's triangle, which was defined by Stanley analogously to Pascal's triangle. Let $P_n$ denote the interval of $\mathcal{S}$ from the unique element of row…

Combinatorics · Mathematics 2020-06-02 Arthur L. B. Yang

Lin and Chang gave a generating function of convex polyominoes with an $m+1$ by $n+1$ minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is $$ \frac{m+n+mn}{m+n}{2m+2n\choose…

Combinatorics · Mathematics 2007-05-23 Victor J. W. Guo , Jiang Zeng

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

In this paper, we prove that if $I\subset S:=K[x_1,...,x_n]$ is a monomial ideal then $I$ and $S/I$ satisfy the Stanley conjecture when $I$ has a small number of generators, with respect to $\depth(S/I)$ and $\max\{|P|:\;P\in\Ass(S/I)\}$.…

Commutative Algebra · Mathematics 2011-12-30 Mircea Cimpoeas

The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…

Combinatorics · Mathematics 2023-10-10 William Q. Erickson , Markus Hunziker

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

Combinatorics · Mathematics 2026-02-19 Valery Lunts , Špela Špenko , Michel Van den Bergh

Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…

Numerical Analysis · Mathematics 2021-03-12 Hélène Barucq , Henri Calandra , Julien Diaz , Stefano Frambati

We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related…

Combinatorics · Mathematics 2007-05-23 Andrey O. Matveev

We introduce the notion of the space of parallel strings with partially summable labels, which can be viewed as a geometrically constructed group completion of the space of particles with labels. We utilize this to construct a machinery…

Algebraic Topology · Mathematics 2009-03-27 Shingo Okuyama , Kazuhisa Shimakawa

For a subclass of matchings, set partitions, and permutations, we describe a direct bijection involving only arc annotated diagrams that not only interchanges maximum nesting and crossing numbers, but also all refinements of crossing and…

Combinatorics · Mathematics 2012-10-23 Lily Yen