Related papers: Generalization of neighborhood complexes
In this work, we will introduce the notion of generalized topological groups using generalized topological structure and generalized continuity defined by ?A. Cs?asz?ar [2]. We will discuss some basic properties of this kind of structures…
We introduce a generalization of expander graphs, which is called a weak expander sequence. It is proved that a uniform Roe algebra of a weak expander sequence is not locally reflexive. It follows that uniform Roe algebras of expander…
This paper establishes an abstract Korovkin-type approximation theorem in general spaces, extending the framework of approximation theory to accommodate broader contexts. A critical result supporting this theorem is the proof that any…
We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…
We develop a real-analytic framework, called perplex analysis, in which the complex, split-complex, and dual numbers arise as members of a single four-parameter family of two-dimensional commutative real algebras. Within this unified…
We present new conditions that eliminate a large class of graphs from being induced neighbourhoods of finite vertex-transitive graphs.
Let $W$ be a finitely generated infinite Coxeter group, with $\Phi$ and $\Pi$ being the corresponding root system and set of simple roots respectively. It has been observed by Hohlweg et la that the projections of elements of $\Phi$ onto…
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…
Based on methods of structural convergence we provide a unifying view of local-global convergence, fitting to model theory and analysis. The general approach outlined here provides a possibility to extend the theory of local-global…
We give a quiver representation theoretic interpretation of generalized cluster complexes defined by Fomin and Reading. By using $d-$cluster categories which are defined by Keller as triangulated orbit categories of (bounded) derived…
The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom(G,K_n) is at least (n-d-2)-connected. Here Hom(-,-) denotes the polyhedral complex…
In this article, we study the relative negative K-groups $K_{-n}(f)$ of a map $f: X \to S $ of schemes. We prove a relative version of the Weibel conjecture i.e. if $f: X \to S$ is a smooth affine map of noetherian schemes with $\dim S=d$…
The main aim of this paper is to provide a description of neighbourhood operators in finitely complete categories with finite coproducts and a proper factorisation system such that the semilattice of admissible subobjects make a…
We investigate generalized inverses of matrices associated with two classes of digraphs: double star digraphs and D-linked stars digraphs. For double star digraphs, we determine the Drazin index and derive explicit formulas for the Drazin…
We study the class of independence complexes of claw-free graphs. The main theorem give good bounds on the connectivity of these complexes, given bounds for a few subcomplexes of the same class. Two applications are presented. Firstly, we…
We prove a generalization of the fundamental theorem of algebraic K-theory for Verdier-localizing functors by extending the proof for algebraic K-theory of spaces to the realm of stable $\infty$-categories. The formula behaves much better…
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…
In this paper we disprove a conjecture of Lidick\'y and Murphy about the number of copies of a given graph in a $K_r$-free graph and give an alternative general conjecture. We also prove an asymptotically tight bound on the number of copies…