Related papers: Permutation Designs and Sequencing Highly Transiti…
We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…
In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution…
Given a finitely generated discrete group {\Gamma}, we construct for any admissible crossed product completion and for any metrizable finite dimensional compact {\Gamma}-space X, a universal Higson-Roe six-term exact sequence for the…
Figure-eight solutions are solutions to planar equal mass three-body problem under homogeneous or inhomogeneous potentials. They are known to be invariant under the transformation group $D_6$: the dihedral group of regular hexagons.…
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…
Let $\Omega$ be a finite set and $T(\Omega)$ be the full transformation monoid on $\Omega$. The rank of a transformation $t\in T(\Omega)$ is the natural number $|\Omega t|$. Given $A\subseteq T(\Omega)$, denote by $\langle A\rangle$ the…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…
In this paper, I show that if $p$ is an odd prime, and if $P$ is a finite $p$-group, then there exists an exact sequence of abelian groups $$0\to T(P)\to D(P)\to\lproj{P}\to H^1\big(\apdeux(P),\Z\big)^{(P)},$$ where $D(P)$ is the Dade group…
The involution fixity ${\rm ifix}(G)$ of a permutation group $G$ of degree $n$ is the maximum number of fixed points of an involution. In this paper we study the involution fixity of primitive almost simple exceptional groups of Lie type.…
Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We prove a lower and an upper bound on the number of block moves necessary to sort a permutation. We put our results in contrast with existing results on sorting by block transpositions, and raise some open questions.
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
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…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G~S_n on the generalized…
In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the…
Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…