SearcharxivSearch

arXiv subjects

Florent Hivert

Publications and source records attributed to Florent Hivert.

At least 19 recordsLinked to original sources

Diagrammatic Okada monoid and cellularity of the Okada algebra

It is well known that the Young lattice is the Bratelli diagram of the symmetric groups, expressing how irreducible representations restrict from $\mathfrak{S}_{N}$ to $\mathfrak{S}_{N-1}$. In 1975, Stanley discovered a similar lattice called the Young-Fibonacci lattice which was identified as the Bratelli diagram of a family of algebras $\{\mathbf{O}_N(X,Y)\}_{N \geq 0}$ by Okada in 1994. In this paper, we first realize the Okada algebra $\mathbf{O}_N(X,Y)$ and the associated monoid $\mathbf{O}_N$ using a labelled version of non-crossing arc-diagrams appearing in the description of the Temperley-Lieb algebra and Jones monoid. We establish, for general parameters $(X,Y)$, that the dimension of the Okada algebra $\mathbf{O}_N(X,Y)$ is $N!$, noting that Okada proved this result only in the semisimple case. We interpret a natural bijection between permutations and labelled arc-diagrams as an incarnation of Fomin's version of the Robinson-Schensted correspondence associated to the Young-Fibonacci lattice. The arc-diagram formalism allow us to probe the structure of the Okada monoid and algebra. In particular we prove that the Okada monoid is a regular, aperiodic $*$-monoid and we describe its Green relations and order. These results allow us to construct a cellular basis of the Okada algebra and to show that $\{\mathbf{O}_N(X,Y)\}_{N \geq 0}$ forms a coherent tower of cellular algebras in the sense of Goodman and Graber. We present some conjectures expressing the Gram determinant of the invariant bilinear form attached to each cell module in terms of Okada's clone Schur functions. We conclude the paper by presenting two follow-up, ongoing projects along with a series of questions pushing further the analogy between the symmetric groups and the Okada algebras.

math.RT

Heaps of rhombic dodecahedra, catalan congruences on alternating sign matrices, and bases of the Temperley-Lieb algebra

We prove that the excedance relation on permutations defined by N. Bergeron and L. Gagnon actually extends to a congruence of the lattice on alternating sign matrices. Motivated by this example, we study all lattice congruences of the lattice on alternating sign matrices whose quotient is isomorphic to the Stanley lattice on Dyck paths, which we call catalan congruences. We prove that the maxima of the congruence classes are always covexillary permutations (and all covexillary permutations appear this way), and that the minimal permutations in each class are always precisely the $321$-avoiding permutations. Finally, we show that any choice of representative permutations in each congruence class yield a basis of the Temperley-Lieb algebra with parameter $2$, vastly generalizing the bases arising from the excedance relation.

math.CO

Machine Checked Proofs and Programs in Algebraic Combinatorics

We present a library of formalized results around symmetric functions and the character theory of symmetric groups. Written in Coq/Rocq and based on the Mathematical Components library, it covers a large part of the contents of a graduate level textbook in the field. The flagship result is a proof of the Littlewood-Richardson rule, which computes the structure constants of the algebra of symmetric function in the schur basis which are integer numbers appearing in various fields of mathematics, and which has a long history of wrong proofs. A specific feature of algebraic combinatorics is the constant interplay between algorithms and algebraic constructions: algorithms are not only in computations, but also are key ingredients in definitions and proofs. As such, the proof of the Littlewood-Richardson rule deeply relies on the understanding of the execution of the Robinson-Schensted algorithm. Many results in this library are effective and actually used in computer algebra systems, and we discuss their certified implementation.

math.CO

Power Quotients of Plactic-like Monoids

In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations $a^{σ(a)} = a$ with $σ(a)\ge 2$ for every generator $a$. The starting point for this description is the recent paper of Abram and Reutenauer about the so-called stylic monoid which happens to be the quotient of the plactic monoid by the relations $a^2 = a$ for every letter $a$. The plactic-like monoids considered are the plactic monoid itself, the Chinese monoid, and the sylvester monoid. In each case we describe: a set of normal forms, and the idempotents; and obtain formulae for their size.

math.CO

Signaletic operads

