Search

Hertzsprung patterns, recently introduced by Anders Claesson, are subsequences of a permutation contiguous in both positions and values, and can be seen as a subclass of bivincular patterns. This paper investigates Hertzsprung patterns within involutions, where additional structural constraints introduce new challenges. We present a general formula for enumerating occurrences of these patterns in involutions. We also analyze specific cases to derive the distribution of all Hertzsprung patterns of lengths two and three., Comment: 17 pages

We prove existence and multiplicity of Cantor families of small amplitude analytic in time periodic solutions of the completely resonant cubic nonlinear Klein-Gordon equation on $\mathbb{S}^3$ for an asymptotically full measure set of frequencies close to 1. The solutions are constructed by a Lyapunov-Schmidt decomposition and a Nash-Moser iterative scheme. We first find non-degenerate solutions of the Kernel equation. Then we solve the Range equation with a Nash-Moser iterative scheme to overcome small divisors problems.

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups generated by permutations avoiding few short patterns., Comment: 29 pages

We prove existence and multiplicity of Cantor families of small amplitude time periodic solutions of completely resonant Klein-Gordon equations on the sphere $\mathbb{S}^3$ with quadratic, cubic and quintic nonlinearity, regarded as toy models in General Relativity. The solutions are obtained by a variational Lyapunov- Schmidt decomposition, which reduces the problem to the search of mountain pass critical points of a restricted Euler-Lagrange action functional. Compactness properties of its gradient are obtained by Strichartz-type estimates for the solutions of the linear Klein-Gordon equation on $\mathbb{S}^3$., Comment: 53 pages

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length four case is more challenging and involves sequences of combinatorial interest, such as Motzkin and Fibonacci numbers.

Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like tableaux enumerated by Baxter numbers. We exhibit simple bijective links between these objects and three other combinatorial classes: (packed or mosaic) floorplans, twisted Baxter permutations and triples of non-intersecting lattice paths. From several (and unrelated) works, these last objects are already known to be enumerated by Baxter numbers, and our main contribution is to provide a unifying approach to bijections between Baxter objects, where Baxter tree-like tableaux play the key role. We moreover get new enumerative results about alternating twisted Baxter permutations. Finally, we define a new subfamily of floorplans, which we call alternating floorplans, and we enumerate these combinatorial objects.

It is well-known that the set $\mathbf I_n$ of involutions of the symmetric group $\mathbf S_n$ corresponds bijectively - by the Foata map $F$ - to the set of $n$-permutations that avoid the two vincular patterns $\underline{123},$ $\underline{132}.$ We consider a bijection $\Gamma$ from the set $\mathbf S_n$ to the set of histoires de Laguerre, namely, bicolored Motzkin paths with labelled steps, and study its properties when restricted to $\mathbf S_n(1\underline{23},1\underline{32}).$ In particular, we show that the set $\mathbf S_n(\underline{123},{132})$ of permutations that avoids the consecutive pattern $\underline{123}$ and the classical pattern $132$ corresponds via $\Gamma$ to the set of Motzkin paths, while its image under $F$ is the set of restricted involutions $\mathbf I_n(3412).$ We exploit these results to determine the joint distribution of the statistics des and inv over $\mathbf S_n(\underline{123},{132})$ and over $\mathbf I_n(3412).$ Moreover, we determine the distribution in these two sets of every consecutive pattern of length three. To this aim, we use a modified version of the well-known Goulden-Jacson cluster method., Comment: 24 pages

Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum of the positions of these descents. Our results are based on two new bijections, one between centrosymmetric involutions in S_{2n} and subsets of {1,...,n}, and another one showing that certain statistics on Young diagrams that fit inside a rectangle are equidistributed. We also use the latter bijection to refine a known result stating that the distribution of the major index on 321-avoiding involutions is given by the q-analogue of the central binomial coefficients.

