On the lattice of subgroups of a free group: complements and rank

A $\vee$-complement of a subgroup $H \leqslant \mathbb{F}_n$ is a subgroup $K \leqslant \mathbb{F}_n$ such that $H \vee K = \mathbb{F}_n$. If we also ask $K$ to have trivial intersection with $H$, then we say that $K$ is a $\oplus$-complement of $H$. The minimum possible rank of a $\vee$-complement (resp. $\oplus$-complement) of $H$ is called the $\vee$-corank (resp. $\oplus$-corank) of $H$. We use Stallings automata to study these notions and the relations between them. In particular, we characterize when complements exist, compute the $\vee$-corank, and provide language-theoretical descriptions of the sets of cyclic complements. Finally, we prove that the two notions of corank coincide on subgroups that admit cyclic complements of both kinds. Comment: 27 pages, 5 figures

Boolean lattices in finite alternating and symmetric groups

Given a group G and a subgroup H, we let $\mathcal {O}_G(H)$ denote the lattice of subgroups of G containing H. This article provides a classification of the subgroups H of G such that $\mathcal {O}_{G}(H)$ is Boolean of rank at least $3$ when G is a finite alternating or symmetric group. Besides some sporadic examples and some twisted versions, there are two different types of such lattices. One type arises by taking stabilisers of chains of regular partitions, and the other arises by taking stabilisers of chains of regular product structures. As an application, we prove in this case a conjecture on Boolean overgroup lattices related to the dual Ore’s theorem and to a problem of Kenneth Brown.

Entropy Inequalities for Lattices

We study entropy inequalities for variables that are related by functional dependencies. Although the powerset on four variables is the smallest Boolean lattice with non-Shannon inequalities, there exist lattices with many more variables where the Shannon inequalities are sufficient. We search for conditions that exclude the existence of non-Shannon inequalities. The existence of non-Shannon inequalities is related to the question of whether a lattice is isomorphic to a lattice of subgroups of a group. In order to formulate and prove the results, one has to bridge lattice theory, group theory, the theory of functional dependences and the theory of conditional independence. It is demonstrated that the Shannon inequalities are sufficient for planar modular lattices. The proof applies a gluing technique that uses that if the Shannon inequalities are sufficient for the pieces, then they are also sufficient for the whole lattice. It is conjectured that the Shannon inequalities are sufficient if and only if the lattice does not contain a special lattice as a sub-semilattice.

Entropy Inequalities for Lattices

We study the existence or absence of non-Shannon inequalities for variables that are related by functional dependencies. Although the power-set on four variables is the smallest Boolean lattice with non-Shannon inequalities there exist lattices with many more variables without non-Shannon inequalities. We search for conditions that excludes the existence of non-Shannon inequalities. It is demonstrated that planar modular lattices cannot have non-Shannon inequalities. The existence of non-Shannon inequalities is related to the question of whether a lattice is isomorphic to a lattice of subgroups of a group.

Entropy Inequalities for Lattices

We study the existence or absence of non-Shannon inequalities for variables that are related by functional dependencies. Although the power-set on four variables is the smallest Boolean lattice with non-Shannon inequalities there exist lattices with many more variables without non-Shannon inequalities. We search for conditions that excludes the existence of non-Shannon inequalities. It is demonstrated that planar modular lattices cannot have non-Shannon inequalities. The existence of non-Shannon inequalities is related to the question of whether a lattice is isomorphic to a lattice of subgroups of a group.

Finite groups with a trivial Chermak–Delgado subgroup

The Chermak–Delgado lattice of a finite group is a modular, self-dual sublattice of the lattice of subgroups of G. The least element of the Chermak–Delgado lattice of G is known as the Chermak–Delgado subgroup of G. This paper concerns groups with a trivial Chermak–Delgado subgroup. We prove that if the Chermak–Delgado lattice of such a group is lattice isomorphic to a Cartesian product of lattices, then the group splits as a direct product, with the Chermak–Delgado lattice of each direct factor being lattice isomorphic to one of the lattices in the Cartesian product. We establish many properties of such groups and properties of subgroups in the Chermak–Delgado lattice. We define a CD-minimal group to be an indecomposable group with a trivial Chermak–Delgado subgroup. We establish lattice theoretic properties of Chermak–Delgado lattices of CD-minimal groups. We prove an extension theorem for CD-minimal groups, and use the theorem to produce twelve examples of CD-minimal groups, each having different CD lattices. Curiously, quasi-antichain p-group lattices play a major role in the author’s constructions.

On the Structure of the Schild Group in Relativity Theory

Alfred Schild has established conditions that Lorentz transformationsmap world-vectors (ct, x, y, z) with integer coordinates onto vectors of the same kind. These transformations are called integral Lorentz transformations.This paper contains supplements to our earlier work with a new focus on group theory. To relate the results to the familiar matrix group nomenclature, we associate Lorentz transformations with matrices in SL(z, ℂ). We consider the lattice of subgroups of the group originated in Schild’s paper and obtain generating sets for the full group and its subgroups.

On the lattice of subgroups of the lamplighter group

The techniques of modules and actions of groups on rooted trees are applied to study the subgroup structure and the lattice subgroup of lamplighter type groups of the form ℒn,p = (ℤ/pℤ)n ≀ ℤ for n ≥ 1 and p prime. We completely characterize scale invariant structures on ℒ1,2. We determine all points on the boundary of binary tree (on which ℒ1,p naturally acts in a self-similar manner) with trivial stabilizer. We prove the congruence subgroup property (CSP) and as a consequence show that the profinite completion [Formula: see text] of ℒ1,p is a self-similar group generated by finite automaton. We also describe the structure of portraits of elements of ℒ1,p and [Formula: see text] and show that ℒ1,p is not a sofic tree shift group in the terminology of [T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenza and Z. Sunic, Cellular automata between sofic tree shifts, Theor. Comput. Sci.506 (2013) 79–101; A. Penland and Z. Sunic, Sofic tree shifts and self-similar groups, preprint].

The Number of Chains of Subgroups in the Lattice of Subgroups of the Dicyclic Group

We give an explicit formula for the number of chains of subgroups in the lattice of subgroups of the dicyclic groupB4nof order4nby finding its generating function of multivariables.