Related papers: Counting orbits under Kreweras complementation

We study positive $m$-divisible non-crossing partitions and their positive Kreweras maps. In classical types, we describe their combinatorial realisations as certain non-crossing set partitions. We also realise these positive Kreweras maps…

We compute the weighted enumeration of plane partitions contained in a given box with complementation symmetry where adding one half of an orbit of cubes and removing the other half of the orbit changes the weight by -1 as proposed by…

Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…

Although both noncrossing partitions and nonnesting partitions are uniformly enumerated for Weyl groups, the exact relationship between these two sets of combinatorial objects remains frustratingly mysterious. In this paper, we give a…

Generic Kerr orbits exhibit intricate three-dimensional motion. We offer a classification scheme for these intricate orbits in terms of periodic orbits. The crucial insight is that for a given effective angular momentum $L$ and angle of…

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees…

Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

The combinatorics of RNA plays a central role in biology. Mathematical biologists have several commonly-used models for RNA: words in a fixed alphabet (representing the primary sequence of nucleotides) and plane trees (representing the…

Lattice paths in the quarter plane have led to a large and varied set of results in recent years. One major project has been the classification of step sets according to the properties of the corresponding generating functions, and this has…

We consider lattice walks in the plane starting at the origin, remaining in the first quadrant and made of West, South and North-East steps. In 1965, Germain Kreweras discovered a remarkably simple formula giving the number of these walks…

We address the problem of counting walks by winding angle on the Kreweras lattice, an oriented version of the triangular lattice. Our method uses a new decomposition of the lattice, which allows us to write functional equations…

The set of random walks with different step sets (of short steps) in the quarter plane has provided a rich set of models that have profoundly different integrability properties. In particular, 23 of the 79 effectively different models can…

The congruence orbit of a matrix has a natural connection with the linear complementarity problem on simplicial cones formulated for the matrix. In terms of the two approaches -- the congruence orbit and the family of all simplicial cones…

The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…

Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…

Given two irreducible curves of the plane which have isomorphic complements, it is natural to ask whether there exists an automorphism of the plane that sends one curve on the other. This question has a positive answer for a large family of…