相关论文: On Vietoris--Rips complexes (with scale 3) of hype…

The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of $d$-cycles, $d$-hypertrees and $d$-hypercuts are, respectively, $(d+1)$,…

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

We call a polytope P of dimension 3 admissible if it has the following two properties: (1) for each vertex of P the set of its first-neighbours is coplanar; (2) all planes determined by the first-neighbours are distinct. It is shown that…

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$. This is a well studied concept because it provides a fertile ground…

In this paper we consider a family of simplicial complexes, which we call the view complexes. Our choice of objects of study is motivated by theoretical distributed computing, since the view complex is a key simplicial construction used for…

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…

The classical problem of degree sequence realizability asks whether or not a given sequence of $n$ positive integers is equal to the degree sequence of some $n$-vertex undirected simple graph. While the realizability problem of degree…

Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…

There is a Rota-Baxter algebra structure on the field $A=\mathbf{k}((t))$ with $ P$ being the projection map $A=\mathbf{k}[[t]]\oplus t^{-1}\mathbf{k}[t^{-1}]$ onto $ \mathbf{k}[[ t]]$. We study the representation theory and…

For any finite set $\mathcal{H} = \{H_1,\ldots,H_p\}$ of graphs, a graph is $\mathcal{H}$-subgraph-free if it does not contain any of $H_1,\ldots,H_p$ as a subgraph. In recent work, meta-classifications have been studied: these show that if…

For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

For any fixed positive integer $r$ and a given budget $k$, the $r$-\textsc{Eigenvalue Vertex Deletion} ($r$-EVD) problem asks if a graph $G$ admits a subset $S$ of at most $k$ vertices such that the adjacency matrix of $G\setminus S$ has at…

Let $V$ be a finite dimensional vector space equipped with a non-degenerate Hermitian form over a field $\mathbb{K}$. Let $\mathcal{G}(V)$ be the graph with vertex set the $1$-dimensional non-degenerate subspaces of $V$ and adjacency…

We show that for a generic $8$-dimensional Riemannian manifold with positive Ricci curvature, there exists a smooth minimal hypersurface. Without the curvature condition, we show that for a dense set of 8-dimensional Riemannian metrics…

For a connected graph $\Gamma=(V,E)$, a subset $R$ of ordered vertices in $V$ is said to be a resolving set in $\Gamma$, if the vector of distances to the vertices in $R$ is unique for each $u^{i}\in V(\Gamma)$. The metric dimension of…