Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We introduce a shifted analog of the plactic monoid of Lascoux and Schützenberger, the \emph{shifted plactic monoid}. It can be defined in two different ways: via the \emph{shifted Knuth relations}, or using Haiman's mixed insertion. Applications include: a new combinatorial derivation (and a new version of) the shifted Littlewood-Richardson Rule; similar results for the coefficients in the Schur expansion of a Schur $P$-function; a shifted counterpart of the Lascoux-Schützenberger theory of noncommutative Schur functions in plactic variables; a characterization of shifted tableau words; and m…
Power Quotients of Plactic-like Monoids
本文以stylic幺半群相关研究为基础，研究Plactic幺半群、Chinese幺半群、sylvester幺半群这几种类Plactic幺半群通过特定幂等关系的最小同余商，给出各商的正规形式、幂等元及规模公式。
Power quotients of plactic-like monoids
本文研究了plactic等类-plactic幺半群在含$a^{σ(a)}=a$（$σ(a)\geq2$）的最小同余下的商，刻画了其正规形式、幂等元、基数公式及同构类型，以stylic幺半群相关研究为起点展开。
This paper considers whether non-trivial identities are satisfied by certain `plactic-like' monoids that, like the plactic monoid, are closely connected to combinatorics. New results show that the hypoplactic, sylvester, Baxter, stalactic, and taiga monoids satisfy identities, and indeed give shortest identities satisfied by these monoids. The existing state of knowledge is discussed for the plactic monoid and left and right patience sorting monoids.
We use Kashiwara's theory of crystal bases to study the plactic monoid for type C. Then we describe the correponding sliding and bumping algorithms.
This paper uses the combinatorics of Young tableaux to prove the plactic monoid of infinite rank does not satisfy a non-trivial identity, by showing that the plactic monoid of rank $n$ cannot satisfy a non-trivial identity of length less than or equal to $n$. A new identity is then proven to hold for the monoid of $n \times n$ upper-triangular tropical matrices. Finally, a straightforward embedding is exhibited of the plactic monoid of rank $3$ into the direct product of two copies of the monoid of $3\times 3$ upper-triangular tropical matrices, giving a new proof that the plactic monoid of ra…
Plactic-like monoids arising from meets and joins of stalactic and taiga congruences
本文通过stalactic与taiga同余的交和并构造四个类plactic幺半群，建立Robinson-Schensted型对应及插入提取算法，并分析词类大小、句法性与等式理论。
We use Kashiwara's theory of crystal bases to study plactic monoids for $U_{q}(so_{2n+1})$ and $U_{q}(so_{2n})$. Simultaneously we describe a Schensted type correspondence in the crystal graphs of tensor powers of vector and spin representations and we derive a Jeu de Taquin for type $B$ from the Sheats sliding algorithm.
Lattices of varieties of plactic-like monoids
本研究探讨类 plactic 幺半群簇的交并等式理论，构造对应子格并计算元素公理秩，明确相关同余与簇的并结构，还证明三类 sylvester 类幺半群生成相同簇。
We exhibit a faithful representation of the plactic monoid of every finite rank as a monoid of upper triangular matrices over the tropical semiring. This answers a question first posed by Izhakian and subsequently studied by several authors. A consequence is a proof of a conjecture of Kubat and Okniński that every plactic monoid of finite rank satisfies a non-trivial semigroup identity. In the converse direction, we show that every identity satisfied by the plactic monoid of rank $n$ is satisfied by the monoid of $n \times n$ upper triangular tropical matrices. In particular this implies that …
From plactic monoids to hypoplactic monoids
本文在拟晶体框架下统一了plactic与hypoplactic幺半群的构造，给出了从张量积到拟张量积的充分条件，并建立了hypoplactic幺半群作为plactic幺半群商的充分条件。
The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. For certain monoids connected with combinatorics, such as the plactic monoid (the monoid of Young tableaux) and the sylvester monoid (the monoid of binary search trees), connected components consist of elements that have the same evaluation (that is, contain the same number of each generating symbol). This paper discusses new results on the diameters of connected components of the cyclic shift graphs of the finite-rank analogues of these monoids…
Timed words are words where letters of the alphabet come with time stamps. We extend the definitions of semistandard tableaux, insertion, Knuth equivalence, and the plactic monoid to the setting of timed words. Using this, Greene's theorem is formulated and proved for timed words, and algorithms for the RSK correspondence are extended to real matrices.
We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are proved without restrictions on the orderings of the alphabets.
The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. This paper examines the cyclic shift graphs of `plactic-like' monoids, whose elements can be viewed as combinatorial objects of some type: aside from the plactic monoid itself (the monoid of Young tableaux), examples include the hypoplactic monoid (quasi-ribbon tableaux), the sylvester monoid (binary search trees), the stalactic monoid (stalactic tableaux), the taiga monoid (binary search trees with multiplicities), and the Baxter monoid (pairs …
A new tropical plactic algebra is introduced in which the Knuth relations are inferred from the underlying semiring arithmetics, encapsulating the ubiquitous plactic monoid $\mathcal{P}_n$. This algebra manifests a natural framework for accommodating representations of $\mathcal{P}_n$, or equivalently of Young tableaux, and its moderate coarsening -- the cloaktic monoid $\mathcal{K}_n$ and the co-cloaktic $ ^{\operatorname{co}}\mathcal{K}_n$. The faithful linear representations of $\mathcal{K}_n$ and $\, ^{\operatorname{co}} \mathcal{K}_n$ by tropical matrices, which constitute a tropical plac…
Properties of plactic monoid centralizers
研究plactic monoid中u的中心化子性质，证明了稳定性现象并验证了关于系数的猜想。
We exhibit faithful representations of the hypoplactic, stalactic, taiga, sylvester, Baxter and right patience sorting monoids of each finite rank as monoids of upper triangular matrices over any semiring from a large class including the tropical semiring and fields of characteristic $0$. By analysing the image of these representations, we show that the variety generated by a single hypoplactic (respectively, stalactic or taiga) monoid of rank at least $2$ coincides with the variety generated by the natural numbers together with a fixed finite monoid $\mathcal{H}$ (respectively, $\mathcal{F}$)…
We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coherent way to give a family of generators of the relations amongst the relations. Such extended presentations are used for representations of monoids, in particular, it is a way to describe actions of monoids on categories. Moreover, a coherent presentation provides the first step in the computation of a categorical cofibrant replacement of a monoid. Our construction is based on a rewriting method introduced by Squier t…
The free monoid $A^*$ on a finite totally ordered alphabet $A$ acts at the left on columns, by Schensted left insertion. This defines a finite monoid, denoted $Styl(A)$ and called the stylic monoid. It is canonically a quotient of the plactic monoid. Main results are: the cardinality of $Styl(A)$ is equal to the number of partitions of a set on $|A|+1$ elements. We give a bijection with so-called $N$-tableaux, similar to Schensted's algorithm, explaining this fact. Presentation of $Styl(A)$: it is generated by $A$ subject to the plactic (Knuth) relations and the idempotent relations $a^2=a$, $…
A universal characterization of the shifted plactic monoid
本文针对控制对称群射影表示理论及迷向Grassmann流形上同调的移位Plactic幺半群$\boldsymbol{S}$，提供了类似Lascoux-Schützenberger对Plactic幺半群$\boldsymbol{P}$通用性质的刻画。
We study cells in generalised Bott-Samelson varieties for type C. These cells are parametrised by certain galleries in the affine building. We define a set of readable galleries - we show that the closure in the affine Grassmannian associated to a gallery in this set is an MV cycle. This then defines a map from the set of readable galeries to the set of MV cycles, which we show to be a morphism of crystals. We further compute the fibres of this map in terms of the Littelmann path model.
Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid $\mathbf{Pl}$, called \emph{plactic}. It is central in numerous combinatorial and algebraic applications. In this paper, the tableaux product is shown to be completely determined by a braiding $σ$ on the (much simpler!) set of columns $\mathbf{Col}$. Here a \emph{braiding} is a set-theoretic solution to the Yang--Baxter equation. As an application, we identify the Hochschild cohomology of $\mathbf{Pl}$, which resists classical approaches, with the more accessible braided cohomology of $(\…
We introduce new combinatorial objects called the shifted domino tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the super shifted plactic monoid, which is the shifted analog of the super plactic monoid. We also show that the sum over all shifted domino tableaux of a fixed shape describe a product of two Q-Schur functions, and by taking a different kind of shifted domino tableaux we describe a product of two P-Schur functions.
Centralizers in the plactic monoid
本文研究 plactic 幺半群中字的 Knuth 等价中心化子，刻画多类特殊情形，并利用偏序集划分理论证明其计数函数关于 m 呈多项式。
Mixed jeu de taquin and a problem of Soojin Cho
本文提出了一种新的斜移位浆果Schur函数定义，并发展了一种新的雅格多游戏理论来计算混合插入。
In this article we introduce the $\mathbb{N}-$decorated plactic monoid of type $C$, denoted $Pl^\mathbb{N}(C_n)$, via a finite convergent presentation $ACol$, with generating set $ACol(C_n)$ consisting of admissible columns, and an element $ε$. By Squier's coherent completion theorem, this presentation is extended into a coherent presentation by identifying a family of generating confluences, i.e. generating $3-$cells. Here the generating $3-$cells are critical branchings on words of length $3$. We adapt the notions of crystal structure to $ACol(C_n)^\ast$ , and show that the shape of $3-$cell…
Knuth moves for Schubert polynomials
本文研究完全旗流形舒伯特计数中具有结合性质的一类plactic双字，引入其上的Knuth变换类似物，并证明具有相同插入无凸点管道梦的任意两个plactic双字均可通过这些变换连接。
Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph for the $q$-analogue of the special linear Lie algebra $\mathfrak{sl}_{n}$, this monoid is the celebrated plactic monoid, whose elements can be identified with Young tableaux. The crystal graph and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson--Schensted--Knuth correspondence and so prov…
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Schützenberger's jeu de taquin on the structure of super tableaux over a signed alphabet. We show that this procedure which transforms super skew tableaux into super Young tableaux is compatible with the super plactic congruence and it is confluent. We deduce properties relating the super jeu de taquin to insertion algorithms on super tableaux. Moreover, we introduce the super evacuation procedure as an…
Kashiwara's crystal graphs have a natural monoid structure that arises by identifying words labelling vertices that appear in the same position of isomorphic components. The celebrated plactic monoid (the monoid of Young tableaux), arises in this way from the crystal graph for the $q$-analogue of the general linear Lie algebra $\mathfrak{gl}_{n}$, and the so-called Kashiwara operators interact beautifully with the combinatorics of Young tableaux and with the Robinson--Schensted--Knuth correspondence. The authors previously constructed an analogous `quasi-crystal' structure for the related hypo…
We study a representation of the (local) plactic monoid given by Schur operators $u_i$, which act on partitions by adding a box in column $i$ (if possible). In particular, we give a complete list of the relations that hold in the algebra of Schur operators.
We give a new construction of a Hopf algebra defined first by Reading whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a Robinson-Schensted-like correspondence and insertion algorithm. Indeed, the Baxter monoid leads to the definition of a lattice structure over pairs of twin binary trees and the definition of a Hopf algebra. The algebraic properties of this Hopf algebra are st…
We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e. Baxter permutations, pairs of twin binary trees, etc.). This construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a Robinson-Schensted-like insertion algorithm. The algebraic properties of this Hopf algebra are studied. This Hopf algebra appeared for the first time in the work of Reading [Lattice congruences, fans and Hopf algebras, Journal …
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an application, we construct a new combinatorial Hopf algebra on binary trees with multiplicities and use it to prove a hook length formula for those trees. Dans une première partie, nous formalisons la construction d'algèbres de Hopf combinatoires à partir d'une réalisation polynomiale et de monoïdes de type monoïde plaxique. Grâce à cette construction, nous metto…
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new construction of the algebra of Planar Binary Trees of Loday-Ronco, defining it in the same way as Non-Commutative Symmetric Functions and Free Symmetric Functions. We briefly explain how the main known properties of the Loday-Ronco algebra can be described and proved with this combinatorial point of view, and then discuss it from a representation theoretica…
Structure of quasi-crystal graphs and applications to the combinatorics of quasi-symmetric functions
本文通过引入拟阵列结构，研究了拟晶体图的组合性质，解释了其分量同构，并分别肯定和否定了Maas-Gariépy关于拟对称函数与Schur函数相互作用及分量排列的两个猜想。
In previous work with Mikhail Khovanov and Aaron Lauda we introduced two odd analogues of the Schur functions: one via the combinatorics of Young tableaux (odd Kostka numbers) and one via the odd symmetrization operator. In this paper we introduce a third analogue, the plactic Schur functions. We show they coincide with both previously defined types of Schur function, confirming a conjecture. Using the plactic definition, we establish an odd Littlewood-Richardson rule. We also re-cast this rule in the language of polytopes, via the Knutson-Tao hive model.
Constructed tableaux and a new shifted Littlewood-Richardson rule
针对各向同性格拉斯曼流形的Schubert结构系数，提出一种新的Littlewood-Richardson规则，首次给出Serrano公式的代数证明，并基于Yamanouchi表格的类比得到易于实现且时间复杂度更优的算法。
Invariant Theory for the free left-regular band and a q-analogue
本文从不变式理论出发，研究自由左正则带及其q-模拟的幺半群代数，证明不变子代数为半单交换代数，并用Stirling数刻画，进而借助随机游走理论实现不可约分解。
It is well known that the underlying simplicial set of any simplicial group is a Kan complex. Roughly speaking, Kan complex is an infinite-dimensional analogue of groupoid, and the relation between groupoids and categories resembles that between groups and monoids. Thus one may ask if the underlying simplicial set of each simplicial monoid is a quasi-category. In this short note, we construct a simplicial monoid whose underlying simplicial set is not a quasi-category.
Partition algebras as monoid algebras
本文通过矩阵单位构造、表组合双射及 RSK 对应类比等方法，为半单分拆代数构造了一个在乘法下封闭并成为幺半群的基，从而赋予其非扭幺半群代数结构。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。