中文
相关论文

相关论文: Homological connectivity of random k-dimensional c…

200 篇论文

In a previous work (arXiv:0806.1503v2), we defined a family of subcomplexes of the $n$-dimensional half cube by removing the interiors of all half cube shaped faces of dimension at least $k$, and we proved that the homology of such a…

表示论 · 数学 2010-06-01 R. M. Green

Several years ago Linial and Meshulam introduced a model called X_d(n,p) of random n-vertex d-dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability p=p(n) at which the…

组合数学 · 数学 2012-03-16 L. Aronshtam , N. Linial

We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…

几何拓扑 · 数学 2008-12-04 R. M. Green

Suppose $M^{n+1}$ is a complex manifold and K is a hypersurface with isolated singularities. Let $\omega$ be a holomorphic form on $M\setminus K$ with the first order pole on K. The Leray residue of such form gives an element in the n-th…

alg-geom · 数学 2008-02-03 Andrzej Weber

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

组合数学 · 数学 2025-09-09 András Mészáros

This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity.…

组合数学 · 数学 2007-05-23 Patricia Hersh

We generalize the fact that graphs with small VC-dimension can be approximated by rectangles, showing that hypergraphs with small VC_k-dimension (equivalently, omitting a fixed finite (k+1)-partite (k+1)-uniform hypergraph) can be…

组合数学 · 数学 2020-10-05 Artem Chernikov , Henry Towsner

Let D denote the (n-1)-dimensional simplex. Let Y be a random 2-dimensional subcomplex of D obtained by starting with the full 1-skeleton of D and then adding each 2-simplex independently with probability p. For a fixed c>0 it is shown that…

组合数学 · 数学 2013-08-20 Roy Meshulam

Given an infinite field $\mathbb{k}$ and a simplicial complex $\Delta$, a common theme in studying the $f$- and $h$-vectors of $\Delta$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[\Delta]$…

组合数学 · 数学 2019-07-31 Connor Sawaske

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

组合数学 · 数学 2025-12-02 Jon V. Kogan

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

几何拓扑 · 数学 2017-03-06 Anders Björner , Afshin Goodarzi

In this paper we state the homological domination principle for random multi-parameter simplicial complexes, claiming that the Betti number in one specific dimension (which is explicitly determined by the probability multi-parameter)…

代数拓扑 · 数学 2015-08-14 A. Costa , M. Farber

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…

代数拓扑 · 数学 2025-02-21 David Chataur , Martintxo Saralegi-Aranguren , Daniel Tanré

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

组合数学 · 数学 2024-06-28 Roy Meshulam , Omer Moyal

We prove sharper versions of theorems of Linial-Meshulam and Meshulam-Wallach which describe the behavior for (Z/2)-cohomology of a random k-dimensional simplicial complex within a narrow transition window. In particular, we show that…

组合数学 · 数学 2013-01-08 Matthew Kahle , Boris Pittel

We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs.…

概率论 · 数学 2011-05-05 Matthew Kahle

We introduce and study the vanishing homology of singular projective hypersurfaces. We prove its concentration in two levels in case of 1-dimensional singular locus $\Sigma$, and moreover determine the ranks of the nontrivial homology…

代数几何 · 数学 2017-09-11 Dirk Siersma , Mihai Tibar

We show that the universal abelian cover of the complement to a germ of a reducible divisor on a complex space $Y$ with isolated singularity is $(dimY-2)$-connected provided that the divisor has normal crossings outside of the singularity…

代数几何 · 数学 2007-05-23 Alexandru Dimca , Anatoly Libgober

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 study the Linial--Meshulam model of random two-dimensional simplicial complexes. One of our main results states that for $p\ll n^{-1}$ a random 2-complex $Y$ collapses simplicially to a graph and, in particular, the fundamental group…

代数拓扑 · 数学 2010-06-29 Armindo Costa , Michael Farber , Thomas Kappeler