SearcharxivSearch

arXiv subjects

Michal Adamaszek

Publications and source records attributed to Michal Adamaszek.

At least 19 recordsLinked to original sources

Metric reconstruction via optimal transport

Given a sample of points $X$ in a metric space $M$ and a scale $r>0$, the Vietoris-Rips simplicial complex $\mathrm{VR}(X;r)$ is a standard construction to attempt to recover $M$ from $X$ up to homotopy type. A deficiency of this approach is that $\mathrm{VR}(X;r)$ is not metrizable if it is not locally finite, and thus does not recover metric information about $M$. We attempt to remedy this shortcoming by defining a metric space thickening of $X$, which we call the \emph{Vietoris-Rips thickening} $\mathrm{VR}^m(X;r)$, via the theory of optimal transport. When $M$ is a complete Riemannian manifold, or alternatively a compact Hadamard space, we show that the the Vietoris-Rips thickening satisfies Hausmann's theorem ($\mathrm{VR}^m(M;r)\simeq M$ for $r$ sufficiently small) with a simpler proof: homotopy equivalence $\mathrm{VR}^m(M;r)\to M$ is canonically defined as a center of mass map, and its homotopy inverse is the (now continuous) inclusion map $M\hookrightarrow\mathrm{VR}^m(M;r)$. Furthermore, we describe the homotopy type of the Vietoris-Rips thickening of the $n$-sphere at the first positive scale parameter $r$ where the homotopy type changes.

math.MG

On Vietoris-Rips complexes of ellipses

For $X$ a metric space and $r>0$ a scale parameter, the Vietoris-Rips complex $VR_<(X;r)$ (resp. $VR_\leq(X;r)$) has $X$ as its vertex set, and a finite subset $σ\subseteq X$ as a simplex whenever the diameter of $σ$ is less than $r$ (resp. at most $r$). Though Vietoris-Rips complexes have been studied at small choices of scale by Hausmann and Latschev, they are not well-understood at larger scale parameters. In this paper we investigate the homotopy types of Vietoris-Rips complexes of ellipses $Y=\{(x,y)\in \mathbb{R}^2~|~(x/a)^2+y^2=1\}$ of small eccentricity, meaning $1<a\le\sqrt{2}$. Indeed, we show there are constants $r_1 < r_2$ such that for all $r_1 < r< r_2$, we have $VR_<(X;r)\simeq S^2$ and $VR_\leq(X;r)\simeq \bigvee^5 S^2$, though only one of the two-spheres in $VR_\leq(X;r)$ is persistent. Furthermore, we show that for any scale parameter $r_1 < r < r_2$, there are arbitrarily dense subsets of the ellipse such that the Vietoris-Rips complex of the subset is not homotopy equivalent to the Vietoris-Rips complex of the entire ellipse. As our main tool we link these homotopy types to the structure of infinite cyclic graphs.

math.GN

The Vietoris-Rips complexes of a circle

Given a metric space X and a distance threshold r>0, the Vietoris-Rips simplicial complex has as its simplices the finite subsets of X of diameter less than r. A theorem of Jean-Claude Hausmann states that if X is a Riemannian manifold and r is sufficiently small, then the Vietoris-Rips complex is homotopy equivalent to the original manifold. Little is known about the behavior of Vietoris-Rips complexes for larger values of r, even though these complexes arise naturally in applications using persistent homology. We show that as r increases, the Vietoris-Rips complex of the circle obtains the homotopy types of the circle, the 3-sphere, the 5-sphere, the 7-sphere, ..., until finally it is contractible. As our main tool we introduce a directed graph invariant, the winding fraction, which in some sense is dual to the circular chromatic number. Using the winding fraction we classify the homotopy types of the Vietoris-Rips complex of an arbitrary (possibly infinite) subset of the circle, and we study the expected homotopy type of the Vietoris-Rips complex of a uniformly random sample from the circle. Moreover, we show that as the distance parameter increases, the ambient Cech complex of the circle also obtains the homotopy types of the circle, the 3-sphere, the 5-sphere, the 7-sphere, ..., until finally it is contractible.

math.AT

On homotopy types of Euclidean Rips complexes

