Related papers: Posets from Admissible Coxeter Sequences

With any locally finite partially ordered set $K$ its incidence algebra $\Omega(K)$ is associated. We shall consider algebras over fields with characteristic zero. In this case there is a correspondence $K \leftrightarrow \Omega(K)$ such…

Applying a classical theorem of Smith, we show that the poset property of being Gorenstein$^*$ over $\mathbb{Z}_2$ is inherited by the subposet of fixed points under an involutive poset automorphism. As an application, we prove that every…

The usual combinatorial model for the 0-Hecke algebra of the symmetric group is to consider the algebra (or monoid) generated by the bubble sort operators. This construction generalizes to any finite Coxeter group W. The authors previously…

Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, we define a graph $\mathsf{FS}(X,Y)$ whose vertex set consists of all bijections $\sigma:V(X)\to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are…

Given a Coxeter system (W,S) equipped with an involutive automorphism T, the set of twisted identities is i(T) = {T(w)^{-1}w : w \in W}. We point out how i(T) shows up in several contexts and prove that if there is no s \in S such that…

We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…

A simplicial cochain complex can be derived from a locally small poset by taking the nerve of the poset viewed as a category. We show that the simplicial cochain complex and a relative Hochschild cochain complex of the incidence algebra of…

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…

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

We determine a family of functors from a poset to abelian groups such that the higher direct limits vanish on them. This is done by first characterizing the projective functors. Then a spectral sequence arising from the grading of the poset…

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…

Results are obtained concerning the roots of asymmetric geometric representations of Coxeter groups. These representations were independently introduced by Vinberg and Eriksson, and generalize the standard geometric representation of a…

We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…

For fixed positive integers $n$ and $k$, the Kneser graph $KG_{n,k}$ has vertices labeled by $k$-element subsets of $\{1,2,\dots,n\}$ and edges between disjoint sets. Keeping $k$ fixed and allowing $n$ to grow, one obtains a family of…

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

The Cohen-Macaulay property of a graph arising from a poset has been studied by various authors. In this article, we study the Cohen-Macaulay property of a graph arising from a family of reflexive and antisymmetric relations on a set. We…

Motivated by various developments in algebraic combinatorics and its applications, we investigate here the fine structure of a fundamental but little known theorem, the Gerstenhaber and Schack cohomology comparison theorem.The theorem…

Say that an edge of a graph G dominates itself and every other edge adjacent to it. An edge dominating set of a graph G = (V,E) is a subset of edges E' of E which dominates all edges of G. In particular, if every edge of G is dominated by…