中文
相关论文

相关论文: Shellable complexes and topology of diagonal arran…

200 篇论文

Let $A$ be either a simplicial complex $K$ or a small category $\mathcal C$ with $V(A)$ as its set of vertices or objects. We define a twisted structure on $A$ with coefficients in a simplicial group $G$ as a function $$ \delta\colon…

代数拓扑 · 数学 2015-09-23 J. Y. Li , V. V. Vershinin , J. Wu

Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…

代数拓扑 · 数学 2021-02-16 Jesús González , Teresa I. Hoekstra-Mendoza

Given a space $X$ and a simplicial complex $K$ with $m$-vertices, the arrangement of partially diagonal subspaces of $X^m$, called the dragonal arrangement, is defined. We decompose the suspension of the diagonal arrangement when $2(dim K +…

代数拓扑 · 数学 2014-04-01 Daisuke Kishimoto , Kouyemon Iriye

We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable)…

代数拓扑 · 数学 2021-01-25 Nermin Salepci , Jean-Yves Welschinger

In this article, we introduce the notion of a wedge of graphs and provide detailed computations for the independence complex of a wedge of path and cycle graphs. In particular, we show that these complexes are either contractible or wedges…

组合数学 · 数学 2023-03-20 Navnath Daundkar , Saikat Panja , Sachchidanand Prasad

We prove that any arithmetic locally symmetric space is homotopy equivalent to a simplicial complex where the number of simplices is bounded linearly in the volume of the space. This settles a well-known conjecture of Gelander. The main…

数论 · 数学 2026-02-03 Mikołaj Frączyk , Sebastian Hurtado , Jean Raimbault

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…

组合数学 · 数学 2024-11-08 Margaret Bayer , Marija Jelić Milutinović , Julianne Vega

We disprove a long-standing open conjecture due to Simon stating that all skeleta of simplices are extendably shellable. In particular, for every $d \geq 3$ we provide a pure $d$-dimensional shellable simplicial complex which is not…

组合数学 · 数学 2026-05-26 Davide Bolognini , Paolo Sentinelli

Two related constructions are studied: (1) The diagonal complex $\mathcal{D}$ and its barycentric subdivision $\mathcal{BD}$ related to a \textit{punctured} oriented surface $F$ equipped with a number of labeled marked points. (2) The…

几何拓扑 · 数学 2020-11-05 Joseph Gordon , Gaiane Panina

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

交换代数 · 数学 2013-03-15 Rashid Zaare-Nahandi

A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…

代数拓扑 · 数学 2010-11-22 Xiangjun Wang , Qibing Zheng

We consider families of simple polytopes $P$ and simplicial complexes $K$ well-known in polytope theory and convex geometry, and show that their moment-angle complexes have some remarkable homotopy properties which depend on combinatorics…

代数拓扑 · 数学 2020-11-24 Ivan Limonchenko

The independence complex of a graph is a simplicial complex whose faces correspond to the independent sets of $G$. While independence complexes have been studied extensively for many graph classes, including square grid graphs, relatively…

组合数学 · 数学 2025-12-25 Himanshu Chandrakar , Anurag Singh

We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…

代数拓扑 · 数学 2019-05-07 Amit Kumar Paul

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

组合数学 · 数学 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

Given a polytopal complex $X$, we examine the topological complement of its $k$-skeleton. We construct a long exact sequence relating the homologies of the skeleton complements and links of faces in $X$, and using this long exact sequence,…

组合数学 · 数学 2022-09-20 Rowan Rowlands

We study the tropicalization of the variety of symmetric rank two matrices. Analogously to the result of Markwig and Yu for general tropical rank two matrices, we show that it has a simplicial complex structure as the space of symmetric…

组合数学 · 数学 2025-04-21 May Cai , Kisun Lee , Josephine Yu

The reader of doi:10.1016/j.topol.2010.08.006 might conjecture that \Delta(\bar{\Pi}_n)/G is homotopy equivalent to a wedge of spheres for any n>=3 and any subgroup G<S_n. We disprove this by showing that \Delta(\bar{\Pi}_p)/C_p is not…

代数拓扑 · 数学 2012-06-22 Ralf Donau

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

几何拓扑 · 数学 2018-11-14 Joseph Gordon , Gaiane Panina