Carlos Beltrán

According to our database, Carlos Beltrán authored at least 43 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Constellations on the Sphere With Efficient Encoding-Decoding for Noncoherent Communications.

Diego Cuevas, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

IEEE Trans. Wirel. Commun., March, 2024

2023

Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel.

Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

IEEE Trans. Inf. Theory, July, 2023

Low-energy points on the sphere and the real projective plane.

Carlos Beltrán, Ujué Etayo, Pedro R. López-Gómez

J. Complex., June, 2023

Union Bound Minimization Approach for Designing Grassmannian Constellations.

Diego Cuevas, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

IEEE Trans. Commun., April, 2023

The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite.

Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven

Found. Comput. Math., April, 2023

Noncoherent Multiuser Grassmannian Constellations for the Mimo Multiple Access Channel.

Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

Proceedings of the IEEE International Conference on Acoustics, 2023

2022

How well-conditioned can the eigenvector problem be?

Carlos Beltrán, Laurent Bétermin, Peter Grabner, Stefan Steinerberger

Math. Comput., 2022

Statistical characterization of the chordal product determinant of Grassmannian codes.

Javier Álvarez-Vizoso, Carlos Beltrán, Diego Cuevas, Ignacio Santamaría, Vít Tucek, Gunnar Peters

CoRR, 2022

Constellations on the Sphere with Efficient Encoding-Decoding for Noncoherent Communications.

Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

CoRR, 2022

A Measure Preserving Mapping for Structured Grassmannian Constellations in SIMO Channels.

Diego Cuevas, Javier Álvarez-Vizoso, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

Proceedings of the IEEE Global Communications Conference, 2022

Coherence-based Subspace Packings for MIMO Noncoherent Communications.

Javier Álvarez-Vizoso, Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

Proceedings of the 30th European Signal Processing Conference, 2022

2021

On Gegenbauer Point Processes on the unit interval.

Carlos Beltrán, Antonia M. Delgado, Lidia Fernández, Joaquín F. Sánchez Lara

CoRR, 2021

Relative-error stability of numerical algorithms.

Carlos Beltrán, Vanni Noferini, Nick Vannieuwenhoven

CoRR, 2021

How well-conditioned can the eigenvalue problem be?

Carlos Beltrán, Laurent Bétermin, Peter Grabner, Stefan Steinerberger

CoRR, 2021

A Fast Algorithm for Designing Grassmannian Constellations.

Diego Cuevas, Carlos Beltrán, Ignacio Santamaría, Vít Tucek, Gunnar Peters

Proceedings of the 25th International ITG Workshop on Smart Antennas, 2021

2020

The Diamond ensemble: A constructive set of spherical points with small logarithmic energy.

Carlos Beltrán, Ujué Etayo

J. Complex., 2020

The Real Polynomial Eigenvalue Problem is Well Conditioned on the Average.

Carlos Beltrán, Khazhgali Kozhasov

Found. Comput. Math., 2020

2019

Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable.

Carlos Beltrán, Paul Breiding, Nick Vannieuwenhoven

SIAM J. Matrix Anal. Appl., 2019

The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs.

Diego Armentano, Carlos Beltrán

SIAM J. Matrix Anal. Appl., 2019

Discrete and continuous green energy on compact manifolds.

Carlos Beltrán, Nuria Corral, Juan G. Criado del Rey

J. Approx. Theory, 2019

2017

Homotopy Continuation for Spatial Interference Alignment in Arbitrary MIMO X Networks.

Jacobo Fanjul, Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán

IEEE Trans. Signal Process., 2017

2016

Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres.

Carlos Beltrán, Jordi Marzo, Joaquim Ortega-Cerdà

J. Complex., 2016

Condition Length and Complexity for the Solution of Polynomial Systems.

Diego Armentano, Carlos Beltrán, Peter Bürgisser, Felipe Cucker, Michael Shub

Found. Comput. Math., 2016

2015

On the Number of Interference Alignment Solutions for the K-User MIMO Channel With Constant Coefficients.

Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría

IEEE Trans. Inf. Theory, 2015

A Facility Location Formulation for Stable Polynomials and Elliptic Fekete Points.

Carlos Beltrán

Found. Comput. Math., 2015

2014

A Feasibility Test for Linear Interference Alignment in MIMO Channels With Constant Coefficients.

Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría

IEEE Trans. Inf. Theory, 2014

2013

Robust Certified Numerical Homotopy Tracking.

Carlos Beltrán, Anton Leykin

Found. Comput. Math., 2013

Finding the number of feasible solutions for linear interference alignment problems.

Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Computing the degrees of freedom for arbitrary MIMO interference channels.

Oscar Gonzalez, Cristian Lameiro, Javier Vía, Carlos Beltrán, Ignacio Santamaría

Proceedings of the IEEE International Conference on Acoustics, 2013

2012

Convexity Properties of the Condition Number II.

Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub

SIAM J. Matrix Anal. Appl., 2012

On the Geometry and Topology of the Solution Variety for Polynomial System Solving.

Carlos Beltrán, Michael Shub

Found. Comput. Math., 2012

Certified Numerical Homotopy Tracking.

Carlos Beltrán, Anton Leykin

Exp. Math., 2012

On the Feasibility of Interference Alignment for the K-User MIMO Channel with Constant Coefficients

Oscar Gonzalez, Carlos Beltrán, Ignacio Santamaría

CoRR, 2012

A general test to check the feasibility of linear interference alignment.

Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

A continuation method to solve polynomial systems and its complexity.

Carlos Beltrán

Numerische Mathematik, 2011

Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems.

Carlos Beltrán, Luis Miguel Pardo

Found. Comput. Math., 2011

2010

A Note on the Finite Variance of the Averaging Function for Polynomial System Solving.

Carlos Beltrán, Michael Shub

Found. Comput. Math., 2010

2009

Convexity Properties of the Condition Number.

Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub

SIAM J. Matrix Anal. Appl., 2009

Complexity of Bezout's Theorem VII: Distance Estimates in the Condition Metric.

Carlos Beltrán, Michael Shub

Found. Comput. Math., 2009

2008

On Smale's 17th Problem: A Probabilistic Positive Solution.

Carlos Beltrán, Luis Miguel Pardo

Found. Comput. Math., 2008

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, Luis Miguel Pardo

Math. Comput., 2007

On the probability distribution of singular varieties of given corank.

Carlos Beltrán, Luis Miguel Pardo

J. Symb. Comput., 2007

Estimates on the Distribution of the Condition Number of Singular Matrices.

Carlos Beltrán, Luis Miguel Pardo

Found. Comput. Math., 2007