Related papers: Two gluing methods for string C-group representati…

The notion of word-representable graphs is a generalization of comparability graphs, in which graphs are represented by words. The complexity of word-representation of a word-representable graph is captured through the representation…

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

This thesis consists of two parts. In the first part we study some topics in $\mathcal{N}=1$ supersymmeric gauge theory and the relation to matrix models. We review the relevant non-perturbative techniques for computing effective…

This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…

The embedding diagrams of representations of the N=2 superconformal algebra with central charge c=3 are given. Some non-unitary representations possess subsingular vectors that are systematically described. The structure of the embedding…

In a previous article we studied PGL(n,C)-representations of a 3-manifold via a generalization of Thurston's gluing equations. Neumann has proved some symplectic properties of Thurston's gluing equations that play an important role in…

We study a class of graph Hamiltonians given by a type of quiver representation to which we can associate (non)--commutative geometries. By selecting gauging data these geometries are realized by matrices through an explicit construction or…

We provide a detailed analysis of atomic *-representations of rank 2 graphs on a single vertex. They are completely classified up to unitary equivalence, and decomposed into a direct sum or direct integral of irreducible atomic…

We investigate the representation of a symmetric group $S_n$ on the homology of its Quillen complex at a prime $p$. For homology groups in small codimension, we derive an explicit formula for this representation in terms of the…

We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

This work extends the theory of reciprocal diagrams in graphic statics to frameworks that are invariant under finite group actions by utilizing the homology and representation theory of cellular cosheaves, recent tools from applied…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

A graph $G=(V,E)$ is word-representable if and only if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $xy\in E$. A split graph is a graph in which the vertices can be…

In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that,…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

We establish the tracial stability of a certain class of graph products of C*-algebras. This result involves the development of the "pincushion class" of finite graphs. We then apply this result in two ways. The first application yields a…

Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…

We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…

We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…