Related papers: Kac's Theorem for equipped graphs and for maximal …

We present a uniqueness theorem for k-graph C*-algebras that requires neither an aperiodicity nor a gauge invariance assumption. Specifically, we prove that for the injectivity of a representation of a k-graph C*-algebra, it is sufficient…

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…

We develop the approach via quasihomomorphisms and the universal algebra $qA$ to Kasparov's $KK$-theory, so as to cover versions of $KK$ such as $KK^{nuc}$, $KK^G$ and ideal related $KK$-theory.

In this note we prove two extensions of a recent combinatorial characterization due to Li, Qiao, Wigderson, Wigderson and Zhang (arXiv:2206.04815) of the maximal dimension of bounded rank subspaces of the graphical matrix space associated…

We prove that all quiver Grassmannians for exceptional representations of a generalized Kronecker quiver admit a cell decomposition. In the process, we introduce a class of regular representations which arise as quotients of consecutive…

The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

In this paper we define the notion of monic representation for the $C^*$-algebras of finite higher-rank graphs with no sources, and undertake a comprehensive study of them. Monic representations are the representations that, when restricted…

The purpose of this article has two fold. The first is to generalize some recent second main theorems for the mappings and moving hyperplanes of $\P^n(\C)$ to the case where the counting functions are truncated multiplicity (by level $n$)…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Extending Wigner's theorem we give a characterization of positive maps of $B(H)$ into itself which map the set of rank k projections onto itself.

We introduce the notion of a super-representation of a quiver. For super-representations of quivers over a field of characteristic zero, we describe the corresponding (super)algebras of polynomial semi-invariants and polynomial invariants.

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…

Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with matching number at least $\ell$. In a previous paper by the authors, a generalization was…

This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the…

We define the relative Cuntz-Krieger algebras associated to finitely aligned higher-rank graphs. We prove versions of the gauge-invariant uniqueness theorem and the Cuntz-Krieger uniqueness theorem for relative Cuntz-Krieger algebras.

In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…

We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…