Ángel Javier Alonso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ángel Javier Alonso has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michael Kerber
Graz University of Technology, Graz, Austria
4 shared publications - Federico Cantero Morán
Institute of Geometry , TU Graz, Kopernikusgasse 24, Graz 8010
1 shared publication - Michael Lesnick
SUNY Albany USA
1 shared publication - Primoz Skraba
School of Mathematical Sciences, Queen Mary University of London, London, United Kingdom
1 shared publication - Tung Lam1 shared publication
Latest Publications
- 4 August 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (4) , 2243-2271
A Sparse Multicover Bifiltration of Linear Size
- 4 August 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (4) , 2243-2271
A Sparse Multicover Bifiltration of Linear Size
- 12 December 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (4) , 1507-1527
On the scanning map and the space of smooth complex projective hypersurfaces
The space of degree d smooth projective hypersurfaces of $\mathbb{C}P^n$ admits a scanning map to a certain space of sections. We compute a rational homotopy model of the action by conjugation of the group $U(n+1)$ on this space of sections, from which we deduce that the scanning map induces a monomorphism on cohomology when d > 2. Our main technique is the rational homotopy theory of Sullivan and, more specifically, a Sullivan model for the action by conjugation of a connected topological group on a space of sections.- 12 December 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (4) , 1507-1527
On the scanning map and the space of smooth complex projective hypersurfaces
The space of degree d smooth projective hypersurfaces of $\mathbb{C}P^n$ admits a scanning map to a certain space of sections. We compute a rational homotopy model of the action by conjugation of the group $U(n+1)$ on this space of sections, from which we deduce that the scanning map induces a monomorphism on cohomology when d > 2. Our main technique is the rational homotopy theory of Sullivan and, more specifically, a Sullivan model for the action by conjugation of a connected topological group on a space of sections.- Open Access
- 16 November 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 74 (4) , 818-838
Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets . In the case of a filtered metric space M , rooted subsets relate the clustering behavior of the points of M with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules.
- 16 November 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 74 (4) , 818-838
Open AccessDecomposition of Zero-Dimensional Persistence Modules via Rooted Subsets
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets . In the case of a filtered metric space M , rooted subsets relate the clustering behavior of the points of M with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules.
- Open Access
Probabilistic Analysis of Multiparameter Persistence Decompositions
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical applications and their computational efficiency. Empirical observations indicate that modules that decompose into only intervals are rare. To support this observation, we show that for numerous common multiparameter constructions, such as density- or degree-Rips bifiltrations, and across a general category of point samples, the probability of the homology-induced persistence module decomposing into intervals goes to zero as the sample size goes to infinity.
Open AccessProbabilistic Analysis of Multiparameter Persistence Decompositions
Multiparameter persistence modules can be uniquely decomposed into indecomposable summands. Among these indecomposables, intervals stand out for their simplicity, making them preferable for their ease of interpretation in practical applications and their computational efficiency. Empirical observations indicate that modules that decompose into only intervals are rare. To support this observation, we show that for numerous common multiparameter constructions, such as density- or degree-Rips bifiltrations, and across a general category of point samples, the probability of the homology-induced persistence module decomposing into intervals goes to zero as the sample size goes to infinity.
- Open Access
Delaunay Bifiltrations of Functions on Point Clouds
The Delaunay filtration $\mathcal{D}_{\bullet}(X)$ of a point cloud $X\subset \mathbb{R}^d$ is a central tool of computational topology. Its use is justified by the topological equivalence of $\mathcal{D}_{\bullet}(X)$ and the offset (i.e., union-of-balls) filtration of $X$. Given a function $γ: X \to \mathbb{R}$, we introduce a Delaunay bifiltration $\mathcal{DC}_{\bullet}(γ)$ that satisfies an analogous topological equivalence, ensuring that $\mathcal{DC}_{\bullet}(γ)$ topologically encodes the offset filtrations of all sublevel sets of $γ$, as well as the topological relations between them. $\mathcal{DC}_{\bullet}(γ)$ is of size $O(|X|^{\lceil\frac{d+1}{2}\rceil})$, which for $d$ odd matches the worst-case size of $\mathcal{D}_{\bullet}(X)$. Adapting the Bowyer-Watson algorithm for computing Delaunay triangulations, we give a simple, practical algorithm to compute $\mathcal{DC}_{\bullet}(γ)$ in time $O(|X|^{\lceil \frac{d}{2}\rceil +1})$. Our implementation, based on CGAL, computes $\mathcal{DC}_{\bullet}(γ)$ with modest overhead compared to computing $\mathcal{D}_{\bullet}(X)$, and handles tens of thousands of points in $\mathbb{R}^3$ within seconds.Open AccessDelaunay Bifiltrations of Functions on Point Clouds
The Delaunay filtration $\mathcal{D}_{\bullet}(X)$ of a point cloud $X\subset \mathbb{R}^d$ is a central tool of computational topology. Its use is justified by the topological equivalence of $\mathcal{D}_{\bullet}(X)$ and the offset (i.e., union-of-balls) filtration of $X$. Given a function $γ: X \to \mathbb{R}$, we introduce a Delaunay bifiltration $\mathcal{DC}_{\bullet}(γ)$ that satisfies an analogous topological equivalence, ensuring that $\mathcal{DC}_{\bullet}(γ)$ topologically encodes the offset filtrations of all sublevel sets of $γ$, as well as the topological relations between them. $\mathcal{DC}_{\bullet}(γ)$ is of size $O(|X|^{\lceil\frac{d+1}{2}\rceil})$, which for $d$ odd matches the worst-case size of $\mathcal{D}_{\bullet}(X)$. Adapting the Bowyer-Watson algorithm for computing Delaunay triangulations, we give a simple, practical algorithm to compute $\mathcal{DC}_{\bullet}(γ)$ in time $O(|X|^{\lceil \frac{d}{2}\rceil +1})$. Our implementation, based on CGAL, computes $\mathcal{DC}_{\bullet}(γ)$ with modest overhead compared to computing $\mathcal{D}_{\bullet}(X)$, and handles tens of thousands of points in $\mathbb{R}^3$ within seconds. - Open Access
Decomposition of zero-dimensional persistence modules via rooted subsets
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets. In the case of a filtered metric space $M$, rooted subsets relate the clustering behavior of the points of $M$ with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules.Open AccessDecomposition of zero-dimensional persistence modules via rooted subsets
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study the decomposition problem at the level of sets. This approach allows us to define the combinatorial notion of rooted subsets. In the case of a filtered metric space $M$, rooted subsets relate the clustering behavior of the points of $M$ with the decomposition of the associated persistence module. In particular, we can identify intervals in such a decomposition quickly. In addition, rooted subsets can be understood as a generalization of the elder rule, and are also related to the notion of constant conqueror of Cai, Kim, Mémoli and Wang. As an application, we give a lower bound on the number of intervals that we can expect in the decomposition of zero-dimensional persistence modules of a density-Rips filtration in Euclidean space: in the limit, and under very general circumstances, we can expect that at least 25% of the indecomposable summands are interval modules.