We introduce $k$-signaletic operads and their Koszul duals, generalizing the dendriform, diassociative and duplicial operads (which correspond to the $k=1$ case). We show that the Koszul duals of the $k$-signaletic operads act on multipermutations and that the resulting algebras are free, thus providing combinatorial models for these operads. Finally, motivated by these actions on multipermutations, we introduce similar operations on multiposets which yield yet another relevant operad obtained as Manin powers of the $L$-operad.

math.CO

Diagram model for the Okada algebra and monoid

It is well known that the Young lattice is the Bratelli diagram of the symmetric groups expressing how irreducible representations restrict from $S_N$ to $S_{N-1}$. In 1988, Stanley discovered a similar lattice called the Young-Fibonacci lattice which was realized as the Bratelli diagram of a family of algebras by Okada in 1994. In this paper, we realize the Okada algebra and its associated monoid using a labeled version of Temperley-Lieb arc-diagrams. We prove in full generality that the dimension of the Okada algebra is $n!$. In particular, we interpret a natural bijection between permutations and labeled arc-diagrams as an instance of Fomin's Robinson-Schensted correspondence for the Young-Fibonacci lattice. We prove that the Okada monoid is aperiodic and describe its Green relations. Lifting those results to the algebra allows us to construct a cellular basis of the Okada algebra. }

math.RT

Controlling the C3 super class linearization algorithm

C3 is an algorithm used by several widely used programming languages such as Python to support multiple inheritance in object oriented programming (OOP): for each class, C3 computes recursively a linear extension of the poset of all its super classes (the Method Resolution Order, MRO) from user-provided local information (an ordering of the direct super classes). This algorithm can fail if the local information is not consistent. For large hierarchies of classes, as encountered when modeling hierarchies of concepts from abstract algebra in the SageMath computational system, maintaining consistent local information by hand does not scale and leads to unpredictable C3 failures. This paper reports on the authors' work to analyze and circumvent this maintenance nightmare. First, we discovered through extensive computer exploration that there exists posets admitting no consistent local information; we exhibit the smallest one which has 10 elements. Then, we provide and analyze an algorithm that, given a poset and a linear extension, automatically builds local information for C3 in such a way that guarantees that it will never fail, at the price of a slight relaxation of the hypotheses. This algorithm has been used in production in SageMath since 2013.

math.CO

Non-ambiguous trees: new results and generalisation (Full version)

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yields a new formula for the number of NATs. We also obtain q-versions of our formula. We finally generalise NATs to higher dimension.

cs.DM

The $0$-Rook Monoid and its Representation Theory

We show that a proper degeneracy at $q=0$ of the $q$-deformed rook monoid of Solomon is the algebra of a monoid $R_n^0$ namely the $0$-rook monoid, in the same vein as Norton's $0$-Hecke algebra being the algebra of a monoid $H_n^0 = H^0(A_{n-1})$ (in Cartan type~$A_{n-1}$). As expected, $R_n^0$ is closely related to the latter: it contains the $H^0(A_{n-1})$ monoid and is a quotient of $H^0(B_{n})$. We give a presentation for this monoid as well as a combinatorial realization as functions acting on the classical rook monoid itself. On the way we get a Matsumoto theorem for the rook monoid a result which was conjectured by Solomon. The $0$-rook monoid shares many combinatorial properties with the Hecke monoid: its Green right preorder is an actual order, and moreover a lattice (analogous to the right weak order) which has some nice combinatorial, and geometrical features. In particular the $0$-rook monoid is J-trivial. Following Denton-Hivert-Schilling-Thiéry, it allows us to describe its representation theory including the description of the simple and projective modules. We further show that $R_n^0$ is projective on $H_n^0$ and make explicit the restriction and induction functors along the inclusion map. We finally give a (partial) associative tower structures on the family of $(R_n^0)$ and we discuss its representation theory.

math.CO

Multiple Lie Derivatives and Forests

We obtain a complete time expansion of the pull-back operator generated by a real analytic flow of real analytic automorphisms acting on analytic tensor sections of a manifold. Our expansion is given in terms of multiple Lie derivatives. Motivated by this expansion, we provide a rather simple and explicit estimate for higher order covariant derivatives of multiple Lie derivatives acting on smooth endomorphism sections of the tangent bundle of a manifold. We assume the covariant derivative to be torsion free. The estimate is given in terms of Dyck polynomials. The proof uses a new result on the combinatorics of rooted labeled ordered forests and Dyck polynomials.

math.DG

Non-ambiguous trees: new results and generalisation

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our formula. And we generalize NATs to higher dimension.

