Dominique Guillot
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
Dominique Guillot has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Apoorva Khare
Indian Institute of Science, Bengaluru, India
21 shared publications - Mihai Putinar
University of California at Santa Barbara
14 shared publications - Alexander C. R. Belton
Department of Mathematics and Statistics, Lancaster University, Lancaster, UK
13 shared publications - Bala Rajaratnam
University of California, Davis, USA
6 shared publications - Javad Mashreghi2 shared publications
- Kris Hollingsworth
School of Mathematics, University of Minnesota, Minneapolis, USA
2 shared publications
Latest Publications
- Open Access
- 9 June 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (6)
Oppenheim–Schur inequalities for causal products
We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting. Our approach highlights structural parallels between entrywise and convolution‐based matrix operations, revealing how positivity constraints interact with causality. Building on this perspective, we introduce a broader family of causal matrix products and prove unified inequalities that simultaneously recover the classical Schur and Oppenheim bounds, as well as their convolutional Jury counterparts. These results provide a common framework for understanding positivity‐preserving matrix products and suggest further connections between classical matrix analysis and causal operator structures.
- 9 June 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (6)
Open AccessOppenheim–Schur inequalities for causal products
We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting. Our approach highlights structural parallels between entrywise and convolution‐based matrix operations, revealing how positivity constraints interact with causality. Building on this perspective, we introduce a broader family of causal matrix products and prove unified inequalities that simultaneously recover the classical Schur and Oppenheim bounds, as well as their convolutional Jury counterparts. These results provide a common framework for understanding positivity‐preserving matrix products and suggest further connections between classical matrix analysis and causal operator structures.
- Open Access
- 6 May 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (5)
Entrywise transforms preserving matrix positivity and nonpositivity
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers . Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this problem in the harder fixed‐dimensional setting, extending a similar recent classification of sign preservers obtained for matrices over finite fields. When the matrix dimension is fixed and at least , we show that the sign preservers are precisely the positive scalar multiples of the continuous automorphisms of the underlying field. This is in contrast to the case where the sign preservers are extensions of power functions. These results are built on our classification of entrywise positivity preservers over broader complex domains. Our results yield a complementary connection with recent work of Belton, Guillot, Khare, and Putinar on negativity‐preserving transforms. We also extend our sign preserver results to matrices with a structure of zeros, as studied by Guillot, Khare, and Rajaratnam for the entrywise positivity preserver problem. Finally, in the spirit of sign preservers, we address a natural extension to monotone maps, classically studied by Loewner and many others.
- 6 May 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (5)
Open AccessEntrywise transforms preserving matrix positivity and nonpositivity
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers . Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this problem in the harder fixed‐dimensional setting, extending a similar recent classification of sign preservers obtained for matrices over finite fields. When the matrix dimension is fixed and at least , we show that the sign preservers are precisely the positive scalar multiples of the continuous automorphisms of the underlying field. This is in contrast to the case where the sign preservers are extensions of power functions. These results are built on our classification of entrywise positivity preservers over broader complex domains. Our results yield a complementary connection with recent work of Belton, Guillot, Khare, and Putinar on negativity‐preserving transforms. We also extend our sign preserver results to matrices with a structure of zeros, as studied by Guillot, Khare, and Rajaratnam for the entrywise positivity preserver problem. Finally, in the spirit of sign preservers, we address a natural extension to monotone maps, classically studied by Loewner and many others.
- Open Access
- 9 April 2026
- Published by Wiley in Proceedings of the London Mathematical Society
- Vol. 132 (4) , e70147
Negativity‐preserving transforms of tuples of symmetric matrices
Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining recent advances in matrix analysis with some novel arguments relying on well‐chosen test matrices, Sidon sets from number theory, and analytic properties of absolutely monotone functions. We continue with the analogous classification in the multi‐variable setting, revealing for the first time a striking separation of variables, with absolute monotonicity on one side and only homotheties on the other. We conclude with the complex analogue of this result.
- 9 April 2026
- Published by Wiley in Proceedings of the London Mathematical Society
- Vol. 132 (4) , e70147
Open AccessNegativity‐preserving transforms of tuples of symmetric matrices
Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining recent advances in matrix analysis with some novel arguments relying on well‐chosen test matrices, Sidon sets from number theory, and analytic properties of absolutely monotone functions. We continue with the analogous classification in the multi‐variable setting, revealing for the first time a striking separation of variables, with absolute monotonicity on one side and only homotheties on the other. We conclude with the complex analogue of this result.
- Open Access
Oppenheim--Schur inequalities for causal products
We establish a class of Oppenheim--Schur-type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend to a causal convolutional setting the classical Schur and Oppenheim inequalities associated with the Hadamard product. Our approach highlights structural parallels between entrywise and convolution-based matrix operations, revealing how positivity constraints interact with causality. Building on this perspective, we introduce a broader family of causal matrix products and prove unified inequalities that simultaneously recover the classical Schur and Oppenheim bounds as well as their convolutional Jury counterparts. These results provide a common framework for understanding positivity-preserving matrix products and suggest further connections between classical matrix analysis and causal operator structures.
Open AccessOppenheim--Schur inequalities for causal products
We establish a class of Oppenheim--Schur-type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend to a causal convolutional setting the classical Schur and Oppenheim inequalities associated with the Hadamard product. Our approach highlights structural parallels between entrywise and convolution-based matrix operations, revealing how positivity constraints interact with causality. Building on this perspective, we introduce a broader family of causal matrix products and prove unified inequalities that simultaneously recover the classical Schur and Oppenheim bounds as well as their convolutional Jury counterparts. These results provide a common framework for understanding positivity-preserving matrix products and suggest further connections between classical matrix analysis and causal operator structures.
- Open Access
Sharp lower bounds for generalized operator products
We consider general bilinear products defined by positive semidefinite matrices. Typically non-commutative, non-associative, and non-unital, these products preserve positivity and include the classical Hadamard, Kronecker, and convolutional products as special cases. We prove that every such product satisfies a sharp nonzero lower bound in the Loewner order, generalizing previous results of Vybíral [Adv. Math., 2020] and Khare [Proc. Amer. Math. Soc., 2021] that were obtained in the special case of the Hadamard product. Our results naturally extend to Hilbert spaces for a family of products parametrized by positive trace-class operators, providing a lower bound in the Loewner order for such general products, including for the Hilbert tensor product.
Open AccessSharp lower bounds for generalized operator products
We consider general bilinear products defined by positive semidefinite matrices. Typically non-commutative, non-associative, and non-unital, these products preserve positivity and include the classical Hadamard, Kronecker, and convolutional products as special cases. We prove that every such product satisfies a sharp nonzero lower bound in the Loewner order, generalizing previous results of Vybíral [Adv. Math., 2020] and Khare [Proc. Amer. Math. Soc., 2021] that were obtained in the special case of the Hadamard product. Our results naturally extend to Hilbert spaces for a family of products parametrized by positive trace-class operators, providing a lower bound in the Loewner order for such general products, including for the Hilbert tensor product.
- 25 February 2025
- Published by Springer Nature
- p. 310-322
Bayesian Regularized Iterative Soft Thresholding Algorithm
- 25 February 2025
- Published by Springer Nature
- p. 310-322
Bayesian Regularized Iterative Soft Thresholding Algorithm
- Open Access
Preserving positivity for rank-constrained matrices
Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959]. Following their work, it is well-known that entrywise functions preserving Loewner positivity in all dimensions are precisely the absolutely monotonic functions. However, there are strong theoretical and practical motivations to study functions preserving positivity in a fixed dimension $n$. Such characterizations for a fixed value of $n$ are difficult to obtain, and in fact are only known in the $2 \times 2$ case. In this paper, using a novel and intuitive approach, we study entrywise functions preserving positivity on distinguished submanifolds inside the cone obtained by imposing rank constraints. These rank constraints are prevalent in applications, and provide a natural way to relax the elusive original problem of preserving positivity in a fixed dimension. In our main result, we characterize entrywise functions mapping $n \times n$ positive semidefinite matrices of rank at most $l$ into positive semidefinite matrices of rank at most $k$ for $1 \leq l \leq n$ and $1 \leq k < n$. We also demonstrate how an important necessary condition for preserving positivity by Horn and Loewner [Trans. Amer. Math. Soc. 136, 1969] can be significantly generalized by adding rank constraints. Finally, our techniques allow us to obtain an elementary proof of the classical characterization of functions preserving positivity in all dimensions obtained by Schoenberg and Rudin.Open AccessPreserving positivity for rank-constrained matrices
Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959]. Following their work, it is well-known that entrywise functions preserving Loewner positivity in all dimensions are precisely the absolutely monotonic functions. However, there are strong theoretical and practical motivations to study functions preserving positivity in a fixed dimension $n$. Such characterizations for a fixed value of $n$ are difficult to obtain, and in fact are only known in the $2 \times 2$ case. In this paper, using a novel and intuitive approach, we study entrywise functions preserving positivity on distinguished submanifolds inside the cone obtained by imposing rank constraints. These rank constraints are prevalent in applications, and provide a natural way to relax the elusive original problem of preserving positivity in a fixed dimension. In our main result, we characterize entrywise functions mapping $n \times n$ positive semidefinite matrices of rank at most $l$ into positive semidefinite matrices of rank at most $k$ for $1 \leq l \leq n$ and $1 \leq k < n$. We also demonstrate how an important necessary condition for preserving positivity by Horn and Loewner [Trans. Amer. Math. Soc. 136, 1969] can be significantly generalized by adding rank constraints. Finally, our techniques allow us to obtain an elementary proof of the classical characterization of functions preserving positivity in all dimensions obtained by Schoenberg and Rudin. - Open Access
Matrix positivity preservers in fixed dimension. II: positive definiteness and strict monotonicity of Schur function ratios
We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that, given a real polynomial with positive coefficients that is perturbed by adding a higher-degree monomial, there exists a negative lower bound for the coefficient of the perturbation which characterizes when the perturbed polynomial remains positivity preserving. We show here that, if the perturbation coefficient is strictly greater than this bound then the transformed matrix becomes positive definite given a simple genericity condition that can be readily verified. We identity a slightly stronger genericity condition that ensures positive definiteness occurs at the boundary. The analysis is complemented by computing the rank of the transformed matrix in terms of the location of the original matrix in a Schubert cell-type stratification that we have introduced and explored previously. The proofs require enhancing to strictness a Schur monotonicity result of Khare and Tao, to show that the ratio of Schur polynomials is strictly increasing along each coordinate on the positive orthant and non-decreasing on its closure whenever the defining tuples satisfy a coordinate-wise domination condition.
Open AccessMatrix positivity preservers in fixed dimension. II: positive definiteness and strict monotonicity of Schur function ratios
We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that, given a real polynomial with positive coefficients that is perturbed by adding a higher-degree monomial, there exists a negative lower bound for the coefficient of the perturbation which characterizes when the perturbed polynomial remains positivity preserving. We show here that, if the perturbation coefficient is strictly greater than this bound then the transformed matrix becomes positive definite given a simple genericity condition that can be readily verified. We identity a slightly stronger genericity condition that ensures positive definiteness occurs at the boundary. The analysis is complemented by computing the rank of the transformed matrix in terms of the location of the original matrix in a Schubert cell-type stratification that we have introduced and explored previously. The proofs require enhancing to strictness a Schur monotonicity result of Khare and Tao, to show that the ratio of Schur polynomials is strictly increasing along each coordinate on the positive orthant and non-decreasing on its closure whenever the defining tuples satisfy a coordinate-wise domination condition.
- 5 January 2023
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 150 (1) , 83-158
Totally positive kernels, Pólya frequency functions, and their transforms
- 5 January 2023
- Published by Springer Nature in Journal d'Analyse Mathématique
- Vol. 150 (1) , 83-158
Totally positive kernels, Pólya frequency functions, and their transforms
- Open Access
Preservers of totally positive kernels and Polya frequency functions
Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial transforms, we unveil an ubiquitous separation between discrete and continuous spectra of such inner fractional powers. Classical works of Schoenberg, Karlin, Hirschman, and Widder are completed by our classification. Concepts of probability theory, multivariate statistics, and group representation theory naturally enter into the picture.
Open AccessPreservers of totally positive kernels and Polya frequency functions
Fractional powers and polynomial maps preserving structured totally positive matrices, one-sided Polya frequency functions, or totally positive kernels are treated from a unifying perspective. Besides the stark rigidity of the polynomial transforms, we unveil an ubiquitous separation between discrete and continuous spectra of such inner fractional powers. Classical works of Schoenberg, Karlin, Hirschman, and Widder are completed by our classification. Concepts of probability theory, multivariate statistics, and group representation theory naturally enter into the picture.