Related papers: Involutions and their progenies

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

Correctly capturing the symmetry transformations of data can lead to efficient models with strong generalization capabilities, though methods incorporating symmetries often require prior knowledge. While recent advancements have been made…

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…

In this paper we investigate a class of (d+1) dimensional cosmological models with a cosmological constant possessing an R^d simply transitive symmetry group and show that it can be written in a form that manifests the effect of a…

We determine when a permutation with cycle type $\mu$ admits a non-zero invariant vector in the irreducible representation $V_\lambda$ of the symmetric group. We find that a majority of pairs $(\lambda,\mu)$ have this property, with only a…

We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets…

In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…

This paper describes work carried out on a model for the evolution of graph classes in complex objects. By defining evolution rules and propagation strategies on graph classes, we aim to define a user-definable means to manage data…

A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite…

Mathematical models play an increasingly important role in the interpretation of biological experiments. Studies often present a model that generates the observations, connecting hypothesized process to an observed pattern. Such generative…

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…

We identify those elements of the homeomorphism group of the circle that can be expressed as a composite of two involutions.

We study some classes of semi-linear differential equations including both well-posed and ill-posed cases that can generate cocycles (or cocycle correspondences with generating cocycles). Under exponential dichotomy condition with other…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…

In this article we focus on evolving information systems. First a delimitation of the concept of evolution is provided, resulting in a first attempt to a general theory for such evolutions. The theory makes a distinction between the…