Related papers: Permutation clones that preserve relations
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
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…
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…
In this article, we prove infinitary version of one to one correspondence theorem between clones and relational clones on a fixed possibly infinite set. We also characterize the relational clone corresponding to the clone of all finitary…
We determine the homological dimension of various isogeny categories of commutative algebraic groups over a field $k$, in terms of the cohomological dimension of $k$ at certain primes. This generalizes results of Serre, Oort and Milne, by…
We prove that two finite-dimensional commutative algebras over an algebraically closed field are isomorphic if and only if they give rise to isomorphic representations of the category of finite sets and surjective maps.
In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…
Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…
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…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…
The main result of this work is the characterization of the covering relations of the Bruhat order of the maximal parabolic quotients of type B. Our approach is mainly combinatorial and is based in the pattern of the corresponding…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
The $2$-closure $\overline{G}$ of a permutation group $G$ on $\Omega$ is defined to be the largest permutation group on $\Omega$, having the same orbits on $\Omega\times\Omega$ as $G$. It is proved that if $G$ is supersolvable, then…
Given a quantum permutation group $G\subset S_N^+$, with orbits having the same size $K$, we construct a universal matrix model $\pi:C(G)\to M_K(C(X))$, having the property that the images of the standard coordinates $u_{ij}\in C(G)$ are…
On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…