Related papers: Generalization of neighborhood complexes
Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…
In this paper we give a complete description of K-theory groups for Cuntz-Krieger C*-algebras associated to general locally-finite (topologically connected) graphs via Bass-Hashimoto operator. Our result generalizes the one obtained by the…
We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…
Answering a question of Hegyv\'ari and Ruzsa , we show that if A is a set of integers having positive upper Banach density, then the set A+A-A:= {a+b-c: a, b, c are in A} contains Bohr neighborhoods of many elements of A, where the radius…
In "Rips complexes and covers in the uniform category" \cite{Rips} the authors define, following James \cite{J}, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of…
In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…
In this paper we establish a direct connection between stable approximate unitary equivalence for $*$-homomorphisms and the topology of the KK-groups which avoids entirely C*-algebra extension theory and does not require nuclearity…
We introduce a natural notion of holomorphic map between generalized complex manifolds and we prove some related results on Dirac structures and generalized Kaehler manifolds.
Let $R$ be a commutative Noetherian ring. We introduce the notion of localization functors $\lambda^W$ with cosupports in arbitrary subsets $W$ of $\text{Spec}\, R$; it is a common generalization of localizations with respect to…
Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, 277--303] we give laws of large numbers (in the $L^p$ sense) for the total power-weighted length of several nearest-neighbour type graphs on…
Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree…
For a fixed integer $k\ge 2$, a $k$-community structure in an undirected graph is a partition of its vertex set into $k$ sets called communities, each of size at least two, such that every vertex of the graph has proportionally at least as…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…
In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary…
We derive a new Rademacher complexity bound for deep neural networks using Koopman operators, group representations, and reproducing kernel Hilbert spaces (RKHSs). The proposed bound describes why the models with high-rank weight matrices…
We discuss the topological properties of the independence complex of Kneser graphs, Ind(KG$(n, k))$, with $n\geq 3$ and $k\geq 1$. By identifying one kind of maximal simplices through projective planes, we obtain homology generators for the…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
We define and study generalized nil-Coxeter algebras associated to Coxeter groups. Motivated by a question of Coxeter (1957), we construct the first examples of such finite-dimensional algebras that are not the 'usual' nil-Coxeter algebras:…
We introduce a new family of pure simplicial complexes, called the $r$-co-connected complex of $G$ with respect to $A$, $\Sigma_r(A,G)$, where $r\geq 1$ is a natural number, $G$ is a simple graph, and $A$ is a subset of vertices.…