Combinatorics of hexagonal fully packed loop configurations

DOI10.1016/J.AAM.2015.05.002MaRDI QIDQ492701zbMATH OpenOpenAlexFDO

Authors Sabine Beil

Publication date 21 August 2015

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

lattice paths Littlewood-Richardson coefficients fully packed loop configurations Knutson-Tao puzzles

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10)

Abstract: In this article, fully packed loop configurations of hexagonal shape (HFPLs) are defined. They generalize triangular fully packed loop configurations. To encode the boundary conditions of an HFPL, a sextuple

(m a t h s f l_{m} a t h s f T, m a t h s f t, m a t h s f r_{m} a t h s f T; m a t h s f r_{m} a t h s f B, m a t h s f b, m a t h s f l_{m} a t h s f B)

of

01

-words is assigned to it. In the first main result of this article, necessary conditions for the boundary

(m a t h s f l_{m} a t h s f T, m a t h s f t, m a t h s f r_{m} a t h s f T; m a t h s f r_{m} a t h s f B, m a t h s f b, m a t h s f l_{m} a t h s f B)

of an HFPL are stated. For instance, the inequality

d (m a t h s f r_{m} a t h s f B) + d (m a t h s f b) + d (m a t h s f l_{m} a t h s f B) g e q d (m a t h s f l_{m} a t h s f T) + d (m a t h s f t) + d (m a t h s f r_{m} a t h s f T) + v e r t m a t h s f l_{m} a t h s f T v e r t_{1} v e r t m a t h s f t v e r t_{0} + v e r t m a t h s f t v e r t_{1} v e r t m a t h s f r_{m} a t h s f T v e r t_{0} + v e r t m a t h s f r_{m} a t h s f B v e r t_{0} v e r t m a t h s f l_{m} a t h s f B v e r t_{1}

has to be fulfilled, where

v e r t c d o t v e r t_{i}

denotes the number of occurrences of

i

for

i = 0, 1

and

d (c d o t)

denotes the number of inversions. The other main contribution of this article is the enumeration of HFPLs with boundary

(m a t h s f l_{m} a t h s f T, m a t h s f t, m a t h s f r_{m} a t h s f T; m a t h s f r_{m} a t h s f B, m a t h s f b, m a t h s f l_{m} a t h s f B)

such that

d (m a t h s f r_{m} a t h s f B) + d (m a t h s f b) + d (m a t h s f l_{m} a t h s f B) - d (m a t h s f l_{m} a t h s f T) - d (m a t h s f t) - d (m a t h s f r_{m} a t h s f T) - v e r t m a t h s f l_{m} a t h s f T v e r t_{1} v e r t m a t h s f t v e r t_{0} - v e r t m a t h s f t v e r t_{1} v e r t m a t h s f r_{m} a t h s f T v e r t_{0} - v e r t m a t h s f r_{m} a t h s f B v e r t_{0} v e r t m a t h s f l_{m} a t h s f B v e r t_{1} = 0, 1

. To be more precise, in the first case they are enumerated by Littlewood-Richardson coefficients and in the second case their number is expressed in terms of Littlewood-Richardson coefficients.

Recommendations

Cites work

Cited in

(2)

Describes a project that uses

Uses Software

ROBBINS

This page was built for publication: Combinatorics of hexagonal fully packed loop configurations

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