Trivial meet and join within the lattice of monotone triangles.

zbMath1325.06005arXiv1401.5409MaRDI QIDQ405297

John Engbers, Adam Hammett

Publication date: 4 September 2014

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

Full work available at URL: https://arxiv.org/abs/1401.5409

zbMATH Keywords

joinsmeetsalternating sign matricesmonotone triangles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Asymptotic enumeration (05A16) Matrices of integers (15B36) Sign pattern matrices (15B35)

Related Items (3)

On random partitions induced by random maps ⋮ On comparability of bigrassmannian permutations ⋮ Unnamed Item

Uses Software

• ROBBINS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A direct bijection between descending plane partitions with no special parts and permutation matrices
• Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
• The number of monotone triangles with prescribed bottom row
• Exact solution of the six-vertex model with domain wall boundary conditions. Disordered phase
• Proof of the alternating sign matrix conjecture
• The operator formula for monotone triangles - simplified proof and three generalizations
• Where the typical set partitions meet and join
• Minimally intersecting set partitions of type B
• How often are two permutations comparable?
• Meet and join within the lattice of set partitions

This page was built for publication: Trivial meet and join within the lattice of monotone triangles.