SearcharxivSearch

arXiv subjects

Prateek Kumar Vishwakarma

Publications and source records attributed to Prateek Kumar Vishwakarma.

14 recordsLinked to original sources

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Finite-orbit obstructions for multipliers on the polydisk

We study the closed spans of finitely many joint orbits of holomorphic multipliers on the Hardy space $H^2(\mathbb D^d)$ of the polydisk. If fewer than $d$ symbols are used, every such span has infinite codimension. The symbols may be unbounded, provided that all orbit vectors belong to the Hardy space. We give two elementary proofs. The first uses common level sets and independent point evaluations; for bounded symbols, these evaluations yield joint adjoint eigenvectors. The second uses finite Taylor sections and the nilpotent structure of truncated convolution, also known as the Jury product. For $r$ generators and $q<d$ symbols, the orbit dimension on a cube of side $n$ is $O(n^q)$, whereas the ambient dimension is $n^d$. In the bidisk we obtain the explicit codimension bound $MN-r(M+N-1)$, which is sharp for a single orbit. The coordinate multipliers attain the parameter threshold. We also explain how these obstructions relate to kernel interpolation and the established representation of dynamical frames by compressed shifts on model spaces.

math.FA

Hyperbolic distance matrix completion

A completion theory for hyperbolic distance data is developed at the interface of matrix analysis, graph theory, and hyperbolic geometry. Krein's characterization of the metric space embeddability in Lobachevsky space leads to a natural anchoring procedure that transforms the indefinite data into a positive semidefinite kernel. In analogy with positive semidefinite and Euclidean distance matrix completion, chordality of the specification graph is shown to be the necessary and sufficient condition for local Lorentz-Gram data to admit global completion. Existence is complemented by explicit constructions. For trees, we obtain geodesic-rectification and product-distance completions; for chordal graphs, the latter extends to matrix-valued transfers along clique-trees. The resulting canonical completion is characterized by sparsity of its inverse and by a maximum-absolute-determinant principle. Its metric distortion exhibits a sharp dichotomy governed by clique separator size. Applications to exact recovery from sparse hyperbolic measurements and to hierarchical and phylogenetic data are developed.

math.MG

Entrywise transforms preserving matrix positivity and non-positivity

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 classical work on entrywise preservers of 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 $3$, 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 $2 \times 2$ case where the sign preservers are extensions of power functions. These results are built on our classification of $2 \times 2$ entrywise positivity preservers over broader complex domains. Our results yield a complementary connection with a work of Belton, Guillot, Khare, and Putinar (2023) 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.

math.CA

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.

math.FA

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.

math.FA

Functional Calculi, Positivity, and Convolution of Matrices

Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within this setting, we establish results parallel to the classical theories of Pólya--Szegő, Schoenberg, Rudin, Loewner, and Horn in the context of entrywise calculus. The structure of our transform is governed by a Cayley--Hamilton-type theory valid in commutative rings of characteristic zero, together with a novel polynomial-matrix identity specific to convolution. Beyond these analytic aspects, we uncover an intrinsic connection between convolution and the Bruhat order on the symmetric group, illuminating the combinatorial aspect of this functional operation. This work extends the classical theory of entrywise positivity preservers and operator monotone functions into the convolutional setting.

math.FA

Cholesky decomposition for symmetric matrices, Riemannian geometry, and random matrices

