Related papers: Decomposing simple permutations, with enumerative …

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

The sequence a_1,...,a_m is a common subsequence in the set of permutations S = {p_1,...,p_k} on [n] if it is a subsequence of p_i(1),...,p_i(n) and p_j(1),...,p_j(n) for some distinct p_i, p_j in S. Recently, Beame and Huynh-Ngoc (2008)…

We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez & Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…

Partially ordered patterns (POPs) play an important role in the study of permutation patterns, providing a convenient framework for describing large families of classical patterns. The problem of enumerating permutations that avoid POPs has…

Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many…

We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…

Let, for r>=2, (m_r(n)),n>=0, be Moser sequence such that every nonnegative integer is the unique sum of the form s_k+rs_l. In this article we give an explicit decomposition formulas of such form and an unexpectedly simple recursion…

Comtet introduced the notion of indecomposable permutations in 1972. A permutation is indecomposable if and only if it has no proper prefix which is itself a permutation. Indecomposable permutations were studied in the literature in various…

P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly…

We establish an exact formula for the length of the shortest permutation containing all layered permutations of length $n$, proving a conjecture of Gray.

We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…