Related papers: Annular noncrossing permutations and minimal trans…

We introduce a statistic $\pmaj$ on partitions of $[n]=\{1,2,..., n\}$, and show that it is equidistributed with the number of 2-crossings over partitions of $[n]$ with given sets of minimal block elements and maximal block elements. This…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

We prove that every non-minimal transitive subshift $X$ satisfying a mild aperiodicity condition satisfies $\limsup c_n(X) - 1.5n = \infty$, and give a class of examples which shows that the threshold of $1.5n$ cannot be increased. As a…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

In 2006 J.G. Thompson conjectured: "If F is a field and A is in GL(n,F), then there is a permutation matrix P such that AP is cyclic, that is, the minimal polynomial of AP is also its characteristic polynomial" (open problem 16.95 in the…

Schutzenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

The branching rule is one of the most fundamental properties of the Macdonald symmetric polynomials. It expresses a Macdonald polynomial as a nonnegative linear combination of Macdonald polynomials with smaller number of variables. Taking a…

We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was…

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a $2$-factor consisting of two chordless cycles, non-hamiltonian cycle permutation graphs and permutation…

Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

The number of shortest factorizations into reflections for a Singer cycle in GL_n(F_q) is shown to be (q^n-1)^(n - 1). Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

The stochastic trajectories of molecules in living cells, as well as the dynamics in many other complex systems, often exhibit memory in their path over long periods of time. In addition, these systems can show dynamic heterogeneities due…