Himanshu Gupta
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
Himanshu Gupta has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Aida Abiad
Eindhoven University of Technology, Vrije Universiteit Brussel
1 shared publication - Boris Brimkov
Slippery Rock University, USA
1 shared publication - Chi Hoi Yip
Georgia Institute of Technology
1 shared publication - Dominique Guillot
Department of Mathematical Sciences University of Delaware Newark Delaware USA
1 shared publication Jane Breen
Ontario Tech University
1 shared publication- Prateek Kumar Vishwakarma
Département de mathématiques et de statistique Université Laval Quebec City Quebec Canada
1 shared publication
Latest Publications
- 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.
- 5 May 2022
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- p. 280-294
Constructions of cospectral graphs with different zero forcing numbers
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the spectra of several types of associated matrices with a graph. In particular, we consider standard zero forcing, positive semidefinite zero forcing, and skew zero forcing and provide constructions of infinite families of pairs of cospectral graphs, which have different values for these numbers. We explore several methods for obtaining these cospectral graphs including using graph products, graph joins, and graph switching. Among these, we provide a construction involving regular adjacency cospectral graphs; the regularity of this construction also implies cospectrality with respect to several other matrices including the Laplacian, signless Laplacian, and normalized Laplacian. We also provide a construction where pairs of cospectral graphs can have an arbitrarily large difference between their zero forcing numbers.
- 5 May 2022
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- p. 280-294
Constructions of cospectral graphs with different zero forcing numbers
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper, we show that several NP-hard zero forcing numbers are not characterized by the spectra of several types of associated matrices with a graph. In particular, we consider standard zero forcing, positive semidefinite zero forcing, and skew zero forcing and provide constructions of infinite families of pairs of cospectral graphs, which have different values for these numbers. We explore several methods for obtaining these cospectral graphs including using graph products, graph joins, and graph switching. Among these, we provide a construction involving regular adjacency cospectral graphs; the regularity of this construction also implies cospectrality with respect to several other matrices including the Laplacian, signless Laplacian, and normalized Laplacian. We also provide a construction where pairs of cospectral graphs can have an arbitrarily large difference between their zero forcing numbers.