For each $n \geq 1$ and sign pattern $ε\in \{ \pm 1 \}^n$, we introduce a cone of real symmetric matrices $LPM_n(ε)$: those with leading principal $k \times k$ minors of signs $ε_k$. These cones are pairwise disjoint and their union $LPM_n$ is an open dense cone in all symmetric matrices; they subsume positive and negative definite matrices, and symmetric (P-,) N-, PN-, almost P-, and almost N- matrices. We show that each $LPM_n$ matrix $A$ admits an uncountable family of Cholesky-type factorizations - yielding a unique lower triangular matrix $L$ with positive diagonals - with additional attractive properties: (i) each such factorization is algorithmic; and (ii) each such Cholesky map $A \mapsto L$ is a smooth diffeomorphism from $LPM_n(ε)$ onto an open Euclidean ball. We then show that (iii) the (diffeomorphic) balls $LPM_n(ε)$ are isometric Riemannian manifolds as well as isomorphic abelian Lie groups, each equipped with a translation-invariant Riemannian metric (and hence Riemannian means/barycentres). Moreover, (iv) this abelian metric group structure on each $LPM_n(ε)$ - and hence the log-Cholesky metric on Cholesky space - yields an isometric isomorphism onto a finite-dimensional Euclidean space. The complex version of this also holds. In the latter part, we show that the abelian group $PD_n$ of positive definite matrices, with its bi-invariant log-Cholesky metric, is precisely the identity-component of a larger group with an alternate metric: the open dense cone $LPM_n$. This also holds for Hermitian matrices over several subfields $\mathbb{F} \subseteq \mathbb{C}$. As a result, (v) the groups $LPM_n^{\mathbb{F}}$ and $LPM_\infty^{\mathbb{F}}$ admit a rich probability theory, and the cones $LPM_n(ε), TPM_n(ε)$ admit Wishart densities with signed Bartlett decompositions.

math.RA

Cholesky decomposition for symmetric matrices over finite fields

Inspired by the seminal work of André-Louis Cholesky -- whose contributions remain crucial in broader sciences even after more than a century -- Cooper, Hanna and Whitlatch (2024) developed a theory of positive matrices over finite fields, and Khare and Vishwakarma (2025) described a general Cholesky factorization for a dense sub-family of the cone of Hermitian matrices over real/complex fields, whose leading principal minors (LPM) are nonzero. Building on this, we develop a parallel theory within the finite field setting. Specifically $(i)$ we extend the general Cholesky factorization to the LPM cone over finite fields which has asymptotic density $1$. We show that $(ii)$ this factorization is compatible with the entrywise Frobenius map, recently studied in the context of positivity preservers by Guillot, Gupta, Vishwakarma, and Yip [J. Algebra, 2025]. We also $(iii)$ leverage the Cholesky-structures to define meaningful group operations on the matrix cone, and as an application $(iv)$ enumerate sub-cones of LPM matrices using our general Cholesky factorizations.

math.CO

Positivity preservers over finite fields

We resolve an algebraic version of Schoenberg's celebrated theorem [Duke Math.J., 1942] characterizing entrywise matrix transforms that preserve positive definiteness. Compared to the classical real and complex settings, we consider matrices with entries in a finite field and obtain a complete characterization of such preservers for matrices of a fixed dimension. When the dimension of the matrices is at least $3$, we prove that, surprisingly, the positivity preservers are precisely the positive multiples of the field's automorphisms. We also obtain characterizations of preservers for matrices of dimension $2$ over a finite field with $q$ elements, unless $q \equiv 1 \pmod 4$ and $q$ is not a square. Our proofs build on several novel connections between positivity preservers and field automorphisms via the works of Weil, Carlitz, and Muzychuk-Kovács, and via the structure of cliques in Paley graphs.

math.RA

Chevalley operations on TNN Grassmannians

Lusztig showed that invertible totally nonnegative (TNN) matrices form a semigroup generated by positive diagonal matrices and Chevalley generators. From its Grassmann analogue, we introduce Chevalley operations on index sets, which we show have a rich variety of applications. We first completely classify all inequalities that are quadratic in Plucker coordinates over the TNN part of the Grassmannian: \[\sum_{I,J}c_{I,J}Δ_IΔ_J\ge 0\quad over\quad \mathrm{Gr}^{\ge 0}(m,m+n)\] where each $c_{I,J}$ is real, and $Δ_I,Δ_J$ are Plucker coordinates with a homogeneity condition. Using an idea of Gekhtman-Shapiro-Vainshtein, we also explain how our Chevalley operations can be motivated from cluster mutations, and lead to working in Grassmannians of smaller dimension, akin to cluster algebras. We then present several applications of Chevalley operations. First, we obtain certificates for the above inequalities via sums of coefficients $c_{I,J}$ over 321-avoiding permutations and involutions; we believe this refined results of Rhoades-Skandera for TNN-matrix inequalities via their Temperley-Lieb immanant idea. Second, we provide a novel proof via Chevalley operations of Lam's log-supermodularity of Plucker coordinates. This has several consequences: (a) Each positroid, corresponding to the positroid cells in Postnikov's decomposition of the TNN Grassmannian, is a distributive lattice. (b) It also yields numerical positivity in the main result of Lam-Postnikov-Pylyavskyy. (c) We show the coordinatewise monotonicity of ratios of Schur polynomials, first proved by Khare-Tao and which is the key result they use to obtain quantitative estimates for positivity preservers. Third, we employ Chevalley operations to show that the majorization order over partitions implicates a partial order for induced character immanants over TNN matrices, proved originally by Skandera-Soskin.

