Related papers: On dissociated infinite permutation groups

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…

We investigate properties of finite transitive permutation groups $(G, \Omega)$ in which all proper subgroups of $G$ act intransitively on $\Omega.$ In particular, we are interested in reduction theorems for minimally transitive…

Our aim is to describe the theory of Cartesian decompositions preserved by some member of a large family of finite transitive permutation groups called innatelytransitive groups.

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

An erratum has been added to resolve an issue raised by Professor Derek Holt. This appears after the original paper, and also includes two new results. Original abstract: Houghton's groups $H_2, H_3, \ldots$ are certain infinite permutation…

This abstract presents (without proofs) some new results on commutativity degree of finite groups.

Let $(\mathcal{G},\nu)$ be a $t$-discrete ergodic groupoid. Consider a finite Von Neumann algebra $\mathcal{M}$ with separable predual. We prove that every uniformly bounded measurable representation $\rho:\mathcal{G} \rightarrow…

We study the multifractal analysis of self-similar measures arising from random homogeneous iterated function systems. Under the assumption of the uniform strong separation condition, we see that this analysis parallels that of the…

Let $\mathbb{F}_2^\omega$ denote the countably infinite dimensional vector space over the two element field and $\operatorname{GL}(\omega, 2)$ its automorphism group. Moreover, let $\operatorname{Sym}(\mathbb{F}_2^\omega)$ denote the…

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…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

We define the decomposition property for partial actions of discrete groups on $C^*$-algebras. Decomposable partial systems appear naturally in practice, and many commonly occurring partial actions can be decomposed into partial actions…

We consider the derived category of permutation modules for a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the spectrum of its compact objects, by reducing the…

We relate two different proposals to extend the \'etale topology into homotopy theory, namely via the notion of finite cover introduced by Mathew and via the notion of separable commutative algebra introduced by Balmer. We show that finite…

We define and study entanglement of continuous positive definite functions on products of compact groups. We formulate and prove an infinite-dimensional analog of Horodecki Theorem, giving a necessary and sufficient criterion for…

Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…

The aim of this monograph is twofold: to explain various nonautonomous integrable systems (discrete Painlev\'e all the way up to the elliptic level, as well as generalizations \`a la Garnier) using an interpretation of difference and…

A countable discrete group is called Choquet-Deny if for any non-degenerate probability measure on the group, the corresponding space of bounded harmonic functions is trivial. Building on the previous work of Jaworski, a complete…

We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…