arXiv subjects
Publications and source records attributed to Jean-Christophe Aval.
Staircase tableaux are combinatorial objects which appear as key tools in the study of the PASEP physical model. The aim of this work is to show how the discovery of a tree structure in staircase tableaux is a significant feature to derive properties on these objects.
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally on alternative and permutation tableaux. Our insertion procedure allows to define in particular two simple new bijections between tree-like tableaux and permutations: the first one is conceived specifically to respect the generalized pattern 2-31, while the second one respects the underlying tree of a tree-like tableau.
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of identities due to Carlitz, and to Ehrenborg and Steingrímsson. We also provide a hook formula to count the number of non-ambiguous trees with a given underlying tree. Finally, we use non-ambiguous trees to describe a very natural bijection between parallelogram polyominoes and binary trees.
We study the statistics area, bounce and dinv on the set of parallelogram polyominoes having a rectangular m times n bounding box. We show that the bi-statistics (area, bounce) and (area, dinv) give rise to the same q,t-analogue of Narayana numbers which was introduced by two of the authors in [arXiv:1208.0024]. We prove the main conjectures of that paper: the q,t-Narayana polynomials are symmetric in both q and t, and m and n. This is accomplished by providing a symmetric functions interpretation of the q,t-Narayana polynomials which relates them to the famous diagonal harmonics.
In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.
We study, in a global uniform manner, the quotient of the ring of polynomials in l sets of n variables, by the ideal generated by diagonal quasi-invariant polynomials for general permutation groups W=G(r,n). We show that, for each such group W, there is an explicit universal symmetric function that gives the N^l-graded Hilbert series for these spaces. This function is universal in that its dependance on l only involves the number of variables it is calculated with. We also discuss the combinatorial implications of the observed fact that it affords an expansion as a positive coefficient polynomial in the complete homogeneous symmetric functions.
We show that the # product of binary trees introduced by Aval and Viennot [arXiv:0912.0798] is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPLs (HTFPLs) of even size whose coupling is a punctured version of the coupling pi. When the coupling pi is the coupling with all arches parallel pi0 (the "rarest" one), this formula states the equality of the number of corresponding HTFPLs to the number of cyclically-symmetric plane partition of the same size. We provide a bijective proof of this fact. In the case of HTFPLs odd size, and although there is no similar expression, we study the number of HTFPLs whose coupling is a slit version of pi_0, and put to light new puzzling enumerative coincidence involving countings of tilings of hexagons and various symmetry classes of FPLs.
The aim of this note is to show how the introduction of certain tableaux, called Catalan alternative tableaux, provides a very simple and elegant description of the product in the Hopf algebra of binary trees defined by Loday and Ronco. Moreover, we use this description to introduce a new associative product on the space of binary trees.
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number of half-turn symmetric ASM's.
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and the number of half-turn symmetric ASM's.
Lascoux and Schützenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices are in bijection with monotone triangles, which form a subclass of Young tableaux. We show that in this case these two notions of keys coincide. Moreover we obtain an elegant and direct way to compute the key of any Young tableau, and discuss consequences of our result.
We consider the partition function Z(N;x_1,...,x_N,y_1,...,y_N) of the square ice model with domain wall boundary. We give a simple proof of the symmetry of Z with respect to all its variables when the global parameter a of the model is set to the special value a=exp(iπ/3). Our proof does not use any determinantal interpretation of Z and can be adapted to other situations (for examples to some symmetric ice models).
The aim of this note is to give a surprising symmetry property of some harmonic algebraic curves: when all the roots $z_i$ of a complex polynomial $P$ lie on the unit circle $\U$, the points of $\U$ different from the $z_i$, and such that $\Arg(P(z))=θ$, form a regular $n$-gon, where $n$ is the degree of $P$.
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.
The purpose of this paper is to find a new way to prove the $n!$ conjecture for particular partitions. The idea is to construct a monomial and explicit basis for the space $M_μ$. We succeed completely for hook-shaped partitions, i.e., $μ=(K+1,1^L)$. We are able to exhibit a basis and to verify that its cardinality is indeed $n!$, that it is linearly independent and that it spans $M_μ$. We derive from this study an explicit and simple basis for $I_μ$, the annihilator ideal of $Δ_μ$. This method is also successful for giving directly a basis for the homogeneous subspace of $M_μ$ consisting of elements of 0 $x$-degree.
The aim of this work is to construct a monomial and explicit basis for the space $M_μ$ relative to the $n!$ conjecture. We succeed completely for hook-shaped partitions, i.e. $μ=(K+1,1^L)$. We are indeed able to exhibit a basis and to verify that its cardinality is $n!$, that it is linearly independent and that it spans $M_μ$. We deduce from this study an explicit and simple basis for $I_μ$, the annulator ideal of $Δ_μ$. This method is also successful for giving directly a basis for the homogeneous subspace of $M_μ$ consisting of elements of 0 $x$-degree.
The aim of this work is to study some lattice diagram determinants $Δ_L(X,Y)$. We recall that $M_L$ denotes the space of all partial derivatives of $Δ_L$. In this paper, we want to study the space $M^k_{i,j}(X,Y)$ which is defined as the sum of $M_L$ spaces where the lattice diagrams $L$ are obtained by removing $k$ cells from a given partition, these cells being in the ``shadow'' of a given cell $(i,j)$ in a fixed Ferrers diagram. We obtain an upper bound for the dimension of the resulting space $M^k_{i,j}(X,Y)$, that we conjecture to be optimal. This dimension is a multiple of $n!$ and thus we obtain a generalization of the $n!$ conjecture. Moreover, these upper bounds associated to nice properties of some special symmetric differential operators (the ``shift'' operators) allow us to construct explicit bases in the case of one set of variables, i.e. for the subspace $M^k_{i,j}(X)$ consisting of elements of 0 $Y$-degree.