English
Related papers

Related papers: Quasi-forest simplicial complexes and almost Cohen…

200 papers

In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…

Commutative Algebra · Mathematics 2021-12-21 Amir Mafi , Dler Naderi

Via the BGG-correspondence a simplicial complex D on [n] is transformed into a complex of coherent sheaves L(D) on the projective space n-1-space. In general we compute the support of each of its cohomology sheaves. When the Alexander dual…

Combinatorics · Mathematics 2007-05-23 Gunnar Floystad

We introduce and investigate the open neighborhood ideal $\mathcal{N}(G)$ of a finite simple graph $G$. We describe the minimal primary decomposition of $\mathcal{N}(G)$ in terms of the minimal total dominating sets (TDSs) of $G$. Then we…

Commutative Algebra · Mathematics 2026-02-17 Jounglag Lim , James Gossell , Keri Ann Sather-Wagstaff

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…

Combinatorics · Mathematics 2011-10-05 Art M. Duval , Caroline J. Klivans , Jeremy L. Martin

We prove that for any positive integers $k$ and $d$, if a graph $G$ has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests $C_{1},\ldots,C_{k+1}$ such that there is an $i$ such that for…

Combinatorics · Mathematics 2020-07-07 Logan Grout , Benjamin Moore

In the simplicial theory of hypercoverings, we replace the indexing category $\Delta$ by the \emph{symmetric simplicial category} $\Delta S$ and study (a class of) $\Delta S$-hypercoverings, which we call \emph{spaces admitting symmetric…

Algebraic Geometry · Mathematics 2023-08-14 Oishee Banerjee

We prove the a.e. nonamenability of locally finite quasi-pmp Borel graphs whose every component admits at least three nonvanishing ends with respect to the underlying Radon--Nikodym cocycle. We witness their nonamenability by constructing…

Dynamical Systems · Mathematics 2025-12-30 Ruiyuan Chen , Grigory Terlov , Anush Tserunyan

A semisimple element $s$ of a connected reductive group $G$ is said {\it quasi-isolated} (respectively {\it isolated}) if $C_G(s)$ (respectively $C_G^0(s)$) is not contained in a Levi subgroup of a proper parabolic subgroup of $G$. We study…

Group Theory · Mathematics 2007-05-23 Cédric Bonnafé

We provide a general method to construct examples of quasi-Sasakian 3-structures on a (4n+3)-dimensional manifold. Moreover, among this class, we give the first explicit example of a compact 3-quasi-Sasakian manifold which is not the global…

Differential Geometry · Mathematics 2015-11-12 Beniamino Cappelletti-Montano , Antonio De Nicola , Ivan Yudin

A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the…

The decay of a quasiparticle in a confined geometry, resulting from electron-electron interactions, has been mapped onto the single-electron problem of diffusion on a Cayley tree by Altshuler et al. [Phys.Rev.Lett. 78, 2803 (1997)]. We…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 X. Leyronas , J. Tworzydlo , C. W. J. Beenakker

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Combinatorics · Mathematics 2015-03-19 Andrew Suk

A countable CW complex $K$ is quasi-finite (as defined by A.Karasev) if for every finite subcomplex $M$ of $K$ there is a finite subcomplex $e(M)$ such that any map $f:A\to M$, where $A$ is closed in a separable metric space $X$ satisfying…

Geometric Topology · Mathematics 2008-02-27 M. Cencelj , J. Dydak , J. Smrekar , A. Vavpetic , Z. Virk

Forest polynomials, recently introduced by Nadeau and Tewari, can be thought of as a quasisymmetric analogue for Schubert polynomials. They have already been shown to exhibit interesting interactions with Schubert polynomials; for example,…

Combinatorics · Mathematics 2026-02-05 Annie Guo , Dora Woodruff

In 1980 Provan and Billera defined the notion of weak $k$-decomposability for pure simplicial complexes. They showed the diameter of a weakly $k$-decomposable simplicial complex $\Delta$ is bounded above by a polynomial function of the…

Combinatorics · Mathematics 2012-03-09 Jesus A. De Loera , Steven Klee

Let $R=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$, then $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a shedding…

Commutative Algebra · Mathematics 2024-05-24 Mozhgan Koolani , Amir Mafi

For a pair $(G,\mathcal{P})$ consisting of a group and finite collection of subgroups, we introduce a simplicial $G$-complex $\mathcal{K}(G,\mathcal{P})$ called the coset intersection complex. We prove that the quasi-isometry type and the…

Group Theory · Mathematics 2026-02-25 Carolyn Abbott , Eduardo Martínez-Pedroza

Let G be the graph of a triangulated surface $\Sigma$ of genus $g\geq 2$. A cycle of G is splitting if it cuts $\Sigma$ into two components, neither of which is homeomorphic to a disk. A splitting cycle has type k if the corresponding…

Computational Geometry · Computer Science 2015-09-02 Vincent Despré , Francis Lazarus

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