Related papers: On Logically Cyclic Groups

The notion of a cyclic map g: A -> X is a natural generalization of a Gottlieb element in pi_n(X). We investigate cyclic maps from a rational homotopy theory point of view. We show a number of results for rationalized cyclic maps which…

Given a construction $f$ on groups, we say that a group $G$ is \textit{$f$-realisable} if there is a group $H$ such that $G\cong f(H)$, and \textit{completely $f$-realisable} if there is a group $H$ such that $G\cong f(H)$ and every…

In this article, we prove that if all non-trivial cyclic subgroups of a group $G$ are self normalizing and $G$ satisfies the implication $$ \ o(x)\neq o(y)\Rightarrow o(xy)\neq o(x), o(y), $$ for all non-trivial elements $x$ and $y$, then…

A subgroup $H$ of a group $G$ is called $\mathbb P$-subnormal in $G$ whenever either $H=G$ or there is a chain of subgroups $H=H_0\subset H_1\subset ... \subset H_n=G$ such that $|H_i:H_{i-1}|$ is a prime for all $i$. In this paper, we…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or…

Let $G$ be a Garside group with Garside element $\Delta$. An element $g$ in $G$ is said to be \emph{periodic} if some power of $g$ lies in the cyclic group generated by $\Delta$. This paper shows the following. (i) The periodicity of an…

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. P\"oschel (1974) that…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical…

We equip the categorified quantum group attached to a KLR algebra and an arbitrary choice of scalars with duality functor which is cyclic, that is, such that f=f^** for all 2-morphisms f. This is accomplished via a modified diagrammatic…

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

For a finite noncyclic group $G$, let $\Cyc(G)$ be a set of elements $a$ of $G$ such that $\langle a,b\rangle$ is cyclic for each $b$ of $G$. The noncyclic graph of $G$ is a graph with the vertex set $G\setminus \Cyc(G)$, having an edge…

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

We introduce and study the class of spherically ordered groups. The notions of spherically ordered groups and their spectra of spherical orderability are introduced. Values of these spectra are found for a series of natural groups.

The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…