Related papers: A generalization of higher rank graphs

We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…

We construct a natural generalization of the Grothendieck group $\mathrm{K}_0$ to the case of possibly unpointed categories admitting pushouts by using the concept of heaps recently introduced by Brezinzki. In case of a monoidal category,…

In Grayson's combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of…

The concept of generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ was introduced by Chartrand et al. in recent years. In our early paper, extremal theory for this graph parameter was started. We determined the minimal number of…

We study the categorical homology of Zappa-Sz\'ep products of small categories, which include all self-similar actions. We prove that the categorical homology coincides with the homology of a double complex, and so can be computed via a…

We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…

The paper introduces the notion of a representation $k$-graph $(\Delta,\alpha)$ for a given $k$-graph $\Lambda$. It is shown that any representation $k$-graph for $\Lambda$ yields a module for the Kumjian-Pask algebra $KP(\Lambda)$, and the…

We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…

To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…

Let $p$ be prime number and $K$ be a $p$-adic field. We systematically compute the higher $\mathrm{Ext}$-groups between locally analytic generalized Steinberg representations (LAGS for short) of $\mathrm{GL}_n(K)$ via a new combinatorial…

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

Let ${\cal G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$. We denote by ${\cal A}_k ({\cal G})$ the set…

In 1969, Roberts introduced proper and unit interval graphs and proved that these classes are equal. Natural generalizations of unit interval graphs called $k$-length interval graphs were considered in which the number of different lengths…

In this paper, generalized Pell graphs $\Pi _{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi _{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are…

Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

Higher-rank graphs (or $k$-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-Krieger $C^*$-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces…

A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank…

In this paper, we develop a $\times$-homotopy fundamental groupoid for graphs, and show a functorial relationship to the 2-category of graphs. We further explore the fundamental groupoid of graph products and develop a groupoid product…

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…