scholarly journals Sortable Simplicial Complexes and $t$-Independence Ideals of Proper Interval Graphs

10.37236/8860 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Jürgen Herzog ◽  
Fahimeh Khosh-Ahang ◽  
Somayeh Moradi ◽  
Masoomeh Rahimbeigi
Keyword(s):  
Positive Integer ◽  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Interval Graph ◽  
Interval Graphs ◽  
Persistence Property ◽  
Proper Interval Graph ◽  
Independence Complex ◽  
Linear Quotients ◽  
The Ideal

We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the graphs whose independence complex is sortable. By using this characterization, we show that the ideal generated by all squarefree monomials corresponding to independent sets of vertices of $G$ of size $t$ (for a given positive integer $t$) has the strong persistence property, when $G$ is a proper interval graph. Moreover, all of its powers have linear quotients.

scholarly journals Simplicial Complexes of Whisker Type

10.37236/4894 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Mina Bigdeli ◽  
Jürgen Herzog ◽  
Takayuki Hibi ◽  
Antonio Macchia
Keyword(s):  
Simplicial Complex ◽  
Short Proof ◽  
Monomial Ideal ◽  
Simplicial Complexes ◽  
Linear Resolution ◽  
Cw Complex ◽  
Alexander Dual ◽  
Vertex Decomposable ◽  
The Ideal

Let $I\subset K[x_1,\ldots,x_n]$ be  a zero-dimensional monomial ideal, and $\Delta(I)$ be the simplicial complex whose Stanley--Reisner ideal is the polarization of $I$. It follows from a result of Soleyman Jahan that $\Delta(I)$ is shellable. We give a new short proof of this fact by providing an explicit shelling. Moreover, we show that  $\Delta(I)$ is even vertex decomposable. The ideal $L(I)$, which is defined to be the Stanley--Reisner ideal of the Alexander dual of $\Delta(I)$, has a linear resolution which is cellular and supported on a regular CW-complex. All powers of $L(I)$ have a linear resolution. We compute $\mathrm{depth}\ L(I)^k$ and show that $\mathrm{depth}\ L(I)^k=n$ for all $k\geq n$.

scholarly journals Closed graphs are proper interval graphs

2014 ◽  
Vol 22 (3) ◽  
pp. 37-44
Author(s):  
Marilena Crupi ◽  
Giancarlo Rinaldo
Keyword(s):  
Linear Time ◽  
Interval Graph ◽  
Simple Graph ◽  
Interval Graphs ◽  
Closed Graph ◽  
Graph Recognition ◽  
Proper Interval Graph ◽  
Linear Time Algorithms

Abstract Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

scholarly journals Minimum 2-Tuple Dominating Set of an Interval Graph

2011 ◽  
Vol 2011 ◽  
pp. 1-14 ◽  
Author(s):  
Tarasankar Pramanik ◽  
Sukumar Mondal ◽  
Madhumangal Pal
Keyword(s):  
Positive Integer ◽  
Dominating Set ◽  
Interval Graph ◽  
Interval Graphs ◽  
Point Of View ◽  
Minimum Size ◽  
Domination Problem ◽  
Fixed Positive Integer ◽  
Double Domination

The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k=2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes O(n2) time, n is the total number of vertices of the interval graph.

Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes

10.37236/1245 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Art M. Duval
Keyword(s):  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Pure Case ◽  
Definition Of ◽  
Algebraic Shifting

Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the $h$-triangle, a doubly-indexed generalization of the $h$-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generalize the Cohen-Macaulay conditions for pure complexes, so that a nonpure shellable complex is sequentially Cohen-Macaulay. We show that algebraic shifting preserves the $h$-triangle of a simplicial complex $K$ if and only if $K$ is sequentially Cohen-Macaulay. This generalizes a result of Kalai's for the pure case. Immediate consequences include that nonpure shellable complexes and sequentially Cohen-Macaulay complexes have the same set of possible $h$-triangles.

scholarly journals Optimal Decision Trees on Simplicial Complexes

10.37236/1900 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Jakob Jonsson
Keyword(s):  
Decision Tree ◽  
Decision Trees ◽  
Simplicial Complex ◽  
Elementary Theory ◽  
Simplicial Complexes ◽  
Optimal Decision ◽  
Property A ◽  
Recursive Definition ◽  
Topological Combinatorics ◽  
Definition Of

