New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and...
Main Authors: | Mohammad Farrokhi D. G., Ali Akbar Yazdan Pour |
---|---|
Format: | Article |
Language: | fas |
Published: |
Kharazmi University
2022-12-01
|
Series: | پژوهشهای ریاضی |
Subjects: | |
Online Access: | http://mmr.khu.ac.ir/article-1-3171-en.html |
Similar Items
-
A new construction for vertex decomposable graphs
by: Nasser Hajisharifi, et al.
Published: (2016-09-01) -
A NOTE ON BALANCED BIG COHEN–MACAULAY MODULES
by: Abdol N. Bahlekeh
Published: (2021-01-01) -
Cohen Macaulayness and Arithmetical Rank of Generalized Theta Graphs
by: Seyyede Masoome Seyyedi, et al.
Published: (2016-06-01) -
EL-Shellability of Generalized Noncrossing Partitions
by: Henri Mühle
Published: (2012-01-01) -
MODELING OF BISTATIC RADAR CLUTTER
by: Marek Pola, et al.
Published: (2012-07-01)