Related papers: Ordered Exchange Graphs
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…
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order type of S. We introduce the concept of exit edges, which…
Given a finite dimensional algebra $C$ (over an algebraically closed field) of global dimension at most two, we define its relation-extension algebra to be the trivial extension $C\ltimes \Ext_C^2(DC,C)$ of $C$ by the $C$-$C$-bimodule…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
Inspired by the ideas and techniques used in the study of cluster algebras we construct a new class of algebras, called bistellar cluster algebras, from closed oriented triangulated even-dimensional manifolds by performing…
De Finetti's classical result of [18] identifying the law of an exchangeable family of random variables as a mixture of i.i.d. laws was extended to structure theorems for more complex notions of exchangeability by Aldous [1,2,3], Hoover…
We study the representation theory of three towers of algebras which are related to the symmetric groups and their Hecke algebras. The first one is constructed as the algebras generated simultaneously by the elementary transpositions and…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
The main result of this paper shows that, over large enough fields of characteristic different from $2$, the alternating Hecke algebras are $\mathbb{Z}$-graded algebras that are isomorphic to fixed-point subalgebras of the quiver Hecke…
In exchange processes clusters composed of elementary building blocks, monomers, undergo binary exchange in which a monomer is transferred from one cluster to another. In assortative exchange only clusters with comparable masses participate…
The Temperley-Lieb and Brauer algebras and their cyclotomic analogues, as well as the partition algebra, are all examples of twisted semigroup algebras. We prove a general theorem about the cellularity of twisted semigroup algebras of…
We discuss general models of resource-sharing computations, with emphasis on the combinatorial structures and concepts that underlie the various deadlock models that have been proposed, the design of algorithms and deadlock-handling…
We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph…
Commuting involution graphs have been studied for finite Coxeter groups and for affine groups of classical type. The purpose of this short note is to establish some general results for commuting involution graphs in affine Coxeter groups,…
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…
We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
These notes loosely follow an introductory course on graph complexes, held at Humboldt-Universit\"at zu Berlin in summer 23. Instead of simply typing up my lecture notes I decided to give here an overview over (parts of) the topic (lecture…
We demonstrate that a large class of one-dimensional quantum and classical exchange models can be described by the same type of graphs, namely Cayley graphs of the permutation group. Their well-studied spectral properties allow us to derive…
A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…