João Gouveia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
João Gouveia has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Rekha R. Thomas
Department of Mathematics, University of Washington, Seattle, USA
15 shared publications - Pablo A. Parrilo
Massachusetts Institute of Technology
12 shared publications - Richard Z. Robinson
Department of Mathematics, University of Washington, Seattle, USA
9 shared publications Rekha R. Thomas
7 shared publications- Antonio Macchia
Fachbereich Mathematik und Informatik, Freie Universität Berlin, Berlin, Germany
6 shared publications - Rekha R. Thomas
University of Washington
5 shared publications
Latest Publications
- 16 May 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-27
Conformal Rigidity and Spectral Embeddings of Graphs
- 16 May 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-27
Conformal Rigidity and Spectral Embeddings of Graphs
- 12 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (2) , 680-705
Determining Inscribability of Polytopes via Rank Minimization Based on Slack Matrices
A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. ...
- 12 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 40 (2) , 680-705
Determining Inscribability of Polytopes via Rank Minimization Based on Slack Matrices
A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. ...
- Open Access
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (1&2) , 227-242
Minimal Hyperbolic Polynomials and Ranks of Homogeneous Cones
The starting point of this paper is the computation of minimal hyperbolic polynomials of duals of cones arising from chordal sparsity patterns. From that, we investigate the relation between ranks of homogeneous cones and their minimal polynomials. Along the way, we answer in the negative a question posed in an earlier paper and show examples of homogeneous cones that cannot be realized as rank-one generated (ROG) hyperbolicity cones.
- 1 January 2026
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (1&2) , 227-242
Open AccessMinimal Hyperbolic Polynomials and Ranks of Homogeneous Cones
The starting point of this paper is the computation of minimal hyperbolic polynomials of duals of cones arising from chordal sparsity patterns. From that, we investigate the relation between ranks of homogeneous cones and their minimal polynomials. Along the way, we answer in the negative a question posed in an earlier paper and show examples of homogeneous cones that cannot be realized as rank-one generated (ROG) hyperbolicity cones.
- 14 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (4) , 825-847
A Yannakakis- Type Theorem for Lifts of Affine Semigroups
Yannakakis’ theorem relating the extension complexity of a polytope to the size of a nonnegative factorization of its slack matrix is a seminal result in the study of lifts of convex sets. Inspired by this result and the importance of lifts in the setting of integer programming, we show that a similar result holds for the discrete analogue of convex polyhedral cones—affine semigroups. We define the notions of the integer slack matrix and a lift of an affine semigroup. We show that many of the characterizations of the slack matrix in the convex cone setting have analogous results in the affine semigroup setting. We also show how slack matrices of affine semigroups can be used to obtain new results in the study of nonnegative integer rank of nonnegative integer matrices.
- 14 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Algebra and Geometry
- Vol. 9 (4) , 825-847
A Yannakakis- Type Theorem for Lifts of Affine Semigroups
Yannakakis’ theorem relating the extension complexity of a polytope to the size of a nonnegative factorization of its slack matrix is a seminal result in the study of lifts of convex sets. Inspired by this result and the importance of lifts in the setting of integer programming, we show that a similar result holds for the discrete analogue of convex polyhedral cones—affine semigroups. We define the notions of the integer slack matrix and a lift of an affine semigroup. We show that many of the characterizations of the slack matrix in the convex cone setting have analogous results in the affine semigroup setting. We also show how slack matrices of affine semigroups can be used to obtain new results in the study of nonnegative integer rank of nonnegative integer matrices.
- 14 October 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (4)
Elementary characterization of Bargmann invariants
- 14 October 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (4)
Elementary characterization of Bargmann invariants
- Open Access
Conformal Rigidity and Spectral Embeddings of Graphs
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular graphs are known to be conformally rigid. We establish new results using the connection between conformal rigidity and edge-isometric spectral embeddings of the graph. All $1$-walk regular graphs are conformally rigid, a consequence of a stronger property of their embeddings. Using symmetries of the graph, we establish two related characterizations of when a vertex-transitive graph is conformally rigid. This provides a necessary and sufficient condition for a Cayley graph on an abelian group to be conformally rigid. As an application we exhibit an infinite family of conformally rigid circulants. Our symmetry technique can be interpreted in the language of semidefinite programming which provides another criterion for conformal rigidity in terms of edge orbits. The paper also describes a number of explicit conformally rigid graphs whose conformal rigidity is not yet explained by the existing theory.
Open AccessConformal Rigidity and Spectral Embeddings of Graphs
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular graphs are known to be conformally rigid. We establish new results using the connection between conformal rigidity and edge-isometric spectral embeddings of the graph. All $1$-walk regular graphs are conformally rigid, a consequence of a stronger property of their embeddings. Using symmetries of the graph, we establish two related characterizations of when a vertex-transitive graph is conformally rigid. This provides a necessary and sufficient condition for a Cayley graph on an abelian group to be conformally rigid. As an application we exhibit an infinite family of conformally rigid circulants. Our symmetry technique can be interpreted in the language of semidefinite programming which provides another criterion for conformal rigidity in terms of edge orbits. The paper also describes a number of explicit conformally rigid graphs whose conformal rigidity is not yet explained by the existing theory.
- 26 July 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 44 (3) , 1096-1121
Self-Dual Polyhedral Cones and Their Slack Matrices
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the underlying cone is irreducible, then the corresponding PSD slacks are not only doubly nonnegative matrices (DNN) but are extreme rays of the cone of DNN matrices, which correspond to a family of extreme rays not previously described. More surprisingly, we show that, unless the cone is simplicial, PSD slacks not only fail to be completely positive matrices but they also lie outside the cone of completely positive semidefinite matrices. Finally, we show how one can use semidefinite programming to probe the existence of self-dual cones with given combinatorics. Our results are given for polyhedral cones but we also discuss some consequences for negatively self-polar polytopes.
- 26 July 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 44 (3) , 1096-1121
Self-Dual Polyhedral Cones and Their Slack Matrices
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the underlying cone is irreducible, then the corresponding PSD slacks are not only doubly nonnegative matrices (DNN) but are extreme rays of the cone of DNN matrices, which correspond to a family of extreme rays not previously described. More surprisingly, we show that, unless the cone is simplicial, PSD slacks not only fail to be completely positive matrices but they also lie outside the cone of completely positive semidefinite matrices. Finally, we show how one can use semidefinite programming to probe the existence of self-dual cones with given combinatorics. Our results are given for polyhedral cones but we also discuss some consequences for negatively self-polar polytopes.
- 9 March 2023
- Published by Springer Nature in Information Geometry
- Vol. 6 (1) , 293-326
The face lattice of the set of reduced density matrices and its coatoms
- 9 March 2023
- Published by Springer Nature in Information Geometry
- Vol. 6 (1) , 293-326
The face lattice of the set of reduced density matrices and its coatoms
- Open Access
Self-dual polyhedral cones and their slack matrices
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the underlying cone is irreducible, then the corresponding PSD slacks are not only doubly nonnegative matrices (DNN) but are extreme rays of the cone of DNN matrices, which correspond to a family of extreme rays not previously described. More surprisingly, we show that, unless the cone is simplicial, PSD slacks not only fail to be completely positive matrices but they also lie outside the cone of completely positive semidefinite matrices. Finally, we show how one can use semidefinite programming to probe the existence of self-dual cones with given combinatorics. Our results are given for polyhedral cones but we also discuss some consequences for negatively self-polar polytopes.
Open AccessSelf-dual polyhedral cones and their slack matrices
We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the underlying cone is irreducible, then the corresponding PSD slacks are not only doubly nonnegative matrices (DNN) but are extreme rays of the cone of DNN matrices, which correspond to a family of extreme rays not previously described. More surprisingly, we show that, unless the cone is simplicial, PSD slacks not only fail to be completely positive matrices but they also lie outside the cone of completely positive semidefinite matrices. Finally, we show how one can use semidefinite programming to probe the existence of self-dual cones with given combinatorics. Our results are given for polyhedral cones but we also discuss some consequences for negatively self-polar polytopes.
- 3 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 64 (4) , 866-918
Lifting for Simplicity: Concise Descriptions of Convex Sets
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many ...
- 3 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 64 (4) , 866-918
Lifting for Simplicity: Concise Descriptions of Convex Sets
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many ...