Related papers: Spectral triples for finitely presented groups, in…
We prove structural theorems for computing the completion of a G-spectrum at the augmentation ideal of the Burnside ring of a finite group G. First we show that a G-spectrum can be replaced by a spectrum obtained by allowing only isotropy…
The aim of this small note is to prove an elementary yet useful properties of finitely presented groups. Let G be a finitely generated group with one end. Fix a (finite) generating set and let $B_n$ be the ball of radius $n$ around $e$. Let…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
We classify 0-dimensional spectral triples over complex and real algebras and provide some general statements about their differential structure. We investigate also whether such spectral triples admit a symmetry arising from the Hopf…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
The unitary Cayley graph $C_R$ of a finite unital ring $R$ is the simple graph with vertex set $R$ in which two elements $x$ and $y$ are connected by an edge if and only if $x-y$ is a unit of $R$. We characterize the unitary Cayley graph…
In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup…
We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…
A regular spectral triple is proposed for a two-dimensional $\kappa$-deformation. It is based on the naturally associated affine group $G$, a smooth subalgebra of $C^*(G)$, and an operator $\caD$ defined by two derivations on this…
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…
We show that the lamplighter group L has a system of generators for which the spectrum of the discrete Laplacian on the Cayley graph is a union of an interval and a countable set of isolated points accumulating to a point outside this…
In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…
In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where…
The present work is devoted to characterize the family of symmetric undirected Cayley graphs over finite Abelian groups for degrees 4 and 6.
In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly…
We present a simple mechanism, which can be randomised, for constructing sparse $3$-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over $\mathbb{Z}_2^t$ and have vertex degree…
How different is the universal cover of a given finite 2-complex from a 3-manifold (from the proper homotopy viewpoint)? Regarding this question, we recall that a finitely presented group $G$ is said to be properly 3-realizable if there…
We define a cell complex with an action of the even spin mapping class group, and use it to obtain a finite presentation. We also obtain a finite presentation with Dehn twist generators.
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…