The Rips complex at scale r of a set of points X in a metric space is the abstract simplicial complex whose faces are determined by finite subsets of X of diameter less than r. We prove that for X in the Euclidean 3-space R^3 the natural projection map from the Rips complex of X to its shadow in R^3 induces a surjection on fundamental groups. This partially answers a question of Chambers, de Silva, Erickson and Ghrist who studied this projection for subsets of R^2. We further show that Rips complexes of finite subsets of R^n are universal, in that they model all homotopy types of simplicial complexes PL-embeddable in R^n. As an application we get that any finitely presented group appears as the fundamental group of a Rips complex of a finite subset of R^4. We furthermore show that if the Rips complex of a finite point set in R^2 is a normal pseudomanifold of dimension at least two then it must be the boundary of a crosspolytope.

math.AT

A note on independence complexes of chordal graphs and dismantling

We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The proof uses the properties of tree models of chordal graphs.

math.CO

Face numbers of down-sets

We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.

math.CO

Nerve complexes of circular arcs

We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n).

math.AT

Transitivity is not a (big) restriction on homotopy types

For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand in some vertex-transitive complex. One can even demand that the vertex-transitive complex is the clique complex of a Cayley graph or that it is facet-transitive.

math.CO

Dense flag triangulations of 3-manifolds via extremal graph theory

We characterize f-vectors of sufficiently large three-dimensional flag Gorenstein* complexes, essentially confirming a conjecture of Gal [Discrete Comput. Geom., 34 (2), 269--284, 2005]. In particular, this characterizes f-vectors of large flag triangulations of the 3-sphere. Actually, our main result is more general and describes the structure of closed flag 3-manifolds which have many edges. Looking at the 1-skeleta of these manifolds we reduce the problem to a certain question in extremal graph theory. We then resolve this question by employing the Supersaturation Theorem of Erdos and Simonovits.

math.CO

Extremal problems related to Betti numbers of flag complexes

We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32^n for the sum of Betti numbers of any n-vertex flag complex and 1.25^n for the independence complex of a triangle-free graph. These findings imply upper bounds for the Betti numbers of various related classes of spaces, including the neighbourhood complex of a graph. We also make some related observations.

math.CO

The smallest nonevasive graph property

A property of n-vertex graphs is called evasive if every algorithm testing this property by asking questions of the form "is there an edge between vertices u and v" requires, in the worst case, to ask about all pairs of vertices. Most "natural" graph properties are either evasive or conjectured to be such, and of the few examples of nontrivial nonevasive properties scattered in the literature the smallest one has n=6. We exhibit a nontrivial, nonevasive property of 5-vertex graphs and show that it is essentially the unique such with n at most 5.

math.CO

An upper bound theorem for a class of flag weak pseudomanifolds

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles. The proof relies on stability results from extremal graph theory. In the case of manifolds we also offer an alternative (very) short proof utilizing the non-embeddability theorem of Flores. The main theorem can also be interpreted without the topological contents as a graph-theoretic extremal result about a class of graphs such that 1) every maximal clique in the graph has size d+1 and 2) every clique of size d belongs to exactly two maximal cliques.

math.CO

Small flag complexes with torsion

We classify flag complexes on at most 12 vertices with torsion in the first homology group. The result is moderately computer-aided. As a consequence we confirm a folklore conjecture that the smallest poset whose order complex is homotopy equivalent to the real projective plane (and also the smallest poset with torsion in the first homology group) has exactly 13 elements.

math.CO

Hard squares on cylinders revisited

We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those spaces. In the second part we expand the results of Jonsson, who calculated the Euler characteristic of cylinders with odd circumference. We describe a series of results for cylinders of even circumference. Finally we define a completely independent combinatorial model (necklaces) which calculates the generating functions of the Euler characteristic of cylindrical grids. We conjecture that this model has some particularly simple structure.

math.CO

Clique complexes and graph powers

We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.

math.CO

Splittings of independence complexes and the powers of cycles

We use two cofibre sequences to identify some combinatorial situations when the independence complex of a graph splits into a wedge sum of smaller independence complexes. Our main application is to give a recursive relation for the homotopy types of the independence complexes of powers of cycles, which answers an open question of D. Kozlov.

math.CO