English
Related papers

Related papers: Edgewise Cohen-Macaulay connectivity of partially …

200 papers

The classes of sequentially Cohen-Macaulay and sequentially homotopy Cohen-Macaulay complexes and posets are studied. First, some different versions of the definitions are discussed and the homotopy type is determined. Second, it is shown…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Michelle Wachs , Volkmar Welker

We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…

Combinatorics · Mathematics 2010-03-31 Nantel Bergeron , Christophe Hohlweg , Mike Zabrocki

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Mobius functions and rank-selected subposets of such lattices, rank-selected geometric…

Combinatorics · Mathematics 2007-05-23 Jay Schweig

The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…

Commutative Algebra · Mathematics 2022-01-04 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

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…

Commutative Algebra · Mathematics 2018-03-22 Rajiv Kumar , Ajay Kumar

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

Combinatorics · Mathematics 2017-03-06 Karim A. Adiprasito , Anders Björner , Afshin Goodarzi

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…

Combinatorics · Mathematics 2011-04-13 Myrto Kallipoliti , Martina Kubitzke

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Combinatorics · Mathematics 2025-08-26 Frédéric Chapoton

In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…

Optimization and Control · Mathematics 2022-12-29 Phan Thanh An , Nguyen Thi Le

We show that the complex of partial bases of the free group of rank $n$, where vertices are seen up to conjugation, is Cohen--Macaulay of dimension $n-1$. This positively answers a conjecture raised by Day and Putman. We prove our results…

Geometric Topology · Mathematics 2025-09-26 Benjamin Brück , Kevin Ivan Piterman

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes

We prove a theorem allowing us to find convex-ear decompositions for rank-selected subposets of posets that are unions of Boolean sublattices in a coherent fashion. We then apply this theorem to geometric lattices and face posets of…

Combinatorics · Mathematics 2010-06-15 Jay Schweig

We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of…

Commutative Algebra · Mathematics 2020-03-30 Seyed Amin Seyed Fakhari , Kosuke Shibata , Naoki Terai , Siamak Yassemi

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Combinatorics · Mathematics 2023-01-03 Christos A. Athanasiadis , Katerina Kalampogia-Evangelinou

In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…

General Mathematics · Mathematics 2023-07-03 Omprakash Atale

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Metric Geometry · Mathematics 2017-03-23 Vera Roshchina , Tian Sang , David Yost

Given a finite quiver (directed graph) without loops and multiedges, the convex hull of the column vector of the incidence matrix is called the directed edge polytope and is an interesting example of lattice polytopes. In this paper, we…

Combinatorics · Mathematics 2022-03-29 Yasuhide Numata , Yusuke Takahashi , Dai Tamaki

It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…

Group Theory · Mathematics 2011-01-27 Russ Woodroofe

We show that if a $d$-dimensional Cohen-Macaulay complex is, in a certain sense, sufficiently "close" to being balanced, then there is a $d$-dimensional balanced Cohen-Macaulay complex having the same $f$-vector. This in turn provides some…

Combinatorics · Mathematics 2010-10-13 Jonathan Browder

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein
‹ Prev 1 2 3 10 Next ›