Monotone triangles and 312 pattern avoidance

MaRDI QIDQ648420zbMATH OpenFDO

Authors Robert Cori, Dominique Gouyou-Beauchamps, A. Ayyer

Publication date 22 November 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.1666, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i2p26.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

alternating sign matricesASMbijectionMagog trianglesmonotone trianglepattern avoidancepermutationwords

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric self-complementary plane partitions defined by a similar condition on the corresponding fundamental domains or Magog triangles. We prove that, when restricted to permutations, this class of ASMs reduces to 312-avoiding permutations. This leads us to generalize pattern avoidance on permutations to a family of words associated to ASMs, which we call Gog words. We translate the gapless condition on monotone trangles into a pattern avoidance-like condition on Gog words associated. We estimate the number of gapless monotone triangles using a bijection with p-branchings.

Review text

The authors demonstrate a bijection between a subclass of alternating sign matrices (ASMs) defined by the so-called ``gapless condition on the corresponding monotone triangle and a subclass of totally symmetric self-complementary plane partitions defined by a similar condition on the corresponding fundamental domains or Magog triangles. It is shown that, when restricted to permutations, this class of ASMs reduces to a set of 312-avoiding permutations. This leads the authors to extend pattern avoidance on permutations to a family of words associated to ASMs.

Recommendations

• Pattern avoidance in alternating sign matrices
• Wavelet Galerkin method for fourth-order multi-dimensional elliptic partial differential equations
• Combinatorial reciprocity for monotone triangles
• Pattern avoidance in alternating permutations and tableaux (extended abstract)
• Combinatorial reciprocity for monotone triangles

Cited in

(15)

• Sequences of labeled trees related to Gelfand-Tsetlin patterns
• De Finetti lattices and magog triangles
• Pattern avoidance in alternating sign matrices
• Multiply-refined enumeration of alternating sign matrices
• Weight-preserving bijections between integer partitions and a class of alternating sign trapezoids
• Finding Patterns Avoiding Many Monochromatic Constellations
• The enumeration of three pattern classes using monotone grid classes
• Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
• A Pipe Dream Perspective on Totally Symmetric Self-Complementary Plane Partitions
• GOE fluctuations for the maximum of the top path in alternating sign matrices
• Enumeration of pattern-avoiding alternating sign matrices: an asymptotic dichotomy
• Totally symmetric self-complementary plane partition matrices and related polytopes
• A pipe dream perspective on totally symmetric self-complementary plane partitions
• Key-avoidance for alternating sign matrices
• Where the monotone pattern (mostly) rules

Describes a project that uses

Uses Software

• ROBBINS

This page was built for publication: Monotone triangles and 312 pattern avoidance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648420)