We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside an n/2 by n/2 box. We also obtain a refinement that keeps track of the descent set, and we deduce an analogous result for the comajor index of 123-avoiding involutions.

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\'imsson. 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., Comment: 25 pages, 26 figures

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a bijection that allows us to determine some notable features of these permutations, such as the distribution of the statistics "number of ascents", "number of left-to-right maxima", "first element", and "position of the maximum element", Comment: 26 pages, 3 figures

We define a map $\nu$ between the symmetric group $S_n$ and the set of pairs of Dyck paths of semilength $n$. We show that the map $\nu$ is injective when restricted to the set of 1234-avoiding permutations and characterize the image of this map., Comment: 16 pages, 8 figures

A centrosymmetric permutation is one which is invariant under the reverse-complement operation, or equivalently one whose associated standard Young tableaux under the Robinson-Schensted algorithm are both invariant under the Schutzenberger involution. In this paper, we characterize the set of permutations avoiding 1243 and 2143 whose images under the reverse-complement mapping also avoid these patterns. We also characterize in a simple manner the corresponding Schroder paths under a bijection of Egge and Mansour. We then use these results to enumerate centrosymmetric permutations avoiding the patterns 1243 and 2143. In a similar manner, centrosymmetric involutions avoiding these same patterns are shown to be enumerated by the Pell numbers., Comment: 25 pages, 8 figures

We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of length $2n$ to every centrosymmetric permutation in $S_{2n}$ that avoids 123., Comment: 17 pages, 6 figures

We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set $S_n(123)$ of 123-avoiding permutations in $S_n$. In particular, we show that the descents of a permutation correspond to valleys and triple falls of the associated Dyck path. We get the Eulerian numbers of $S_n(123)$ by studying the joint distribution of these two statistics on Dyck paths., Comment: 8 pages, 4 figures

We exploit Krattenthaler's bijection between the set $S_n(3\textrm{-}1\textrm{-}2)$ of permutations in $S_n$ avoiding the classical pattern $3\textrm{-}1\textrm{-}2$ and Dyck $n$-paths to study the distribution of every consecutive pattern of length 3 on the set $S_n(3\textrm{-}1\textrm{-}2)$. We show that these consecutive patterns split into 3 equidistribution classes, by means of an involution on Dyck paths due to E.Deutsch. In addition, we state equidistribution theorems concerning triplets of statistics relative to the occurrences of the consecutive patterns of length 3 in a permutation., Comment: 18 pages, 7 figures

We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijections between Motzkin paths and two families of restricted involutions that are counted by Motzkin numbers, namely, involutions avoiding 4321 and 3412. As a consequence, we derive characterizations of Motzkin paths corresponding to involutions avoiding either 4321 or 3412 together with any pattern of length 3. Furthermore, we exploit the described bijection to study some notable subsets of the set of restricted involutions, namely, fixed point free and centrosymmetric restricted involutions., Comment: 22 pages, 10 figures

The paper was withdrawn because of its significant overlap with a paper appeared recently., Comment: withdrawn paper

We define an analogue of signed Eulerian numbers $f_{n,k}$ for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for $f_{n,k}$ arising from the properties of its generating function., Comment: 10 pages

We introduce an infinite family of lower triangular matrices $\Gamma^{(s)}$, where $\gamma_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ columns on a suitable subset of shapes. We show that the entries of these matrices satisfy a three-term row recurrence and we deduce recursive and asymptotic properties for the total number $\tau_s(n)$ of tableaux on $n$ cells and with at most $s$ columns., Comment: 11 pages, 1 figure

We present an extensive study of the Eulerian distribution on the set of self evacuated involutions, namely, involutions corresponding to standard Young tableaux that are fixed under the Sch$\ddot{\textrm{u}}$tzenberger map. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study for the subset of self evacuated involutions without fixed points., Comment: 18 pages

We establish a combinatorial connection between the sequence $(i_{n,k})$ counting the involutions on $n$ letters with $k$ descents and the sequence $(a_{n,k})$ enumerating the semistandard Young tableaux on $n$ cells with $k$ symbols. This allows us to show that the sequences $(i_{n,k})$ are not log-concave for some values of $n$, hence answering a conjecture due to F. Brenti., Comment: 10 pages