Related papers: Young classes of permutations

Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…

Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…

Let $S(d,N)$ denote the number of permutations in the symmetric group on $[N]$ which have no decreasing subsequence of length $d+1.$ We prove that $S(d,dn)$ is asymptotically equal to the number of standard Young tableaux of rectangular…

Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of the…

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…

Let T_k^m={\sigma \in S_k | \sigma_1=m}. We prove that the number of permutations which avoid all patterns in T_k^m equals (k-2)!(k-1)^{n+1-k} for k <= n. We then prove that for any \tau in T_k^1 (or any \tau in T_k^k), the number of…

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…

Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In…

For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…

A characteristic class for deformations of foliations called the Fuks-Lodder-Kotschick class (FLK class for short) is studied. It seems unknown if there is a real foliation with non-trivial FLK class. In this article, we show some…

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Let $G$ be a compact Lie group of Lie type $B_{n},$ such as $SO(2n+1)$. We characterize the tuples\ $(x_{1},...,x_{L})$ of the elements $x_{j}\in G$ which have the property that the product of their conjugacy classes has non-empty interior.…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

This paper addresses various questions about pairs of similarity classes of matrices which contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question…

We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.