中文
相关论文

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

200 篇论文

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

组合数学 · 数学 2007-05-23 R. Meshulam , N. Wallach

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

组合数学 · 数学 2016-01-08 Wei-Guo Chen , Zhi-Hong Chen , Mei Lu

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

组合数学 · 数学 2023-12-25 Oliver Knill

The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph $H,$ every $H$-minor-free graph can be obtained by clique-sums of ``almost embeddable'' graphs. Here a graph is ``almost embeddable'' if it can be…

组合数学 · 数学 2024-02-06 Dimitrios M. Thilikos , Sebastian Wiederrecht

We introduce and investigate $d$-convex union representable complexes: the complexes that arise as the nerve of a finite collection of convex open sets in $\mathbb R^d$ whose union is also convex. Chen, Frick, and Shiu recently proved that…

组合数学 · 数学 2019-08-26 R. Amzi Jeffs , Isabella Novik

Let $G$ be a graph on $V$. A vertex subset $S \subset V$ is called a cover of $G$ if its complement is an independent set, and $S$ is called a noncover if it is not a cover of $G$. A noncover complex $NC(G)$ of $G$ is the simplicial complex…

组合数学 · 数学 2019-04-10 Jinha Kim

We classify the finite type (in the sense of E. Cartan theory of prolongations) subalgebras $\mathfrak{h}\subset\mathfrak{sp}(V)$, where $V$ is the symplectic 4-dimensional space, and show that they satisfy $\mathfrak{h}^{(k)}=0$ for all…

微分几何 · 数学 2020-04-15 D. Alekseevsky , A. Santi

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.…

组合数学 · 数学 2026-02-04 Priyavrat Deshpande , Amit Roy , Rutuja Sawant

For a genus g handlebody H a simplicial complex, with vertices being isotopy classes of certain incompressible surfaces in H, is constructed and several properties are established. In particular, this complex naturally contains, as a…

几何拓扑 · 数学 2015-03-19 Charalampos Charitos , Ioannis Papadoperakis , Georgios Tsapogas

Many simplicial complexes arising in practice have an associated metric space structure on the vertex set but not on the complex, e.g. the Vietoris-Rips complex in applied topology. We formalize a remedy by introducing a category of…

范畴论 · 数学 2021-01-27 Henry Adams , Johnathan Bush , Joshua Mirth

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

几何拓扑 · 数学 2026-03-24 Biplab Basak , Raju Kumar Gupta , Ayushi Trivedi

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…

度量几何 · 数学 2020-08-06 Karim A. Adiprasito , Bruno Benedetti

Motivated by the study of the non-parametric area $\mathcal A$ of the graph of the vortex map $u$ (a two-codimensional singular surface in $\mathbb R^4$) over the disc $\Omega \subset \mathbb R^2$ of radius $l$, we perform a careful…

偏微分方程分析 · 数学 2024-09-24 Giovanni Bellettini , Alaa Elshorbagy , Riccardo Scala

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

组合数学 · 数学 2007-05-23 Anders Björner

Let $G=(V,E)$ be a connected simple graph. The distance $d(u,v)$ between vertices $u$ and $v$ from $V$ is the number of edges in the shortest $u-v$ path. If $e=uv \in E$ is an edge in $G$ than distance $d(w,e)$ where $w$ is some vertex in…

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

组合数学 · 数学 2023-08-08 Zhihan Jin , István Tomon

Let $S$ be a finite set of positive integers. A mixed hypergraph ${\cal H}$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is either 0 or 1. In [P. Zhao, K. Diao, Y. Chang and K. Wang, The…

组合数学 · 数学 2013-06-05 Kefeng Diao , Vitaly I. Voloshin , Kaishun Wang , Ping Zhao

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

代数拓扑 · 数学 2025-12-02 Sanjay Mishra

We study Forman--Ricci and effective resistance curvatures on the skeleta of convex polytopes. Our guiding questions are: how frequently do polytopal graphs exhibit everywhere positive curvature, and what structural constraints does…

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

组合数学 · 数学 2018-11-08 Andrey O. Matveev
‹ 上一页 1 8 9 10 下一页 ›