Related papers: Involutions and their progenies
In this short note, we classify the degree-inverting involution on the full square and triangular matrices.
In this paper, we consider cyclic permutations that avoid the monotone decreasing permutation $k(k-1)\ldots 21$, whose cycle also demonstrates some pattern avoidance. If the cycle is written in standard form with 1 appearing at the…
Certain classical generating functions for elements of reflection groups can be expressed using fundamental invariants called exponents. We give new analogues of such generating functions that accommodate orbits of reflecting hyperplanes…
A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee…
The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved that a cycle base of a permutation group of degree $n$ can be constructed in polynomial time in~$n$.
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
We prove the well-definedness of some deformations of the fibred biset category in characteristic zero. The method is to realize the fibred biset category and the deformations as the invariant parts of some categories whose compositions are…
A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…
This chapter is an overview of foundational results in the mathematical theory of replicator systems. Its primary aim is to provide a unified framework for the mathematical formalisation of evolutionary processes in the spirit of…
This paper is devoted to a discussion of specific properties of invariants in the theory of forms.
In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…
A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
The goal of the present paper is to find higher genus surgery formulae for the set of finite-type invariants of homology spheres, and to develop a companion theory of finite-type invariants to be applied, in a subsequent publication, to the…
This paper introduces a unified theoretical perspective that views deep generative models as probability transformation functions. Despite the apparent differences in architecture and training methodologies among various types of generative…