zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Noncyclic graph of a group. (English) Zbl 1131.20016
In two papers published as Technical Reports at the Rose-Hulman Institute of Technology the idea of a cyclicizer of an element was introduced. For an element $x\in G$, $\text{Cyc}_G(x)=\{y\mid\langle x,y\rangle$ is cyclic $\}$. For a subset $X$, $\text{Cyc}_G(X)$ is defined to be the intersection of the cyclicizers of the elements of $X$. Note that $\text{Cyc}_G(G)=\text{Cyc}(G)$, the cyclicizer of $G$. Trivially $\text{Cyc}(G)\leq Z(G)$. The paper is organised in eight sections. The second contains some basic facts about cyclicizers and discusses some results about non-locally-cyclic groups with $\text{Cyc}(G)\neq 1$. The authors introduce the non-cyclic graph of a group $G$, $\Gamma(G)$, this is defined to have vertices $G\setminus\text{Cyc}(G)$ with two vertices $x$ and $y$ joined if $\langle x,y\rangle$ is not cyclic. In Section 3 they show that $\Gamma(G)$ is connected and that the diameter is at most $3$, and the example they give of a group with diameter $3$ is a direct product of the symmetric group of degree $6$ and the cyclic group of order $6$. It is curious that such a restriction on diameters is not uncommon in graphs defined by groups. There is an alternative graph, the non-commuting graph defined to have vertices $G\setminus Z(G)$ with two vertices $x$ and $y$ joined if $[x,y]\neq 1$, this is a subgraph of the non-cyclic graph. The non-commuting graph was studied by {\it B. H. Neumann} [J. Aust. Math. Soc., Ser. A 21, 467-472 (1976; Zbl 0333.05110)]. In this paper he showed that the graph contains no infinite cliques if and only if $G/Z(G)$ is cyclic. They show that the equivalent result holds for the non-cyclic graph, that is $\Gamma(G)$ has no cliques if and only if $G/\text{Cyc}(G)$ is cyclic. The last two sections consider the interesting problem of when $\Gamma(G)$ uniquely determines the group, though even the general question of the order for finite groups is not answered. It should be noted that this only makes sense for groups which are not locally cyclic. They give a number of results which discuss special cases. One of which leads to a conjecture of Goormaghtigh on numbers of the form $(x^n-1)/(x^m-1)$.

20D60Arithmetic and combinatorial problems on finite groups
05C25Graphs and abstract algebra
Full Text: DOI