Related papers: Genus Permutations and Genus Partitions
Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric functions. We extend some of the generating functions to cylindric partitions. Also, we show…
In evolutionary dynamics, the probability that a mutation spreads through the whole population, having arisen in a single individual, is known as the fixation probability. In general, it is not possible to find the fixation probability…
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the…
Species sampling processes have long served as the fundamental framework for modeling random discrete distributions and exchangeable sequences. However, data arising from distinct but related sources require a broader notion of…
By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…
Let $\Sigma_{g,b}$ denote a closed oriented surface genus $g$ with $b$ punctures and let $Mod_{g,b}$ denote its mapping class group. Luo proved that if the genus is at least 3, the group $Mod_{g,b}$ is generated by involutions. He also…
A procedure to obtain the symbolic dynamics for conservative dynamical systems is introduced with reference to the standard map in a strongly chaotic regime. The method extends an approach previously developed for highly dissipative…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
It is a conjecture that the signature of a positive link is bounded below by an increasing function of its negated Euler characteristic. In relation to this conjecture, we apply the generator description for canonical genus to show that the…
Motivated by the fundamental problem of measuring species diversity, this paper introduces the concept of a cluster structure to define an exchangeable cluster probability function that governs the joint distribution of a random count and…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…
A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…
In this paper, cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions into unrestricted cylindric partitions and cylindric partitions into distinct parts with these profiles are constructed. The…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.
Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of…
For a positive integer $t \geq 2$, the $t$-core of a partition plays an important role in modular representation theory and combinatorics. We initiate the study of $t$-cores of partitions contained in an $r \times s$ rectangle. Our main…
We narrow in on the number of graphical partitions for which there is no known generating function by manipulating the well known generating function for Frobenius partitions.