Related papers: Ionescu's theorem for higher rank graphs
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…
We show how the description of a shear-free ray congruence in Minkowski space as an evolving family of semi-conformal mappings can naturally be formulated on a finite graph. For this, we introduce the notion of holomorphic function on a…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
We study $S(t-1,t,2t)$, which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs.…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In this paper we use their diagrammatic language to study graph states, a computationally interesting class of…
Network-based modeling of complex systems and data using the language of graphs has become an essential topic across a range of different disciplines. Arguably, this graph-based perspective derives its success from the relative simplicity…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
In this paper, we construct a comparison map from the topological fundamental group to the pro-\'etale fundamental group for a complex variety.
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
The representation theory (idempotents, quivers, Cartan invariants and Loewy series) of the higher order unital peak algebras is investigated. On the way, we obtain new interpretations and generating functions for the idempotents of descent…
In this article, we introduce Cohn path algebras of higher-rank graphs. We prove that for a higher-rank graph $\Lambda $, there exists a higher-rank graph $T\Lambda $ such that the Cohn path algebra of $\Lambda $ is isomorphic to the…
We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold…
We elaborate on the construction of the Evans chain complex for higher-rank graph $C^*$-algebras. Specifically, we introduce a block matrix presentation of the differential maps. These block matrices are then used to identify a wide family…
J.H.C. Whitehead's second free-group algorithm determines whether or not two given elements of a free group lie in the same orbit of the automorphism group of the free group. The algorithm involves certain connected graphs, and Whitehead…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.