Related papers: A generalization of higher rank graphs

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.

Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…

We initiate the study of C*-algebras and groupoids arising from left regular representations of Garside categories, a notion which originated from the study of Braid groups. Every higher rank graph is a Garside category in a natural way. We…

In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…

The operation of zig-zag products of graphs is the analogue of the semidirect product of groups. Using this observation, we present a categorical description of zig-zag products in order to generalize the construction for the category of…

We lift the classical Hasse--Weil zeta function of varieties over a finite field to a map of spectra with domain the Grothendieck spectrum of varieties constructed by Campbell and Zakharevich. We use this map to prove that the Grothendieck…

A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common geodesic. Recently Klav\v{z}ar, Rall and Yero generalized this notion by defining a set of vertices to be in general…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…

This article presents a survey of work on lifted graphical models. We review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We…

We compare two different notions of generic expansions of countable saturated structures. One kind of genericity is related to model-companions and to amalgamation constructions \'a la Hrushovski-Fra\"iss\'e. Another notion of generic…

Here we give an overview on the connection between wavelet theory and representation theory for graph $C^{\ast}$-algebras, including the higher-rank graph $C^*$-algebras of A. Kumjian and D. Pask. Many authors have studied different aspects…

We generalize the geometric construction of quiver Hecke algebras from Varagnolo and Vasserot to a setup with arbitrary connected reductive groups. This corresponds to replacing quiver representations by generalized quiver representations…

We provide inverse semigroup and groupoid models for the Toeplitz and Cuntz-Krieger algebras of finitely aligned higher-rank graphs. Using these models, we prove a uniqueness theorem for the Cuntz-Krieger algebra.

Hypergraphs extend traditional graphs by enabling the representation of N-ary relationships through higher-order edges. Akin to a common approach of deriving graph Laplacians, we define function spaces and corresponding symmetric products…

Following the techniques of M. Sato (see \cite{Sa}), a generalization of the KP hierarchy for more than one variable is proposed. An approach to the classification of solutions and a method to construct algebraic solutions is also offered.

In type theories, universe hierarchies are commonly used to increase the expressive power of the theory while avoiding inconsistencies arising from size issues. There are numerous ways to specify universe hierarchies, and theories may…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

In this paper, first, we define and investigate $k$-layered numbers, which are a generalization of Zumkeller numbers. After that, we generalize the concept of Zumkeller labeling and Zumkeller cordial labeling to $k$-layered labeling and…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…