Zobrazeno 1 - 10
of 590
pro vyhledávání: '"Figueroa, Francisco"'
Autor:
Martinez-Figueroa, Francisco
Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$ is ${\epsil
Externí odkaz:
http://arxiv.org/abs/2207.13892
Autor:
Martinez-Figueroa, Francisco
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or Cech complex
Externí odkaz:
http://arxiv.org/abs/2111.05774
Autor:
Martinez-Figueroa, Francisco
Given a finite group $G$ acting freely on a compact metric space $M$, and $\epsilon>0$, we define the $G$-Borsuk graph on $M$ by drawing edges $x\sim y$ whenever there is a non-identity $g\in G$ such that $d(x,gy)\leq\epsilon$. We show that when $\ep
Externí odkaz:
http://arxiv.org/abs/2110.06453
Publikováno v:
In Journal of ISAKOS June 2024 9(3):378-385
Autor:
Aman, Zachary S., Champagne, Allen A., Hurley, Eoghan T., Danilkowicz, Richard M., Ciccotti, Michael G., Hirschmann, Michael T., Figueroa, Francisco, Jones, Kristofer J., Murray, Iain R., Shannon, Fintan J., Jazrawi, Laith M.
Publikováno v:
In Journal of Cartilage & Joint Preservation May 2024
Publikováno v:
Geombinatorics XXIX(4), 2020, 167-184
Suppose that $n \ge 2$, and we wish to plant $k$ different types of trees in the squares of an $n \times n$ square grid. We can have as many of each type as we want. The only rule is that every pair of types must occur in an adjacent pair of squares
Externí odkaz:
http://arxiv.org/abs/2004.10192
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Random Struct Alg. 2020; 56: 838-850
We study a model of random graph where vertices are $n$ i.i.d. uniform random points on the unit sphere $S^d$ in $\mathbb{R}^{d+1}$, and a pair of vertices is connected if the Euclidean distance between them is at least $2- \epsilon$. We are interest
Externí odkaz:
http://arxiv.org/abs/1901.08488