We consider topological aspects of decision trees on simplicial complexes, concentrating on how to use decision trees as a tool in topological combinatorics. By Robin Forman's discrete Morse theory, the number of evasive faces of a given dimension $i$ with respect to a decision tree on a simplicial complex is greater than or equal to the $i$th reduced Betti number (over any field) of the complex. Under certain favorable circumstances, a simplicial complex admits an "optimal" decision tree such that equality holds for each $i$; we may hence read off the homology directly from the tree. We provide a recursive definition of the class of semi-nonevasive simplicial complexes with this property. A certain generalization turns out to yield the class of semi-collapsible simplicial complexes that admit an optimal discrete Morse function in the analogous sense. In addition, we develop some elementary theory about semi-nonevasive and semi-collapsible complexes. Finally, we provide explicit optimal decision trees for several well-known simplicial complexes.

scholarly journals Anti-integral extensions $ {R[{\alpha}]/R$

2004 ◽  
Vol 35 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Kiyoshi Baba ◽  
Ken-Ichi Yoshida
Keyword(s):  
Positive Integer ◽  
Integral Domain ◽  
Arbitrary Positive Integer ◽  
Integral Element ◽  
The Ideal

Let $ R $ be an integral domain and $ \alpha $ an anti-integral element of degree $ d $ over $ R $. In the paper [3] we give a condition for $ \alpha^2-a$ to be a unit of $ R[\alpha] $. In this paper we will generalize the result to an arbitrary positive integer $n$ and give a condition, in terms of the ideal $ I_{[\alpha]}^{n}D(\sqrt[n]{a}) $ of $ R $, for $ \alpha^{n}-a$ to be a unit of $ R[\alpha] $.

Spectral gap of a weighted 3-simplicial complex

2021 ◽  
pp. 2150084
Author(s):  
Khalid Hatim ◽  
Azeddine Baalal
Keyword(s):  
Lower Bound ◽  
Simplicial Complex ◽  
Upper Bound ◽  
Spectral Gap ◽  
Simplicial Complexes ◽  
Cheeger Constant ◽  
Nonzero Eigenvalue ◽  
New Framework

In this paper, we construct a new framework that’s we call the weighted [Formula: see text]-simplicial complex and we define its spectral gap. An upper bound for our spectral gap is given by generalizing the Cheeger constant. The lower bound for our spectral gap is obtained from the first nonzero eigenvalue of the Laplacian acting on the functions of certain weighted [Formula: see text]-simplicial complexes.

Subdivisions of Simplicial Complexes Preserving the Metric Topology

2012 ◽  
Vol 55 (1) ◽  
pp. 157-163 ◽  
Author(s):  
Kotaro Mine ◽  
Katsuro Sakai
Keyword(s):  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Simplicial Subdivision ◽  
Metric Topology ◽  
The One

AbstractLet |K| be the metric polyhedron of a simplicial complex K. In this paper, we characterize a simplicial subdivision K′ of K preserving the metric topology for |K| as the one such that the set K′(0) of vertices of K′ is discrete in |K|. We also prove that two such subdivisions of K have such a common subdivision.

On ideals preserving generalized local cohomology modules

2015 ◽  
Vol 15 (01) ◽  
pp. 1650019 ◽  
Author(s):  
Tsutomu Nakamura
Keyword(s):  
Positive Integer ◽  
Noetherian Ring ◽  
Local Cohomology ◽  
Finitely Generated ◽  
Commutative Noetherian Ring ◽  
Local Cohomology Modules ◽  
Generalized Local Cohomology Modules ◽  
Cohomology Modules ◽  
The Ideal

Let R be a commutative Noetherian ring, 𝔞 an ideal of R and M, N two finitely generated R-modules. Let t be a positive integer or ∞. We denote by Ωt the set of ideals 𝔠 such that [Formula: see text] for all i < t. First, we show that there exists the ideal 𝔟t which is the largest in Ωt and [Formula: see text]. Next, we prove that if 𝔡 is an ideal such that 𝔞 ⊆ 𝔡 ⊆ 𝔟t, then [Formula: see text] for all i < t.

A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS

2013 ◽  
Vol 24 (01) ◽  
pp. 109-122
Author(s):  
MARTIN R. EHMSEN ◽  
KIM S. LARSEN
Keyword(s):  
Real Life ◽  
Computation Time ◽  
Interval Graph ◽  
Interval Graphs ◽  
Exhaustive Search ◽  
Hard Problem ◽  
Proper Coloring ◽  
Exact Computation ◽  
New Approach ◽  
Reasonable Time

Inspired by a real-life application, we investigate the computationally hard problem of extending a precoloring of an interval graph to a proper coloring under some bound on the number of available colors. We are interested in quickly determining whether or not such an extension exists on instances occurring in practice in connection with campsite bookings on a campground. A naive exhaustive search does not terminate in reasonable time. We have formulated a new approach which moves the computation time within the usable range on all the data samples available to us.

Sign in / Sign up

Export Citation Format

Share Document