Related papers: Commuting involution graphs of linear groups
We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…
We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…
Let $R$ be a noncommutative ring with identity. The commuting graph of $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R \setminus Z(R)$, and two vertices $a$, $b$ are adjacent if $a\neq b$ and $ab=ba$. Let $T=Tr(R)$ be the ring of…
In the paper we give a complete classification of $2$-dimensional evolution algebras over algebraically closed fields, describe their groups of automorphisms and derivation algebras.
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $\Gamma_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
In this paper, given a split extension of an arbitrary Coxeter group by automorphisms of the Coxeter graph, we determine the involutions in that extension whose centralizer has finite index. Our result has applications to many problems such…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
Let $\Gamma$ be a Cayley graph generated by a transposition tree. A natural problem is to understand how the properties of the Cayley graph depend on those of the underlying transposition tree. We focus here on diameter and distance related…
Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$…
We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…
The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial…
The commensurability index between two subgroups $A, B$ of a group $G$ is $[A : A \cap B] [B : A\cap B]$. This gives a notion of distance amongst finite-index subgroups of $G$, which is encoded in the p-local commensurability graphs of $G$.…
We exhibit a set of generating relations for the modular invariant ring of a vector and a covector for the two-dimensional general linear group over a finite field.
This paper focuses on finite-time in-network computation of linear transforms of distributed graph data. Finite-time transform computation problems are of interest in graph-based computing and signal processing applications in which the…
Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…
Let $G$ be a group such that $G/Z(G)$ is finite and simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with edges corresponding to pairs of elements that do not commute and do not generate…
We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…