Related papers: Abelian covers of alternating groups

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

A finite non-abelian group $H$ is hamiltonian if all of its subgroups are normal. We compute the minimal orders of graphs having a hamiltonian group as their automorphism group. The fixing number of a graph $\Gamma$ is the minimum…

We study graphon counterparts of the chromatic and the clique number, the fractional chromatic number, the b-chromatic number, and the fractional clique number. We establish some basic properties of the independence set polytope in the…

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

We show that for some classes of groups $G$, the homotopy fiber $E_{\mathrm{com}} G$ of the inclusion of the classifying space for commutativity $E_{\mathrm{com}} G$ into the classifying space $BG$, is contractible if and only if $G$ is…

Let $G$ be an almost simple group with socle $A_n$, the alternating group of degree $n$. We prove that there is a unit of order $pq$ in the integral group ring of $G$ if and only if there is an element of that order in $G$ provided $p$ and…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles…

An indecomposable decomposition of a torsion-free abelian group $G$ of rank $n$ is a decomposition $G=A_1\oplus\cdots\oplus A_t$ where $A_i$ is indecomposable of rank $r_i$ so that $\sum_i r_i=n$ is a partition of $n$. The group $G$ may…

We show that non-abelian quantum statistics can be studied using certain topological invariants which are the homology groups of configuration spaces. In particular, we formulate a general framework for describing quantum statistics of…

A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…

We study the relationship between the eternal domination number of a graph and its clique covering number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt. We…

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…

We present a family of finite, non-abelian groups and propose that there are members of this family whose commuting graphs are connected and of arbitrarily large diameter. If true, this would disprove a conjecture of Iranmanesh and…

We consider two variants of those Abelian groups with all proper strongly invariant subgroups isomorphic and give an in-depth study of their basic and specific properties in either parallel or contrast to the Abelian groups with all proper…

We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…

In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph $X$ is it the commuting graph of a group $G$? And if so, to determine such a group. We seek efficient algorithms for this…

We study the chromatic number of graphs that exclude a clique as a strong odd immersion and have independence number two. Given a graph $G$ and $t\in\mathbb{Z}^+$, we prove that if $\alpha(G)\leq 2$ and $G$ has no strong odd…

We construct connected $2$-arc-transitive covers of complete graphs with non-abelian characteristically simple transformation groups. This solves the existence problem for non-solvable $2$-arc-transitive covers of complete graphs.

In the paper we give an exhaustive arithmetic criterion of adjacency in prime graph $GK(G)$ for every finite nonabelian simple group $G$. By using this criterion for all finite simple groups an independence set with the maximal number of…