Related papers: Enumerating conjugacy classes of graphical groups …

We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…

In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Let R be a commutative ring and M be an R-module. We define the large sum graph, denoted by \acute{G}(M), as a graph with the vertex set of non-large submodules of M and two distinct vertices are adjacent if and only if N + K is a non-large…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

We continue our investigation of binary actions of simple groups. In this paper, we demonstrate a connection between the graph $\Gamma(\mathcal{C})$ based on the conjugacy class $\mathcal{C}$ of the group $G$, which was introduced in our…

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…

We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…

We consider the group G of R-automorphisms of the polynomial ring R[x] especially in the case where R is the ring of integers modulo n. We describe conjugacy classes in G, and in the case where n = 4, we describe more explicitly the…

We determine the combinatorics of transitive module categories over the monoidal category of finite dimensional $\mathfrak{sl}_3$-modules which arise when acting by the latter monoidal category on arbitrary simple $\mathfrak{sl}_3$-modules.…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…