English
Related papers

Related papers: On Vietoris--Rips complexes of hypercube graphs

200 papers

Let $Q_n$ denote the $n$-dimensional hypercube with the vertex set $V_n=\{0,1}^n$. A 0/1-polytope of $Q_n$ is a convex hull of a subset of $V_n$. This paper is concerned with the enumeration of equivalence classes of full-dimensional…

Combinatorics · Mathematics 2011-01-04 William Y. C. Chen , Peter L. Guo

In this paper we give a formula for the homotopy groups of $(n-1)$-connected $2n$-manifolds as a direct sum of homotopy groups of spheres in the case the $n^{th}$ Betti number is larger than $1$. We demonstrate that when the $n^{th}$ Betti…

Algebraic Topology · Mathematics 2015-10-20 Samik Basu , Somnath Basu

Let $\Gamma=(V,E)$ be a graph. The square graph $\Gamma^2$ of the graph $\Gamma$ is the graph with the vertex set $V(\Gamma^2)=V$ in which two vertices are adjacent if and only if their distance in $\Gamma$ is at most two. The square graph…

Combinatorics · Mathematics 2022-07-01 S. Morteza Mirafzal

We give a homotopy classification of the global defects in ordered media, and explain it via the example of biaxial nematic liquid crystals, i.e., systems where the order parameter space is the quotient of the $3$-sphere $S^3$ by the…

Soft Condensed Matter · Physics 2025-12-02 Yuta Nozaki , Tamás Kálmán , Masakazu Teragaito , Yuya Koda

We compute the homotopy type of the space of embeddings of convex disks with Legendrian boundary into a tight contact $3$-manifold, whenever the sum of the absolute value of the rotation number of the boundary with the Thurston-Bennequin…

Symplectic Geometry · Mathematics 2022-12-29 Eduardo Fernández , Javier Martínez-Aguinaga , Francisco Presas

The $n$-cube graph is the graph on the vertex set of $n$-tuples of $0$s and $1$s, with two vertices joined by an edge if and only if the $n$-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently,…

Combinatorics · Mathematics 2020-01-30 David Chandler , Peter Sin , Qing Xiang

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…

Combinatorics · Mathematics 2025-02-03 Jiří Fink , Vojtěch Hotmar

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that…

Combinatorics · Mathematics 2016-09-07 Eric Babson , Anders Björner , Svante Linusson , John Shareshian , Volkmar Welker

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

Combinatorics · Mathematics 2014-03-04 Joseph Gubeladze , Jack Love

Following Riley's work, for each 2-bridge link $K(r)$ of slope $r\in\QQ$ and an integer or a half-integer $n$ greater than 1, we introduce the {\it Heckoid orbifold $\orbs(r;n)$} and the {\it Heckoid group $\Hecke(r;n)=\pi_1(\orbs(r;n))$ of…

Geometric Topology · Mathematics 2012-06-20 Donghi Lee , Makoto Sakuma

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

Combinatorics · Mathematics 2011-04-01 Kari Ragnarsson , Bridget Eileen Tenner

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Combinatorics · Mathematics 2008-11-19 Fred J. Rispoli

Classical methods to model topological properties of point clouds, such as the Vietoris-Rips complex, suffer from the combinatorial explosion of complex sizes. We propose a novel technique to approximate a multi-scale filtration of the Rips…

Computational Geometry · Computer Science 2016-04-04 Aruni Choudhary , Michael Kerber , Sharath Raghvendra

We present a new, inductive construction of the Vietoris-Rips complex, in which we take advantage of a small amount of unexploited combinatorial structure in the $k$-skeleton of the complex in order to avoid unnecessary comparisons when…

Combinatorics · Mathematics 2024-06-19 Antonio Rieser

Let $S^n$ be the $n$-sphere with the geodesic metric and of diameter $\pi$. The intrinsic \v{C}ech complex of $S^n$ at scale $r$ is the nerve of all open balls of radius $r$ in $S^n$. In this paper, we show how to control the homotopy…

Algebraic Topology · Mathematics 2026-04-14 Henry Adams , Ekansh Jauhari , Sucharita Mallick

This is the last of a series of papers which give a necessary and sufficient condition for two essential simple loops on a 2-bridge sphere in a 2-bridge link complement to be homotopic in the link complement. The first paper of the series…

Group Theory · Mathematics 2013-10-02 Donghi Lee , Makoto Sakuma

The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much…

Combinatorics · Mathematics 2022-06-07 Anurag Singh

We show that a connected finite topological space with $12$ or less points has a weak homotopy type of a wedge of spheres. In other words, we show that the order complex of a connected finite poset with $12$ or less points has a homotopy…

Algebraic Topology · Mathematics 2024-06-05 Kango Matsushima , Shuichi Tsukuda

Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to…

Combinatorics · Mathematics 2020-11-09 Andrey A. Dobrynin , Andrei Yu. Vesnin

Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…

Combinatorics · Mathematics 2013-02-19 Eric Babson
‹ Prev 1 4 5 6 7 8 10 Next ›