math.CO

Exploring the tree of numerical semigroups

In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing very large optimizations: we obtain the number of numerical semigroups of genus g 67 and we confirm the Wilf conjecture for g 60.

math.CO

A set-operad of formal fractions and dendriform-like sub-operads

We introduce an operad of formal fractions, abstracted from the Mould operads and containing both the Dendriform and the Tridendriform operads. We consider the smallest set-operad contained in this operad and containing four specific elements of arity two, corresponding to the generators and the associative elements of the Dendriform and Tridendriform operads. We obtain a presentation of this operad (by binary generators and quadratic relations) and an explicit combinatorial description using a new kind of bi-colored trees. Similar results are also presented for related symmetric operads.

math.CO

The biHecke monoid of a finite Coxeter group and its representations

For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The construction of the biHecke monoid relies on the usual combinatorial model for the 0-Hecke algebra H_0(W), that is, for the symmetric group, the algebra (or monoid) generated by the elementary bubble sort operators. The authors previously introduced the Hecke group algebra, constructed as the algebra generated simultaneously by the bubble sort and antisort operators, and described its representation theory. In this paper, we consider instead the monoid generated by these operators. We prove that it admits |W| simple and projective modules. In order to construct the simple modules, we introduce for each w in W a combinatorial module T_w whose support is the interval [1,w]_R in right weak order. This module yields an algebra, whose representation theory generalizes that of the Hecke group algebra, with the combinatorics of descents replaced by that of blocks and of the cutting poset.

math.CO

A multivariate "inv" hook formula for forests

Bjoerner and Wachs provided two q-generalizations of Knuth's hook formula counting linear extensions of forests: one involving the major index statistic, and one involving the inversion number statistic. We prove a multivariate generalization of their inversion number result, motivated by specializations related to the modular invariant theory of finite general linear groups.

math.CO

On the representation theory of finite J-trivial monoids

In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich combinatorial description. Her constructions rely heavily on some triangularity property of the product, but do not use explicitly that the 0-Hecke algebra is a monoid algebra. The thesis of this paper is that considering the general setting of monoids admitting such a triangularity, namely J-trivial monoids, sheds further light on the topic. This is a step to use representation theory to automatically extract combinatorial structures from (monoid) algebras, often in the form of posets and lattices, both from a theoretical and computational point of view, and with an implementation in Sage. Motivated by ongoing work on related monoids associated to Coxeter systems, and building on well-known results in the semi-group community (such as the description of the simple modules or the radical), we describe how most of the data associated to the representation theory (Cartan matrix, quiver) of the algebra of any J-trivial monoid M can be expressed combinatorially by counting appropriate elements in M itself. As a consequence, this data does not depend on the ground field and can be calculated in O(n^2), if not O(nm), where n=|M| and m is the number of generators. Along the way, we construct a triangular decomposition of the identity into orthogonal idempotents, using the usual Möbius inversion formula in the semi-simple quotient (a lattice), followed by an algorithmic lifting step. Applying our results to the 0-Hecke algebra (in all finite types), we recover previously known results and additionally provide an explicit labeling of the edges of the quiver. We further explore special classes of J-trivial monoids, and in particular monoids of order preserving regressive functions on a poset, generalizing known results on the monoids of nondecreasing parking functions.

math.RT

Formal Proof of SCHUR Conjugate Function

The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions. The core of the computations relies on enumeration and manipulation of combinatorial structures. As a first "proof of concept", we present a formal proof of the conjugate function, written in C. This function computes the conjugate of an integer partition. To formally prove this program, we use the Frama-C software. It allows us to annotate C functions and to generate proof obligations, which are proved using several automated theorem provers. In this paper, we also draw on methodology, discussing on how to formally prove this kind of program.

cs.LO

The biHecke monoid of a finite Coxeter group

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously introduced the Hecke group algebra, constructed as the algebra generated simultaneously by the bubble sort and antisort operators, and described its representation theory. In this paper, we consider instead the monoid generated by these operators. We prove that it has |W| simple and projective modules. In order to construct a combinatorial model for the simple modules, we introduce for each w in W a combinatorial module whose support is the interval [1,w] in right weak order. This module yields an algebra, whose representation theory generalizes that of the Hecke group algebra. This involves the introduction of a w-analogue of the combinatorics of descents of W and a generalization to finite Coxeter groups of blocks of permutation matrices.

math.CO