Related papers: Monoid algebras and graph products
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We consider integrable category $\mathcal{O}$ representations of Borcherds--Kac--Moody algebras whose Cartan matrix is finite dimensional, and determine the necessary and sufficient conditions for which the tensor product of irreducible…
The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like…
In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the…
The generating graph encodes how generating pairs are spread among the elements of a group. For more than ten years it has been conjectured that this graph is connected for every finite group. In this paper, we give evidence supporting this…
Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We show that the class of $\mathcal{C}$-hereditarily conjugacy separable groups is closed under taking arbitrary graph products whenever the class $\mathcal{C}$ is an extension closed variety of finite groups. As a consequence we show that…
In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…
The Morimoto theorem states that each connected abelian complex Lie group $A$ can be decomposed into the direct product of a group on which all holomorphic functions are constant, finitely many copies of $\mathbb{C}^\times$ and a vector…
This paper studies automorphisms and monomorphisms of direct products $\Gamma=\Gamma_1\times\cdots\times\Gamma_r$ of finitely generated virtually solvable minimax groups, a class containing all virtually polycyclic groups. Under an…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
An introduction to Leavitt path algebras of arbitrary directed graphs is presented, and direct limit techniques are developed, with which many results that had previously been proved for countable graphs can be extended to uncountable ones.…
It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…
For $n\geq 1$ we consider the class JP($n$) of dynamical systems whose every ergodic joining with a Cartesian product of $k$ weakly mixing automorphisms ($k\geq n$) can be represented as the independent extension of a joining of the system…