Related papers: On Haar digraphical representations of groups

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

For graphs $G$ and $H$, a {\em homomorphism} from $G$ to $H$, or {\em $H$-coloring} of $G$, is an adjacency preserving map from the vertex set of $G$ to the vertex set of $H$. Writing ${\rm hom}(G,H)$ for the number of $H$-colorings…

Let $M$ be a smooth manifold and $\Gamma$ a group acting on $M$ by diffeomorphisms; which means that there is a group morphism $\rho:\Gamma\rightarrow \mathrm{Diff}(M)$ from $\Gamma$ to the group of diffeomorphisms of $M$. For any such…

Consider a unitary representation $\pi$ of a discrete group $G$, which, when restricted to an almost normal subgroup $\Gamma\subseteq G$, is of type II. We analyze the associated unitary representation $\overline{\pi}^{\rm{p}}$ of $G$ on…

A bipartite graph $H$ is said to have Sidorenko's property if the probability that the uniform random mapping from $V(H)$ to the vertex set of any graph $G$ is a homomorphism is at least the product over all edges in $H$ of the probability…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

This is my old unpublished paper called "The generalized Grassmann invariant". It shows how "pictures" also known as "Peiffer diagrams" represent elements of $H_3G$ for any group $G$ and shows that $K_3(\mathbb Z [G])$ is isomorphic to a…

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

We study how the partial group (co)homology of a group $G$ with coefficient in a partial representation $M$ can be described using the usual group (co)homology. To address this, we introduce the concept of the \textit{universal…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Let $\Gamma$ be a simple connect graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be \textit{singular} if and only if $0$ is an eigenvalue of $A.$ The \textit{nullity (singularity)} of $\Gamma,$…

Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

Given a set of finite words, the Overlap Graph (OG) is a complete weighted digraph where each word is a node and where the weight of an arc equals the length of the longest overlap of one word onto the other (Overlap is an asymmetric…

In this work, we introduce {\em topological representations of a quiver} as a system consisting of topological spaces and its relationships determined by the quiver. Such a setting gives a natural connection between topological…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…