English
Related papers

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

200 papers

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…

Combinatorics · Mathematics 2015-02-05 Luke Morgan , Pablo Spiga , Gabriel Verret

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

Logic · Mathematics 2023-06-22 Oleg Kudinov , Victor Selivanov

A new result of G. Cz\'edli states that for an ordered set $P$ with at least two elements and a group $G$, there exists a bounded lattice $L$ such that the ordered set of principal congruences of $L$ is isomorphic to $P$ and the…

Rings and Algebras · Mathematics 2022-08-04 G. Grätzer

String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure. Here we elaborate this…

Logic in Computer Science · Computer Science 2017-01-11 Joost Engelfriet , Hendrik Jan Hoogeboom

For every group $G$, we show that either $G$ has a topologically transitive action on the line $\mathbb R$ by orientation-preserving homeomorphisms, or every orientation-preserving action of $G$ on $\mathbb R$ has a wandering interval.…

Dynamical Systems · Mathematics 2018-04-10 Enhui Shi , Lizhen Zhou

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

Group Theory · Mathematics 2015-10-19 Timothy C. Burness , Hung P. Tong-Viet

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

Let $G$ be a transitive permutation group of degree $n$. We say that $G$ is $2'$-elusive if $n$ is divisible by an odd prime, but $G$ does not contain a derangement of odd prime order. In this paper we study the structure of quasiprimitive…

Group Theory · Mathematics 2017-04-21 Timothy C. Burness , Michael Giudici

We study finite transitive permutation groups $G\leqslant\operatorname{Sym}(\Omega)$ such that all orbits of the conjugation action on $G$ of the normaliser of $G$ in $\operatorname{Sym}(\Omega)$ have size bounded by some constant. Our…

Group Theory · Mathematics 2020-04-08 Alexander Bors , Michael Giudici

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

Algebraic Geometry · Mathematics 2026-05-05 Enrico Savi

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

Representation Theory · Mathematics 2007-05-23 Valentin Vankov Iliev

An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…

Algebraic Topology · Mathematics 2009-07-20 Leonardo Cabrer , Daniele Mundici

We describe the relationship between two versions of Tarski-Grothendieck set theory: the first-order set theory of Mizar and the higher-order set theory of Egal. We show how certain higher-order terms and propositions in Egal have…

Logic in Computer Science · Computer Science 2019-07-22 Chad E. Brown , Karol Pąk

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…

Logic · Mathematics 2020-09-21 Amador Martin-Pizarro , Martin Ziegler

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of…

Group Theory · Mathematics 2018-07-04 Jillian D. McPhee , James D. Mitchell , Martyn Quick

We introduce a first-order theory $\mathsf{Seq}$ which is mutually interpretable with Robinson's $\mathsf{Q}$. The universe of a standard model for $\mathsf{Seq}$ consists of sequences. We prove that $\mathsf{Seq}$ directly interprets the…

Logic · Mathematics 2024-02-23 Lars Kristiansen , Juvenal Murwanashyaka

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$. From the orbit counting lemma, it follows that $G$ contains a derangement,…

Group Theory · Mathematics 2021-12-09 Timothy C. Burness , Emily V. Hall

In this paper, we consider the group Aut$(\mathbb{Q}, \leq)$ of order-automorphisms of the rational numbers, proving a result analogous to a theorem of Galvin's for the symmetric group. In an announcement, Kh\'elif states that every…

Group Theory · Mathematics 2017-05-17 J. Hyde , J. Jonusas , J. D. Mitchell , Y. H. Peresse

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

Combinatorics · Mathematics 2026-04-10 Hiranya Kishore Dey , Umesh Shankar , Sivaramakrishnan Sivasubramanian

Let $G\leqslant\mathrm{Sym}(\Omega)$ be transitive, and let $S$ be an intersecting subset, namely, the ratio $xy^{-1}$ of any elements $x,y\in S$ fixes some point. An EKR-type problem is to characterize transitive groups…

Group Theory · Mathematics 2024-12-30 CaiHeng Li , Venkata Raghu Tej Pantangi , Shujiao Song , Yilin Xie