Related papers: Equivalences on Acyclic Orientations
This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…
We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…
Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…
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…
We expand the structural theory of \ca graphs that avoid specific cyclic coset patterns. We present several characterisations of tree-likeness for these structures and show a close connection to $\alpha$-acyclic hypergraphs. A focus lies on…
In a coupled network cells can interact in several ways. There is a vast literature from the last twenty years that investigates this interacting dynamics under a graph theory formalism, namely as a graph endowed with an input-equivalence…
In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.
A transformation is obtained which completes the unification of quadrirational Yang-Baxter maps and known integrable multi-quadratic quad equations. By combining theory from these two classes of quad-graph models we find an extension of the…
We introduce and study certain topological spaces associated with connected rooted graphs. These spaces reflect combinatorial and order theoretic properties of the underlying graph and relate in the case of hyperbolic graphs to Gromov's…
The competition graph of a directed acyclic graph D is the undirected graph on the same vertex set as D in which two distinct vertices are adjacent if they have a common out-neighbor in D. The competition number of an undirected graph G is…
In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for $\alpha$ fixed, maps $f_c$ which have the following form (in polar coordinates):…
We show that shift equivalence of essential adjacency matrices coincides with gauge-equivariant homotopy equivalence of their stabilized graph C*-algebras. This provide the first equivalent formulation of shift equivalence of essential…
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
We study the categorical homology of Zappa-Sz\'ep products of small categories, which include all self-similar actions. We prove that the categorical homology coincides with the homology of a double complex, and so can be computed via a…
The prime coprime graph $\Theta(G)$ of a finite group $G$ is the graph whose vertex set is $G$ and any two distinct vertices are adjacent if the greatest common divisor of their orders is either $1$ or a prime. In this paper, we investigate…
In this paper, we study properties of asymptotic resemblance relations induced by compatible coarse structures on groups. We generalize the notion of asymptotic dimensiongrad for groups with compatible coarse structures and show this notion…
This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…
The set of acyclic orientations of a connected graph with a given sink has a natural poset structure. We give a geometric proof of a result of Jim Propp: this poset is the disjoint union of distributive lattices.
In 2010, M. Studen\'y, R. Hemmecke, and S. Linder explored a new algebraic description of graphical models, called characteristic imsets. Compare with standard imsets, characteristic imsets have several advantages: they are still unique…
Let $X$ and $Y$ be two graphs with vertex set $[n]$. Their friends-and-strangers graph $\mathsf{FS}(X,Y)$ is a graph with vertices corresponding to elements of the group $S_n$, and two permutations $\sigma$ and $\sigma'$ are adjacent if…