English
Related papers

Related papers: Linear extensions and order-preserving poset parti…

200 papers

The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…

Combinatorics · Mathematics 2019-12-19 Wenjie Fang

The lattice of intersections of reflecting hyperplanes of a complex reflection group W may be considered as the poset of 1-eigenspaces of the elements of W. In this paper we replace 1 with an arbitrary eigenvalue and study the topology and…

Combinatorics · Mathematics 2012-08-10 Alexander R. Miller

Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…

Combinatorics · Mathematics 2020-01-14 I. A. Bochkov , F. V. Petrov

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

For a poset P, a subposet A, and an order preserving map F from A into the real numbers, the marked order polytope parametrizes the order preserving extensions of F to P. We show that the function counting integral-valued extensions is a…

Combinatorics · Mathematics 2014-07-21 Katharina Jochemko , Raman Sanyal

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

Rings and Algebras · Mathematics 2013-10-01 G. Grätzer

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Combinatorics · Mathematics 2025-07-10 Galen Dorpalen-Barry , Dan Dugger , Nicholas Proudfoot

From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…

Combinatorics · Mathematics 2021-01-26 Christin Bibby , Nir Gadish

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

Combinatorics · Mathematics 2021-03-05 Shane Kepley , Konstantin Mischaikow , Lun Zhang

We study the poset topology of lattices arising from orientations of 1-skeleta of directionally simple polytopes, with Bruhat interval polytopes $Q_{e,w}$ as our main example. We show that the order complex $\Delta ((u,v)_w)$ of an interval…

Combinatorics · Mathematics 2026-03-02 Christian Gaetz , Patricia Hersh

We prove that the complex of proper non-trivial non-degenerate subspaces of a finite-dimensional vector space endowed with a non-degenerate sesquilinear form is homotopy equivalent to a wedge of spheres. Additionally, we show that the same…

Combinatorics · Mathematics 2015-03-27 Alice Devillers , Ralf Köhl , Bernhard Muhlherr

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

Combinatorics · Mathematics 2017-12-05 Xin Fang , Ghislain Fourier , Jan-Philipp Litza , Christoph Pegel

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

Classical Analysis and ODEs · Mathematics 2018-03-08 José Ginés Espín Buendía , Víctor Jiménez López

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Combinatorics · Mathematics 2025-12-16 Amrita Acharyya

For each integer n\ge 2, we construct an irreducible, smooth, complex projective variety M of dimension n, whose fundamental group has infinitely generated homology in degree n+1 and whose universal cover is a Stein manifold, homotopy…

Algebraic Geometry · Mathematics 2009-07-02 Alexandru Dimca , Stefan Papadima , Alexander I. Suciu

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

Combinatorics · Mathematics 2025-08-20 Nicholas J. Williams

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

Group Theory · Mathematics 2011-10-21 Annette Pilkington

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…

Combinatorics · Mathematics 2023-08-10 Patricia Hersh