Related papers: Ellis groups in model theory and strongly generic …

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n)_{n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf_{n\to\infty}\frac{|A\cap…

A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…

A subgroup $A$ of a finite group $G$ is said to be a $CAP$-subgroup of $G$, if for any chief factor $H/K$ of $G$, either $A H= AK$ or $A\cap H = A \cap K$. Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion…

A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…

A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…

We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given…

Let $G$ and $\tilde G$ be connected complex reductive Lie groups, $G$ semisimple. Let $\Lambda^+$ be the monoid of dominant weights for a positive root system $\Delta^+$, and let $l(w)$ be the length of a Weyl group element $w$. Let…

Algebraic Petri nets are a formalism for modeling distributed systems and algorithms, describing control and data flow by combining Petri nets and algebraic specification. One way to specify correctness of an algebraic Petri net model $N$…

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Let $G$ be a finite group and $H$ be a subgroup of $G$. Then $H$ is called a weakly $S\Phi$-supplemented subgroup of $G$, if there exists a subgroup $T$ of $G$ such that $G =HT$ and $H \cap T \leq \Phi (H) H_{sG}$, where $H_{sG}$ denotes…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

In the additive topological group $(\mathbb{R},+)$ of real numbers, we construct families of sets for which elements are not measurable in the Lebesgue sense. The constructed families have algebraic structures of being semigroups (i.e.,…

A graph H is strongly immersed in G if H is obtained from G by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removals. Equivalently, vertices of H are mapped to distinct…

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

A regular sampling theory in a multiply generated unitary invariant subspace of a separable Hilbert space $\mathcal{H}$ is proposed. This subspace is associated to a unitary representation of a countable discrete abelian group $G$ on…