English
Related papers

Related papers: Shellability of the higher pinched Veronese posets

200 papers

In this short note, we show that one cannot differentiate between reciprocal Dunford--Pettis sets and V$^*$-sets in a Banach lattice. That is, for a bounded subset $K$ of a Banach lattice $E$, $K$ is a V$^*$-set if and only if $K$ is a…

Functional Analysis · Mathematics 2024-06-17 Jin Xi Chen , Xi Li

Given a countable set of points in a continuous space, Voronoi tessellation is an intuitive way of partitioning the space according to the distance to the individual points. As a powerful approach to obtain structural information, it has a…

Soft Condensed Matter · Physics 2020-02-17 Simeon Völkel , Kai Huang

This paper deals with syzygies of the ideals of the Veronese embeddings. We prove that O(3) on P^n satisfies Property N_4 for every n. Besides we prove that O(d) on P^n satisfies N_p for all n >= p iff O(d) on P^p satisfies N_p.

Algebraic Geometry · Mathematics 2007-05-23 Elena Rubei

A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a…

Combinatorics · Mathematics 2010-09-23 Bridget Eileen Tenner

Given a point-line geometry P and a pappian projective space S,a veronesean embedding of P in S is an injective map e from the point-set of P to the set of points of S mapping the lines of P onto non-singular conics of S and such that e(P)…

Representation Theory · Mathematics 2013-03-25 Ilaria Cardinali , Antonio Pasini

The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…

Combinatorics · Mathematics 2018-10-04 Vladimir A. Shlyk

We study the limit in low intensity of Poisson--Voronoi tessellations in hyperbolic spaces $ \mathbb{H}_{d}$ for $d \geq 2$. In contrast to the Euclidean setting, a limiting nontrivial ideal tessellation $ \mathcal{V}_{d}$ appears as the…

Probability · Mathematics 2025-06-11 Matteo D'Achille , Nicolas Curien , Nathanaël Enriquez , Russell Lyons , Meltem Ünel

We consider the minimum number of lines $h_n$ and $p_n$ needed to intersect or pierce, respectively, all the cells of the $n \times n$ chessboard. Determining these values can also be interpreted as a strengthening of the classical plank…

Combinatorics · Mathematics 2023-07-31 Gergely Ambrus , Imre Bárány , Péter Frankl , Dániel Varga

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we…

Combinatorics · Mathematics 2014-04-21 Bruno Benedetti , Frank H. Lutz

The width of a poset is the size of its largest antichain. Sperner's theorem states that $(2^{[n]},\subset)$ is a poset whose width equals the size of its largest layer. We show that Hamming ball posets also have this property. This extends…

Combinatorics · Mathematics 2024-11-05 Kada Williams

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

Combinatorics · Mathematics 2024-10-29 Paolo Sentinelli

Pinched Veronese rings are formed by removing an algebra generator from a Veronese subring of a polynomial ring. We study the homological properties of such rings, including the Cohen-Macaulay, Gorenstein, and complete intersection…

Commutative Algebra · Mathematics 2024-06-12 Kyle Maddox , Vaibhav Pandey

Given a poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is said to be $\mathcal{P}$-saturated if $\mathcal{F}$ does not contain an induced copy $\mathcal P$, but every proper superset of $\mathcal{F}$ contains…

Combinatorics · Mathematics 2025-07-22 James Brownlie , Sean Jaffe

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

Combinatorics · Mathematics 2018-10-02 A. Skopenkov

Let $K$ be a field and $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$. Let $\Delta$ be a simplicial complex on $n$ vertices and $I=I_{\Delta}$ be its Stanley-Reisner ideal. In this paper, we show that if $I$…

Commutative Algebra · Mathematics 2024-10-30 Amir Mafi , Dler Naderi , Hero Saremi

We investigate the existence of sufficient local conditions under which poset representations decompose as direct sums of indecomposables from a given class. In our work, the indexing poset is the product of two totally ordered sets,…

Representation Theory · Mathematics 2022-12-13 Magnus Bakke Botnan , Vadim Lebovici , Steve Oudot

In 2007, Vallette built a bridge across posets and operads by proving that an operad is Koszul if and only if the associated partition posets are Cohen-Macaulay. Both notions of being Koszul and being Cohen-Macaulay admit different…

Algebraic Topology · Mathematics 2023-06-13 Joan Bellier-Millès , Bérénice Delcroix-Oger , Eric Hoffbeck

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…

Combinatorics · Mathematics 2014-06-10 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim