Search

Entringer numbers occur in the Andr\'e permutation combinatorial set-up under several forms. This leads to the construction of a matrix-analog refinement of the tangent (resp. secant) numbers. Furthermore, closed expressions for the three-variate exponential generating functions for pairs of so-called Entringerian statistics are derived.

The derivative polynomials introduced by Knuth and Buckholtz in their calculations of the tangent and secant numbers are extended to a multivariable $q$--environment. The $n$-th $q$-derivatives of the classical $q$-tangent and $q$-secant are each given two polynomial expressions. The first polynomial expression is indexed by triples of integers, the second by compositions of integers. The functional relation between those two classes is fully given by means of combinatorial techniques. Moreover, those polynomials are proved to be generating functions for so-called $t$-permutations by multivariable statistics. By giving special values to those polynomials we recover classical $q$-polynomials such as the Carlitz $q$-Eulerian polynomials and the $(t,q)$-tangent and -secant analogs recently introduced. They also provide $q$-analogs for the Springer numbers. Finally, the $t$-compositions used in this paper furnish a combinatorial interpretation to one of the Fibonacci triangles.

A true Tree Calculus is being developed to make a joint study of the two statistics "eoc" (end of minimal chain) and "pom" (parent of maximum leaf) on the set of secant trees. Their joint distribution restricted to the set {eoc-pom<= 1} is shown to satisfy two partial difference equation systems, to be symmetric and to be expressed in the form of an explicit three-variable generating function.

The finite difference equation system introduced by Christiane Poupard in the study of tangent trees is reinterpreted in the alternating permutation environment. It makes it possible to make a joint study of both tangent and secant trees and calculate the generating polynomial for alternating permutations by a new statistic, referred to as being the greater neighbor of the maximum.

Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and then make a joint study of those two statistics. Their joint distribution is shown to be symmetric and to be expressed in the form of an explicit three-variable generating function.

A four-variable distribution on permutations is derived, with two dual combinatorial interpretations. The first one includes the number of fixed points "fix", the second the so-called "pix" statistic. This shows that the duality between derangements and desarrangements can be extended to the case of multivariable statistics. Several specializations are obtained, including the joint distribution of (des, exc), where "des" and "exc" stand for the number of descents and excedances, respectively., Comment: 26 pages

Using classical transformations on the symmetric group and two transformations constructed in Fix-Mahonian Calculus I, we show that several multivariable statistics are equidistributed either with the triplet (fix,des,maj), or the pair (fix,maj), where "fix," "des" and "maj" denote the number of fixed points, the number of descents and the major index, respectively.

We construct two bijections of the symmetric group S_n onto itself that enable us to show that three new three-variable statistics are equidistributed with classical statistics involving the number of fixed points. The first one is equidistributed with the triplet (fix,des,maj), the last two with (fix,exc,maj), where "fix," "des," "exc" and "maj" denote the number of fixed points, the number of descents, the number of excedances and the major index, respectively.

The flag-major index "fmaj" and the classical length function "$\ell$" are used to construct two $q$-analogs of the generating polynomial for the hyperoctahedral group~$B_n$ by number of positive and negative fixed points (resp. pixed points). Specializations of those $q$-analogs are also derived dealing with signed derangements and desarrangements, as well as several classical results that were previously proved for the symmetric group., Comment: 21 pages

We construct a basis for the right quantum algebra introduced by Garoufalidis, Le and Zeilberger and give a method making it possible to go from an algebra submitted to commutation relations (without the variable q) to the right quantum algebra by means of an appropriate weight-function. As a consequence, a strong quantum MacMahon Master Theorem is derived. Besides, the algebra of biwords is systematically in use., Comment: 9 pages

We study some specializations and extensions of the quantum version of the MacMahon Master Theorem derived by Garoufalidis, Le and Zeilberger. In particular, we obtain a (t,q)-analogue for the Cartier-Foata noncommutative version and a semi-strong (t,q)-analogue for the contextual algebra., Comment: 12 pages

We propose a new proof of the quantum version of MacMahon's Master Theorem, established by Garoufalidis, Le and Zeilberger., Comment: 8 pages

This is the classical monograph on the combinatorial study of Eulerian polynomials, published in 1970. It has been retyped in TeX and made available on the web with the kind permission of Springer-Verlag. This on-line version has an ouput of 49 pages. Written in French it contains the following items: 0. Introduction to and review of the Euler Numbers 1. General properties of the systems of exceedances and rises 2. The Eulerian polynomials 3. The exponential formula 4. Generating functions for the Eulerian polynomials 5. The alternating sums A(n)(-1) and B(n)(-1) 6. References, Comment: Plain-TeX; 49 pages

We derive combinatorial proofs of the main two evaluations of the Ihara-Selberg Zeta function associated with a graph. We give three proofs of the first evaluation all based on the algebra of Lyndon words. In the third proof it is shown that the first evaluation is an immediate consequence of Amitsur's identity on the characteristic polynomial of a sum of matrices. The second evaluation of the Ihara-Selberg Zeta function is first derived by means of a sign-changing involution technique. Our second approach makes use of a short matrix-algebra argument., Comment: AMSTeX, to appear in Trans. Amer. Math. Soc

By practicing the philosophy of our beloved late master, Marco Schutzenberger, to whose memory this article is dedicated, we give an insightful bijective proof of the three-term recurrence satisfied by the Hipparchus-Schroeder numbers 1,1,3,11,45,197,903, ...

A generalization of the classical statistics ``maj'' and ``inv'' (the major index and number of inversions) on words is introduced, parameterized by arbitrary graphs on the underlying alphabet. The question of characterizing those graphs that lead to equi-distributed "inv" and "maj" is posed and answered., Comment: Plain TeX

Capelli's and Turnbull's classical identities are given elegant combinatorial proofs., Comment: Plain TeX