Related papers: Permutation polytopes and indecomposable elements …

A sharp bound on the number of invariant components of an interval exchange transformation is provided. More precisely, it is proved that the number of periodic components n_per and the number of minimal components n_min of an interval…

Let $g(f)$ denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial $f$. Let $\Phi_n$ denote the $n$-th cyclotomic polynomial and let $\Psi_n$ denote the $n$-th inverse cyclotomic polynomial.…

A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Let $n$ be a positive integer and $G$ be a transitive permutation subgroup of $S_n$. Given a number field $K$ with $[K:\mathbb{Q}]=n$, we let $\widetilde{K}$ be its Galois closure over $\mathbb{Q}$ and refer to…

In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…

The theory of composite mixtures consisting of $n$ constituents is framed within the schema provided by the notion of $n$-groupoid. The point of departure is the analysis of $n$-dimensional hypercubes and their skeletons, to each of whose…

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…

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Let $G$ be a finite group and $k$ a field of characteristic $p > 0$. Balmer and Gallauer's recent result on finite $p$-permutation resolutions of $kG$-modules motivates the study of an intriguing new invariant; the $p$-permutation…

Let $\Gamma$ be a finite connected graph and $G$ a vertex-transitive group of its automorphisms. The pair $(\Gamma, G)$ is said to be locally-$L$ if the permutation group induced by the action of the vertex-stabiliser $G_v$ on the set of…

In 2008, Borovik and Cherlin posed the problem of showing that the degree of generic transitivity of an infinite permutation group of finite Morley rank $(X,G)$ is at most $n+2$ where $n$ is the Morley rank of $X$. Moreover, they…

A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A square-free permutation of length $n$ is $P$-crucial, where $P$ is a subset of $\{0,1,\ldots,n\}$, if any of its…

The power graph $\mathcal P_G$ of a finite group $G$ is the graph with the vertex set $G$, where two elements are adjacent if one is a power of the other. We first show that $\mathcal P_G$ has an transitive orientation, so it is a perfect…

We discuss the permutation group G of massive vacua of four-dimensional gauge theories with N=1 supersymmetry that arises upon tracing loops in the space of couplings. We concentrate on superconformal N=4 and N=2 theories with N=1…

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots,k_n)$. We prove that, if $K = \max\{k_1,\dots,k_n\}$, then the…

The subgroup commutativity degree of a group G has been defined in [6] as the probability that two subgroups of G commute, or equivalently that the product of two subgroups is again a subgroup. Problem 4.3 of [6] asks whether there exist…

The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all k! permutation patterns. Let r_k(n) be the maximum size of a…