math.CO

Plücker inequalities for weakly separated coordinates in totally nonnegative Grassmannian

We show that the partial sums of the long Plücker relations for pairs of weakly separated Plücker coordinates oscillate around $0$ on the totally nonnegative part of the Grassmannian. Our result generalizes the classical oscillating inequalities by Gantmacher--Krein (1941) and recent results on totally nonnegative matrix inequalities by Fallat--Vishwakarma (2023). In fact we obtain a characterization of weak separability, by showing that no other pair of Plücker coordinates satisfies this property. Weakly separated sets were initially introduced by Leclerc and Zelevinsky and are closely connected with the cluster algebra of the Grassmannian. Moreover, our work connects several fundamental objects such as weak separability, Temperley--Lieb immanants, and Plücker relations, and provides a very general and natural class of additive determinantal inequalities on the totally nonnegative part of the Grassmannian.

math.CO

Inequalities for totally nonnegative matrices: Gantmacher--Krein, Karlin, and Laplace

A real linear combination of products of minors which is nonnegative over all totally nonnegative (TN) matrices is called a determinantal inequality for these matrices. It is referred to as multiplicative when it compares two collections of products of minors and additive otherwise. Set theoretic operations preserving the class of TN matrices naturally translate into operations preserving determinantal inequalities in this class. We introduce index-row (and index-column) operations that act directly on all determinantal inequalities for TN matrices, and yield further inequalities for these matrices. These operations assist in revealing novel additive inequalities for TN matrices embedded in the classical identities due to Laplace $[$Mem$.$ Acad$.$ Sciences Paris $1772]$ and Karlin $(1968).$ In particular, for any square TN matrix $A,$ these derived inequalities generalize -- to every $i^{\mbox{th}}$ row of $A$ and $j^{\mbox{th}}$ column of ${\rm adj} A$ -- the classical Gantmacher--Krein fluctuating inequalities $(1941)$ for $i=j=1.$ Furthermore, our index-row/column operations reveal additional undiscovered fluctuating inequalities for TN matrices. The introduced index-row/column operations naturally birth an algorithm that can detect certain determinantal expressions that do not form an inequality for TN matrices. However, the algorithm completely characterizes the multiplicative inequalities comparing products of pairs of minors. Moreover, the underlying index-row/column operations add that these inequalities are offshoots of certain "complementary/higher" ones. These novel results seem very natural, and in addition thoroughly describe and enrich the classification of these multiplicative inequalities due to Fallat--Gekhtman--Johnson $[$Adv$.$ Appl$.$ Math$.$ $2003]$ and later Skandera $[$J$.$ Algebraic Comb$.$ $2004].$

math.CA

Positivity preservers forbidden to operate on diagonal blocks

The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic functions (i.e., power series with nonnegative coefficients) preserve positivity on matrices of all dimensions. A famous result of Schoenberg and of Rudin [Duke Math. J. 1942, 1959] shows the converse: there are no other such functions. Motivated by modern applications, Guillot and Rajaratnam [Trans. Amer. Math. Soc. 2015] classified the entrywise positivity preservers in all dimensions, which act only on the off-diagonal entries. These two results are at "opposite ends", and in both cases the preservers have to be absolutely monotonic. We complete the classification of positivity preservers that act entrywise except on specified "diagonal/principal blocks", in every case other than the two above. (In fact we achieve this in a more general framework.) This yields the first examples of dimension-free entrywise positivity preservers - with certain forbidden principal blocks - that are not absolutely monotonic.

math.CA