中文
相关论文

相关论文: Homological connectivity of random k-dimensional c…

200 篇论文

A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\leq r<n$, exact lower bounds on minimum degree $\delta(n,r)$ of an $n$-vertex…

组合数学 · 数学 2023-07-17 Alexandr Kostochka , Ruth Luo , Grace McCourt

We call the dimension data $\mathscr{D}_{H_{1}}$ and $\mathscr{D}_{H_{2}}$ of two closed subgroups $H_{1}$ and $H_{2}$ of a given compact Lie group $G$ {\it almost equal} if $\mathscr{D}_{H_{1}}(\rho)=\mathscr{D}_{H_{2}}(\rho)$ for all but…

表示论 · 数学 2022-02-25 Jun Yu

We show that recent results on randomized dimension reduction schemes that exploit structural properties of data can be applied in the context of persistent homology. In the spirit of compressed sensing, the dimension reduction is…

计算几何 · 计算机科学 2019-09-09 Martin Lotz

We study the appearance of Hamilton $\ell$-cycles in dense $k$-uniform hypergraphs when $\ell \leq k-2$ and $k-\ell$ does not divide $k$. Our main result reduces this problem to the robust existence of a connected $\ell$-cycle tiling in…

组合数学 · 数学 2025-12-10 Richard Lang , Nicolás Sanhueza-Matamala

We use the cylindrical homomorphism and a geometric construction introduced by J. Lewis to study the Lawson homology groups of certain hypersurfaces $X\subset \mathbb{P}^{n+1}$ of degree $d\leq n+1$. As an application, we compute the…

代数几何 · 数学 2009-04-23 Mircea Voineagu

Consider a random matrix $H:\mathbb{R}^n\longrightarrow\mathbb{R}^m$. Let $D\geq2$ and let $\{W_l\}_{l=1}^{p}$ be a set of $k$-dimensional affine subspaces of $\mathbb{R}^n$. We ask what is the probability that for all $1\leq l\leq p$ and…

泛函分析 · 数学 2013-08-14 Alon Dmitriyuk , Yehoram Gordon

Let X be a zero-dimensional compact space such that all non-empty clopen subsets of X are homeomorphic to each other, and let H(X) be the group of all self-homeomorphisms of X with the compact-open topology. We prove that the Roelcke…

一般拓扑 · 数学 2021-08-27 V. V. Uspenskij

A recent result on size functions is extended to higher homology modules: the persistent homology based on a multidimensional measuring function is reduced to a 1-dimensional one. This leads to a stable distance for multidimensional…

代数拓扑 · 数学 2008-07-28 F. Cagliari , B. Di Fabio , M. Ferri

A rank one local system $\LL$ on a smooth complex algebraic variety $M$ is 1-admissible if the dimension of the first cohomology group $H^1(M,\LL)$ can be computed from the cohomology algebra $H^*(M,\C)$ in degrees $\leq 2$. Under the…

代数几何 · 数学 2010-02-05 A. Dimca

We prove a strengthening of the trickle down theorem for partite complexes. Given a $(d+1)$-partite $d$-dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are $\frac{1-\delta}{d}$-(one-sided)…

离散数学 · 计算机科学 2023-06-21 Dorna Abdolazimi , Shayan Oveis Gharan

Some aspects of the multidimensional soliton geometry are considered. It is shown that some simples (2+1)-dimensional equations are exact reductions of the Self-Dual Yang-Mills equation or its higher hierarchy.

数学物理 · 物理学 2007-05-23 Kur. R. Myrzakul , R. Myrzakulov

For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),.,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…

组合数学 · 数学 2011-03-21 Mohsen Jannesari , Behnaz Omoomi

A non-trivial separable metric space $X$ is called an almost homology $n$-manifold if the homology groups $H_k(X,X\backslash\{x\},\mathbb Z)$ are trivial for all $x\in X$ and all $k=0,1,..,n-1$. We provide a necessary and sufficient…

一般拓扑 · 数学 2025-05-13 Vesko Valov

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…

组合数学 · 数学 2024-04-17 Ziqin Feng , Guanghui Wang

Bollob\'{a}s and Thomason (1985) proved that for each $k=k(n) \in [1, n-1]$, with high probability, the random graph process, where edges are added to vertex set $V=[n]$ uniformly at random one after another, is such that the stopping time…

组合数学 · 数学 2015-03-10 Daniel Poole

We prove a conjecture of J. Carlson, N. Mazza and J. Th\'evenaz; namely, we will prove that if $G$ is a finite $p$-nilpotent group which contains a non-cyclic elementary Abelian $p$-subgroup and $k$ is an algebraically closed field of…

群论 · 数学 2010-07-22 Gabriel Navarro , Geoffrey R. Robinson

In this paper we introduce a new homology theory devoted to the study of families such as semi-algebraic or subanalytic families and in general to any family definable in an o-minimal structure (such as Denjoy-Carleman definable or $ln-exp$…

代数几何 · 数学 2008-01-15 Guillaume Valette

In this paper we study the homology of a random Cech complex generated by a homogeneous Poisson process in a compact Riemannian manifold M. In particular, we focus on the phase transition for "homological connectivity" where the homology of…

概率论 · 数学 2017-04-25 Omer Bobrowski , Goncalo Oliveira

Amit and Linial showed that a random lift of a graph with minimum degree $\delta\ge3$ is asymptotically almost surely $\delta$-connected, and mentioned the problem of estimating this probability as a function of the degree of the lift. We…

离散数学 · 计算机科学 2017-03-23 Shashwat Silas

We examine the topology of the clique complexes of the graphs of weakly and strongly separated subsets of the set $[n]=\{1,2,...,n\}$, which, after deleting all cone points, we denote by $\hat{\Delta}_{ws}(n)$ and $\hat{\Delta}_{ss}(n)$,…

组合数学 · 数学 2011-10-06 Daniel Hess , Benjamin Hirsch