اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExpansion of Building-Like Complexes
200
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Following Gromov, the coboundary expansion of building-like complexes is studied. In particular, it is shown that for any $n geq 1$, there exists a constant $epsilon(n)>0$ such that for any $0 leq k <n$ the $k$-th coboundary expansion constant of any $n$-dimensional spherical building is at least $epsilon(n)$.
قيم البحث
اقرأ أيضاً
Ramanujan complexes are high dimensional simplical complexes generalizing Ramanujan graphs. A result of Oh on quantitative property (T) for Lie groups over local fields is used to deduce a Mixing Lemma for such complexes. As an application we prove t
hat non-partite Ramanujan complexes have high girth and high chromatic number, generalizing a well known result about Ramanujan graphs.
Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to spectral exp
ansion. In higher dimensions this is not the case: a simplicial complex can be spectrally expanding but not have high dimensional edge-expansion. The phenomenon of high dimensional edge expansion in higher dimensions is much more involved than spectral expansion, and is far from being understood. In particular, prior to this work, the only known bounded degree cosystolic expanders known were derived from the theory of buildings that is far from being elementary. In this work we study high dimensional complexes which are {em strongly symmetric}. Namely, there is a group that acts transitively on top dimensional cells of the simplicial complex [e.g., for graphs it corresponds to a group that acts transitively on the edges]. Using the strong symmetry, we develop a new machinery to prove coboundary and cosystolic expansion.
Let $K$ be a simplicial complex on vertex set $V$. $K$ is called $d$-Leray if the homology groups of any induced subcomplex of $K$ are trivial in dimensions $d$ and higher. $K$ is called $d$-collapsible if it can be reduced to the void complex by seq
uentially removing a simplex of size at most $d$ that is contained in a unique maximal face. We define the $t$-tolerance complex of $K$, $mathcal{T}_t(K)$, as the simplicial complex on vertex set $V$ whose simplices are formed as the union of a simplex in $K$ and a set of size at most $t$. We prove that for any $d$ and $t$ there exists a positive integer $h(t,d)$ such that, for every $d$-collapsible complex $K$, the $t$-tolerance complex $mathcal{T}_t(K)$ is $h(t,d)$-Leray. The definition of the complex $mathcal{T}_t(K)$ is motivated by results of Montejano and Oliveros on tolerant
The augmented Bergman complex of a matroid is a simplicial complex introduced recently in work of Braden, Huh, Matherne, Proudfoot and Wang. It may be viewed as a hybrid of two well-studied pure shellable simplicial complexes associated to matroids:
the independent set complex and Bergman complex. It is shown here that the augmented Bergman complex is also shellable, via two different families of shelling orders. Furthermore, comparing the description of its homotopy type induced from the two shellings re-interprets a known convolution formula counting bases of the matroid. The representation of the automorphism group of the matroid on the homology of the augmented Bergman complex turns out to have a surprisingly simple description. This last fact is generalized to closures beyond those coming from a matroid.
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma. Along the wa
y several results regarding Hom complexes, exponentials, and subdivision are established that may be of independent interest.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
