Related papers: Ordered Exchange Graphs
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
The research of one-dimensional Ising model with the different number of neighbors and the different sign of the exchange integral were performed. Magnetization shows the transition from disorder to order (in finite systems) only at…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Let $\mathcal{D}$ be a Hom-finite, Krull-Schmidt, 2-Calabi-Yau triangulated category with a rigid object $R$. Let $\Lambda=\operatorname{End}_{\mathcal{D}}R$ be the endomorphism algebra of $R$. We introduce the notion of mutation of maximal…
Evolution algebras are a special class of non-associative algebras exhibiting connections with different fields of Mathematics. Hilbert evolution algebras generalize the concept through a framework of Hilbert spaces. This allows to deal…
Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Important objects of study in $\tau$-tilting theory include the $\tau$-tilting pairs over an algebra on the form $kQ/I$, with $kQ$ being a path algebra and $I$ an admissible ideal. In this paper, we study aspects of the combinatorics of…
In the acyclic case, we establish a one-to-one correspondence between the tilting objects of the cluster category and the clusters of the associated cluster algebra. This correspondence enables us to solve conjectures on cluster algebras.…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their…
We define mutation on coloured quivers associated to tilting objects in higher cluster categories. We show that this operation is compatible with the mutation operation on the tilting objects. This gives a combinatorial approach to tilting…
We study the cluster category of a canonical algebra A in terms of the hereditary category of coherent sheaves over the corresponding weighted projective line X. As an application we determine the automorphism group of the cluster category…
We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
In previous two papers, we defined fractional Brauer configuration algebras and developed their covering theory. In this paper, we study the representation theory of fractional Brauer graph algebras of type MS, a special class of fractional…