Related papers: On one question of Shemetkov about composition for…

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

We discuss the notion of the universal relatively hyperbolic structure on a group which is used in order to characterize relatively hyperbolic structures on the group. We also study relations between relatively hyperbolic structures on a…

For a formation $\mathfrak{F}$ of finite groups consider a graph whose vertices are elements of a finite group and two vertices are connected by an edge if and only if they generates non-$\mathfrak{F}$-group as elements of a group. A…

For every group $G$, we introduce the set of hyperbolic structures on $G$, denoted $\mathcal{H}(G)$, which consists of equivalence classes of (possibly infinite) generating sets of $G$ such that the corresponding Cayley graph is hyperbolic;…

This paper develops a basic theory of H-groups. We introduce a special quotient of H-groups and extend some algebraic constructions of topological groups to the category of H-groups and H-maps. We use these constructions to prove some…

We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

The article deals with profinite groups in which the centralizers are pronilpotent (CN-groups). It is shown that such groups are virtually pronilpotent. More precisely, let G be a profinite CN-group, and let F be the maximal normal…

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

The notion of almost centralizer and almost commutator are introduced and basic properties are established. They are used to study $\widetilde{\mathfrak M}\_c$-groups, i. e.groups for which every descending chain of centralizers each having…

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

Suppose $G$ is a finitely presented group that is hyperbolic relative to ${\bf P}$ a finite collection of 1-ended finitely generated proper subgroups of $G$. If $G$ and the ${\bf P}$ are 1-ended and the boundary $\partial (G,{\bf P})$ has…

We study groups, all maximal nilpotent subgroups of class at most $k$ in which are malnormal. We show that such groups share many similar properties with the ordinary CSA groups. Similarly, we introduce the class of {\em nilpotency…

We determine the structure of the intersection of a finitely generated subgroup of a semiabelian variety $G$ defined over a finite field with a closed subvariety $X\subset G$.

We identify the semigroups consisting of bounded composition operators on the Hardy spaces $H^p(\U)$ of the upper half-plane. We show that any such semigroup is strongly continuous on $H^p(\U)$ but not uniformly continuous and we identify…

Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…

For simple theories with a strong version of amalgamation we obtain the canonical hyperdefinable group from the group configuration. This provides a generalization to simple theories of the group configuration theorem for stable theories.

Various equivalent conditions for a semigroup or a resolvent generated by a Markov process to be of Feller type are given.