Related papers: The first-order theory of $\ell$-permutation group…

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…

We investigate characterizations of the Galois connection sInv-Aut between sets of finitary relations on a base set A and their automorphisms. In particular, for A=omega_1, we construct a countable set R of relations that is closed under…

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

An infinite linearly ordered set (S,<=) is called doubly homogeneous if its automorphism group A(S) acts 2-transitively on it. We show that any group G arises as outer automorphism group G cong Out(A(S)) of the automorphism group A(S), for…

We study a large family of generalized class groups of imaginary quadratic orders $O$ and prove that they act freely and (essentially) transitively on the set of primitively $O$-oriented elliptic curves over a field $k$ (assuming this set…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…

A transitive permutation group $G$ on a finite set $\Omega$ is said to be pre-primitive if every $G$-invariant partition of $\Omega$ is the orbit partition of a subgroup of $G$. It follows that pre-primitivity and quasiprimitivity are…

Let $G$ be a nontrivial permutation group of degree $n$. If $G$ is transitive, then a theorem of Jordan states that $G$ has a derangement. Equivalently, a finite group is never the union of conjugates of a proper subgroup. If $G$ is…

For a finite group $A$ with normal subgroup $G$, a subgroup $U$ of $G$ is an $A$-prime-power-covering subgroup if $U$ meets every $A$-conjugacy-class of elements of $G$ of prime power order. It is conjectured that $|G:U|$ is bounded by some…

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We develop a first-order theory of ordered transexponential fields in the language $\{+,\cdot,0,1,<,e,T\}$, where $e$ and $T$ stand for unary function symbols. While the archimedean models of this theory are readily described, the study of…

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

Let $G$ be an $\ell$-group (which is short for ``lattice-ordered abelian group''). Baker and Beynon proved that $G$ is finitely presented iff it is finitely generated and projective. In the category $\mathcal U$ of {\it unital}…

A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments, nor representation theory.

In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…

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…