English
Related papers

Related papers: Posets from Admissible Coxeter Sequences

200 papers

In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group.…

Combinatorics · Mathematics 2008-08-21 Matthew Macauley , Henning S. Mortveit

The cyclic and dihedral groups can be made to act on the set Acyc(Y) of acyclic orientations of an undirected graph Y, and this gives rise to the equivalence relations ~kappa and ~delta, respectively. These two actions and their…

Combinatorics · Mathematics 2008-02-29 Matthew Macauley , Henning S. Mortveit

Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in…

Combinatorics · Mathematics 2011-01-11 A. Krzysztof Kwasniewski , M. Dziemianczuk

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.

Combinatorics · Mathematics 2022-10-07 Richard Ehrenborg , MLE Slone

We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…

Representation Theory · Mathematics 2021-01-20 Florian Eisele

Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Stefan Forcey , Stephen Reisdorf , Patrick Showers

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

Combinatorics · Mathematics 2007-05-23 Eric Mwambene

We prove that two angle-compatible Coxeter generating sets of a given finitely generated Coxeter group are conjugate provided one of them does not admit any elementary twist. This confirms a basic case of a general conjecture which…

Group Theory · Mathematics 2014-11-11 Pierre-Emmanuel Caprace , Piotr Przytycki

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…

Representation Theory · Mathematics 2007-05-23 Ron M. Adin , Francesco Brenti , Yuval Roichman

Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…

Combinatorics · Mathematics 2016-01-05 Valentin Féray

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

Group Theory · Mathematics 2024-03-20 P. J. Cameron , F. E. Jannat , R. K. Nath , R. Sharafdini

Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…

Quantum Algebra · Mathematics 2007-05-23 Michael Carr , Satyan L. Devadoss

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

Combinatorics · Mathematics 2016-11-10 Steven Schluchter

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…

Combinatorics · Mathematics 2015-05-18 Matthew Macauley

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

Category Theory · Mathematics 2011-05-11 Pierre Gillibert , Friedrich Wehrung

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

Representation Theory · Mathematics 2023-12-11 Hongsheng Hu

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

Combinatorics · Mathematics 2024-06-13 Sally Cockburn , Yonghyun Song

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev

In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…

Group Theory · Mathematics 2015-02-18 Marius Tarnauceanu
‹ Prev 1 2 3 10 Next ›