Related papers: Complete graph decompositions and p-groupoids
The cyclic group labeled family of quasi-projection operators is used for investigation of decomposition of functions with respect to the cyclic group of order n . Series of new identities thus arising are demonstrated and new perspectives…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…
A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel…
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of…
Kontsevich designed a scheme to generate infinitesimal symmetries $\dot{\mathcal{P}} = \mathcal{Q}(\mathcal{P})$ of Poisson brackets $\mathcal{P}$ on all affine manifolds $M^r$; every such deformation is encoded by oriented graphs on $n+2$…
We compute the group homology, the algebraic $K$- and $L$-groups, and the topological $K$-groups of right-angled Artin groups, right-angled Coxeter groups, and more generally, graph products.
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
We study the topological full group of ample groupoids over locally compact spaces. We extend Matui's definition of the topological full group from the compact, to the locally compact case. We provide two general classes of groupoids for…
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…
According to Li, Nicholson and Zan, a group $G$ is said to be morphic if, for every pair $N_{1}, N_{2}$ of normal subgroups, each of the conditions $G/N_{1} \cong N_{2}$ and $G/N_{2} \cong N_{1}$ implies the other. Finite, homocyclic…
Let $k$ be an algebraically closed field of positive characteristic $p>0$ and $C \to {\mathbb P}^1_k$ a $p$-cyclic cover of the projective line ramified in exactly one point. We are interested in the $p$-part of the full automorphism group…
We study the structure of generalized Baumslag-Solitar groups from the point of view of their (usually non-unique) splittings as fundamental groups of graphs of infinite cyclic groups. We find and characterize certain decompositions of…
We investigate deformations of skew group algebras that arise from a finite cyclic group acting on a polynomial ring in positive characteristic, where characteristic divides the order of the group. We allow deformations which deform both…
We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…
We give a self-contained algebraic description of a formal symplectic groupoid over a Poisson manifold M. To each natural star product on M we then associate a canonical formal symplectic groupoid over M. Finally, we construct a unique…
In this work we study the acyclic orientations of graphs. We obtain an encoding of the acyclic orientations of the complete $p$-partite graph with size of its parts $n_1,n_2,\ldots,n_p$ via a vector with $p$ symbols and length…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…