Related papers: On stabilizers in finite permutation groups

This paper provides a comprehensive analysis of stability and long-time behaviour of a coupled system constituted by two rigid bodies separated by a thin layer of lubricant. We show that permanent rotations of the whole system, with the…

An action of a group on a set is oligomorphic if it has finitely many orbits of $n$-element subsets for all $n$. We prove that for a large class of groups (including all groups of finite virtual cohomological dimension and all countable…

We show the existence of stable bound orbits for the massive and massless particles moving in the simplest microstate geometry spacetime in the bosonic sector of the five-dimensional minimal supergravity. In our analysis, reducing the…

In this paper we analyze the structure of transitive permutation groups that have trivial four point stabilizers, but some nontrivial three point stabilizer. In particular we give a complete, detailed classification when the group is simple…

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

To a set $\mathcal{B}$ of 4-subsets of a set $\Omega$ of size $n$ we introduce an invariant called the `hole stabilizer' which generalises a construction of Conway, Elkies and Martin of the Mathieu group $M_{12}$ based on Loyd's…

Inspired by work of McMullen, we show that any orbit for the action of the diagonal group on the space of lattices, accumulates on a stable lattice. We use this to settle a conjecture of Ramharter about Mordell's constant, get new proofs of…

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

In recent years, there has been a considerable amount of interest in stability of equations and their corresponding groups. Here, we initiate the systematic study of the quantitative aspect of this theory. We develop a novel method,…

For any group, there is a natural (pseudo-)norm on the vector space B1 of real (group) 1-boundaries, called the stable commutator length norm. This norm is closely related to, and can be thought of as a relative version of, the Gromov…

We study polynomial and exponential stability for $C_{0}$-semigroups using the recently developed theory of operator-valued $(L^{p},L^{q})$ Fourier multipliers. We characterize polynomial decay of orbits of a $C_{0}$-semigroup in terms of…

Let $G$ be a finite group. Let $U_1,U_2,\dots$ be a sequence of orthogonal representations in which any irreducible representation of $\oplus_{n \geq 1} U_n$ has infinite multiplicity. Let $V_n=\oplus_{i=1}^n U_n$ and $S(V_n)$ denote the…

We show that if a flat group scheme acts properly, with finite stabilizers, on an algebraic space, then a quotient exists as a separated algebraic space. More generally we show any flat groupid for which the family of stabilizers is finite…

We show that the local-global divisibility in commutative algebraic groups defined over number fields can be tested on sets of primes of arbitrary small density, i.e. stable and persistent sets. We also give a new description of the…

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

This work is concerned with multi-party stabilizer states in the sense of quantum information theory. We investigate the homological invariants for states of which each party holds a large equal number N of quantum bits. We show that in…

Motivated by recent results on the minimal base of a permutation group, we introduce a new local invariant attached to arbitrary finite groups. More precisely, a subset Delta of a finite group G is called a p-base (where p is a prime) if…

For each element $u$ in a finite group $G$ define a map $\theta_u\colon G\to G$ by $\theta_u(g)=[g^{-u},g]$ and set $\Theta_G(u)=\{g\in G\mid \theta_u^n(g)=g \hbox{ for some } n>0\}$. Then $\theta_u$ induces a permutation of $\Theta_G(u)$;…

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…