Related papers: Stallings Graphs, Algebraic Extensions and Primiti…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
By using the logarithmic approach of the classical kernels for the K2 of number fields, we compute the 2-rank of the wild kernel WK2(F) and the 2-rank of the subgroup of infinite heigh elements in K2(F) in terms of positive class groups for…
We show that counterexamples of Iyengar and Walker to the algebraic version of Gunnar Carlsson's conjecture on the rank of the homology of a free complex can be extended to examples over any finite group with many choices of the complex.
Graded Artinian algebras can be regarded as algebraic analogues of cohomology rings (in even degrees) of compact topological manifolds. In this analogy, a free extension of a base ring with a fiber ring corresponds to a fiber bundle over a…
Consider a diagram $\cdots \to F_3 \to F_2\to F_1$ of algebraic systems, where $F_n$ denotes the free object on $n$ generators and the connecting maps send the extra generator to some distinguished trivial element. We prove that (a) if the…
A fascinating problem on digraphs is the existence problem of the finiteupper bound on s for all vertex-primitive s-arc-transitive digraphs except directed cycles (which is known to be reduced to the almost simple groups case). In this…
We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Let $H$ be a finite-dimensional Hopf algebra. We study the behaviou r of primitive and maximal ideals in certain types of ring extensions determined by $H$. The main focus is on the class of faithfully flat Galois extensions, which includes…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive…
We start by studying the distribution of (cyclically reduced) elements of the free groups Fn with respect to their abelianization (or equivalently, their integer homology class. We derive an explicit generating function, and a limiting…
The Engel graph of a finite group $G$ is a directed graph encoding the pairs of elements in $G$ satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…
This is an expository paper aimed to outline the current situation with problems related with the occurrence of eigenvalue $1$ of elements in linear groups and group representations.
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…