相关论文: Corrigendum to "On the classification of prime-pow…

Eick & Leedham-Green sketched a construction for infinite sequences of finite $p$-groups with fixed coclass. These infinite sequences have turned out to be very useful in the theory of finite $p$-groups. We exhibit a detailed description…

A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…

The investigation of the graph $\mathcal{G}_p$ associated with the finite $p$-groups of maximal class was initiated by Blackburn (1958) and became a deep and interesting research topic since then. Leedham-Green and McKay (1976-1984)…

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

We deduce the periodicity 8 for the type of $Pin$ and $Spin$ representations of the orthogonal groups $O(n)$ from simple combinatorial properties of the finite Clifford groups generated by the gamma matrices. We also include the case of…

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

We introduce the concept of an infinite cochain sequence and initiate a theory of homological algebra for them. We show how these sequences simplify and improve the construction of infinite coclass families (as introduced by Eick and…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

Part of these notes was written as the author's 2013 master thesis. For proper flat schemes over a complete discrete valuation ring of mixed characteristic, we construct an isomorphism of certain subgroups of the Picard group and the first…

We formulate and prove a new variant of the Segal Conjecture describing the group of homotopy classes of stable maps from the p-completed classifying space of a finite group G to the classifying space of a compact Lie group K as the p-adic…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

In this paper, we investigate the edge-coloring number of the power graph of a finite group. We characterize which finite groups have overfull power graphs, showing that this occurs if and only if the group is cyclic of odd prime power…

Cameron, Manna and Mehatari investigated the question of which finite groups admit a power graph that is a cograph, also called power-cograph groups (Journal of Algebra 591 (2022)). They give a classification for nilpotent groups and…

Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…

We improve a result of Prokhorov and Shramov on the rank of finite $p$-subgroups of the birational automorphism group of a rationally connected variety. Known examples show that they are sharp in many cases.

In a previous work we introduced an elementary method to analyze the periodicity of a generating function defined by a single equation y=G(x,y). This was based on deriving a single set-equation Y = Gammma(Y) defining the spectrum of the…

In 2013, Jemal Abawajy, Andrei Kelarev and Morshed Chowdhury [1] proposed a problem to characterize the finite groups whose power graphs are Cayley graphs of some groups. Here we give a complete answer to this question.

The directed power graph $\vec{\mathcal P}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted by $\mathcal P(\mathbf G)$,…