Estimates on the Distribution of the Condition Number of Singular Matrices. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2007)

On the probability distribution of singular varieties of given corank. - Carlos Beltrán 001; Luis Miguel Pardo (J. Symb. Comput., 2007)

On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case. - Carlos Beltrán 001; Luis Miguel Pardo (Math. Comput., 2007)

On Smale's 17th Problem: A Probabilistic Positive Solution. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2008)

Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2009)

Convexity Properties of the Condition Number. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2009)

A Note on the Finite Variance of the Averaging Function for Polynomial System Solving. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2010)

Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems. - Carlos Beltrán 001; Luis Miguel Pardo (Found. Comput. Math., 2011)

A continuation method to solve polynomial systems and its complexity. - Carlos Beltrán 001 (Numerische Mathematik, 2011)

A general test to check the feasibility of linear interference alignment. - Oscar Gonzalez; Ignacio Santamaría; Carlos Beltrán 001 (ISIT, 2012)

On the Feasibility of Interference Alignment for the K-User MIMO Channel with Constant Coefficients - Oscar Gonzalez; Carlos Beltrán 001; Ignacio Santamaría (CoRR, 2012)

Certified Numerical Homotopy Tracking. - Carlos Beltrán 001; Anton Leykin (Exp. Math., 2012)

On the Geometry and Topology of the Solution Variety for Polynomial System Solving. - Carlos Beltrán 001; Michael Shub (Found. Comput. Math., 2012)

Convexity Properties of the Condition Number II. - Carlos Beltrán 001; Jean-Pierre Dedieu; Gregorio Malajovich; Mike Shub (SIAM J. Matrix Anal. Appl., 2012)

Computing the degrees of freedom for arbitrary MIMO interference channels. - Oscar Gonzalez; Cristian Lameiro; Javier Vía; Carlos Beltrán 001; Ignacio Santamaría (ICASSP, 2013)

Finding the number of feasible solutions for linear interference alignment problems. - Oscar Gonzalez; Ignacio Santamaría; Carlos Beltrán 001 (ISIT, 2013)

Robust Certified Numerical Homotopy Tracking. - Carlos Beltrán 001; Anton Leykin (Found. Comput. Math., 2013)

A Feasibility Test for Linear Interference Alignment in MIMO Channels With Constant Coefficients. - Oscar Gonzalez; Carlos Beltrán 001; Ignacio Santamaría (IEEE Trans. Inf. Theory, 2014)

A Facility Location Formulation for Stable Polynomials and Elliptic Fekete Points. - Carlos Beltrán 001 (Found. Comput. Math., 2015)

On the Number of Interference Alignment Solutions for the K-User MIMO Channel With Constant Coefficients. - Oscar Gonzalez; Carlos Beltrán 001; Ignacio Santamaría (IEEE Trans. Inf. Theory, 2015)

Condition Length and Complexity for the Solution of Polynomial Systems. - Diego Armentano; Carlos Beltrán 001; Peter Bürgisser; Felipe Cucker; Michael Shub (Found. Comput. Math., 2016)

Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres. - Carlos Beltrán 001; Jordi Marzo; Joaquim Ortega-Cerdà (J. Complex., 2016)

Homotopy Continuation for Spatial Interference Alignment in Arbitrary MIMO X Networks. - Jacobo Fanjul; Oscar Gonzalez; Ignacio Santamaría; Carlos Beltrán 001 (IEEE Trans. Signal Process., 2017)

Discrete and continuous green energy on compact manifolds. - Carlos Beltrán 001; Nuria Corral; Juan G. Criado del Rey (J. Approx. Theory, 2019)

The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs. - Diego Armentano; Carlos Beltrán 001 (SIAM J. Matrix Anal. Appl., 2019)

Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable. - Carlos Beltrán 001; Paul Breiding; Nick Vannieuwenhoven (SIAM J. Matrix Anal. Appl., 2019)

The Real Polynomial Eigenvalue Problem is Well Conditioned on the Average. - Carlos Beltrán 001; Khazhgali Kozhasov (Found. Comput. Math., 2020)

The Diamond ensemble: A constructive set of spherical points with small logarithmic energy. - Carlos Beltrán 001; Ujué Etayo (J. Complex., 2020)

A Fast Algorithm for Designing Grassmannian Constellations. - Diego Cuevas; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (WSA, 2021)

How well-conditioned can the eigenvalue problem be? - Carlos Beltrán 001; Laurent Bétermin; Peter Grabner; Stefan Steinerberger (CoRR, 2021)

Relative-error stability of numerical algorithms. - Carlos Beltrán 001; Vanni Noferini; Nick Vannieuwenhoven (CoRR, 2021)

On Gegenbauer Point Processes on the unit interval. - Carlos Beltrán 001; Antonia M. Delgado; Lidia Fernández; Joaquín F. Sánchez Lara (CoRR, 2021)

Coherence-based Subspace Packings for MIMO Noncoherent Communications. - Javier Álvarez-Vizoso; Diego Cuevas; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (EUSIPCO, 2022)

A Measure Preserving Mapping for Structured Grassmannian Constellations in SIMO Channels. - Diego Cuevas; Javier Álvarez-Vizoso; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (GLOBECOM, 2022)

Constellations on the Sphere with Efficient Encoding-Decoding for Noncoherent Communications. - Javier Álvarez-Vizoso; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (CoRR, 2022)

Statistical characterization of the chordal product determinant of Grassmannian codes. - Javier Álvarez-Vizoso; Carlos Beltrán 001; Diego Cuevas; Ignacio Santamaría; Vít Tucek; Gunnar Peters (CoRR, 2022)

How well-conditioned can the eigenvector problem be? - Carlos Beltrán 001; Laurent Bétermin; Peter Grabner; Stefan Steinerberger (Math. Comput., 2022)

Noncoherent Multiuser Grassmannian Constellations for the Mimo Multiple Access Channel. - Javier Álvarez-Vizoso; Diego Cuevas; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (ICASSP, 2023)

The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite. - Carlos Beltrán 001; Paul Breiding; Nick Vannieuwenhoven (Found. Comput. Math., 2023)

Union Bound Minimization Approach for Designing Grassmannian Constellations. - Diego Cuevas; Javier Álvarez-Vizoso; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (IEEE Trans. Commun., 2023)

Low-energy points on the sphere and the real projective plane. - Carlos Beltrán 001; Ujué Etayo; Pedro R. López-Gómez (J. Complex., 2023)

Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel. - Javier Álvarez-Vizoso; Diego Cuevas; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (IEEE Trans. Inf. Theory, 2023)

Structured Multi-Antenna Grassmannian Constellations for Noncoherent Communications. - Diego Cuevas; Carlos Beltrán 001; Mikel Gutiérrez; Ignacio Santamaría; Vít Tucek (SAM, 2024)

Constellations on the Sphere With Efficient Encoding-Decoding for Noncoherent Communications. - Diego Cuevas; Javier Álvarez-Vizoso; Carlos Beltrán 001; Ignacio Santamaría; Vít Tucek; Gunnar Peters (IEEE Trans. Wirel. Commun., 2024)

Measure-preserving mappings from the unit cube to some symmetric spaces. - Carlos Beltrán 001; Damir Ferizovic; Pedro R. López-Gómez (J. Approx. Theory, 2025)

Univariate amenable functions. - Carlos Beltrán 001 (CoRR, 2025)