English
Related papers

Related papers: Posets from Admissible Coxeter Sequences

200 papers

We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…

Combinatorics · Mathematics 2026-05-13 Sergey Fomin , Nathan Reading

Resolving a conjecture of F\"uredi from 1988, we prove that with high probability, the random graph $G(n,1/2)$ admits a friendly bisection of its vertex set, i.e., a partition of its vertex set into two parts whose sizes differ by at most…

Combinatorics · Mathematics 2021-06-09 Asaf Ferber , Matthew Kwan , Bhargav Narayanan , Ashwin Sah , Mehtaab Sawhney

Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…

Let $P$ be a finite poset and $L$ the associated distributive lattice of order ideals of $P$. Let $\rho$ denote the rowmotion bijection of the order ideals of $P$ viewed as a permutation matrix and $C$ the Coxeter matrix for the incidence…

Representation Theory · Mathematics 2024-09-04 René Marczinzik , Hugh Thomas , Emine Yıldırım

We define a new class of countable groups, which are defined by its action on the set of monotonic numberings (diagrams) of an arbitrary finite or countable partial ordered set (poset). These groups are generated by the set of involutions?…

Combinatorics · Mathematics 2021-11-17 Anatoly Vershik

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

Group Theory · Mathematics 2020-06-23 Daniele Garzoni

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

Representation Theory · Mathematics 2019-02-27 Vyacheslav Futorny , Kostiantyn Iusenko

Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…

Methodology · Statistics 2015-03-19 Nanny Wermuth , Kayvan Sadeghi

What remains of a geometrical notion like that of a principal bundle when the base space is not a manifold but a coarse graining of it, like the poset formed by a base for the topology ordered under inclusion? Motivated by finding a…

Algebraic Topology · Mathematics 2012-08-22 John E. Roberts , Giuseppe Ruzzi

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…

Combinatorics · Mathematics 2019-05-06 Will Grilliette , Lucas J. Rusnak

We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…

Data Structures and Algorithms · Computer Science 2019-04-29 Samuel Haney , Mehraneh Liaee , Bruce M. Maggs , Debmalya Panigrahi , Rajmohan Rajaraman , Ravi Sundaram

The statement in the title was proved in \cite{Cao23} by introducing dominant sets of seeds, which are analogs of torsion classes in representation theory. In this note, we observe a short proof by the existence of consistent cluster…

Representation Theory · Mathematics 2025-04-15 Shuhao Deng , Changjian Fu

We study the problem of finding an acyclic orientation of an undirected graph with constrained in-degree parities specified by a subset T of vertices. An orientation is called T -odd if a vertex v has odd in-degree if and only if v P T .…

Discrete Mathematics · Computer Science 2026-03-11 Sylvain Gravier , Matthieu Petiteau , Isabelle Sivignon

For a graph $G$, and a nonnegative integer $g$, let $a_g(G)$ be the number of $2$-cell embeddings of $G$ in an orientable surface of genus $g$ (counted up to the combinatorial homeomorphism equivalence). In 1989, Gross, Robbins, and Tucker…

Combinatorics · Mathematics 2025-12-30 Bojan Mohar

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

Combinatorics · Mathematics 2009-09-29 Olivier Guibert , Sylvain Pelat-Alloin

We show that hypernetworks can be regarded as posets which, in their turn, have a natural interpretation as simplicial complexes and, as such, are endowed with an intrinsic notion of curvature, namely the Forman Ricci curvature, that…

Algebraic Topology · Mathematics 2021-01-19 Emil Saucan

We show that the class of $\mathcal{C}$-hereditarily conjugacy separable groups is closed under taking arbitrary graph products whenever the class $\mathcal{C}$ is an extension closed variety of finite groups. As a consequence we show that…

Group Theory · Mathematics 2016-10-13 Michal Ferov

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

Combinatorics · Mathematics 2025-06-30 Jan Kristian Haugland

In this article we develop intersection theory in terms of the $\mathcal{B}$-group of a reduced analytic space. This group was introduced in a previous work as an analogue of the Chow group; it is generated by currents that are direct…

Algebraic Geometry · Mathematics 2019-09-02 Mats Andersson , Dennis Eriksson , Håkan Samuelsson Kalm , Elizabeth Wulcan , Alain Yger

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…

Combinatorics · Mathematics 2024-03-15 Jagdeep Singh , Vaidy Sivaraman