Searcharxiv⌕ Search

arXiv subjects

Apoorva Khare

Publications and source records attributed to Apoorva Khare.

At least 73 records · Page 4Linked to original sources

Standard parabolic subsets of highest weight modules

In this paper we study certain fundamental and distinguished subsets of weights of an arbitrary highest weight module over a complex semisimple Lie algebra. These sets ${\rm wt}_J \mathbb{V}^λ$ are defined for each highest weight module $\mathbb{V}^λ$ and each subset $J$ of simple roots; we term them "standard parabolic subsets of weights". It is shown that for any highest weight module, the sets of simple roots whose corresponding standard parabolic subsets of weights are equal form intervals in the poset of subsets of the set of simple roots under containment. Moreover, we provide closed-form expressions for the maximum and minimum elements of the aforementioned intervals for all highest weight modules $\mathbb{V}^λ$ over semisimple Lie algebras $\mathfrak{g}$. Surprisingly, these formulas only require the Dynkin diagram of $\mathfrak{g}$ and the integrability data of $\mathbb{V}^λ$. As a consequence, we extend classical work by Satake, Borel-Tits, Vinberg, and Casselman, as well as recent variants by Cellini-Marietti to all highest weight modules. We further compute the dimension, stabilizer, and vertex set of standard parabolic faces of highest weight modules, and show that they are completely determined by the aforementioned closed-form expressions. We also compute the $f$-polynomial and a minimal half-space representation of the convex hull of the set of weights. These results were recently shown for the adjoint representation of a simple Lie algebra, but analogues remain unknown for any other finite- or infinite-dimensional highest weight module. Our analysis is uniform and type-free, across all semisimple Lie algebras and for arbitrary highest weight modules.

math.RT↗

Model-free consistency of graph partitioning

In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic consistency (i.e., convergence with probability $1$ as the sample size goes to infinity under a fixed probability model) follow from our notion of structural consistency. By formulating structural consistency as a continuity result on the graphon space, we obtain robust results that are completely independent of the data generating mechanism. In particular, our results apply in settings where observations are not independent, thereby significantly generalizing the common probabilistic approach where data are assumed to be i.i.d. In order to make precise the notion of structural consistency of graph partitioning, we begin by extending the theory of graph limits to include vertex colored graphons. We then define continuous node-level statistics and prove that graph partitioning based on such statistics is consistent. Finally, we derive the structural consistency of commonly used clustering algorithms in a general model-free setting. These include clustering based on local graph statistics such as homomorphism densities, as well as the popular spectral clustering using the normalized Laplacian. We posit that proving the continuity of clustering algorithms in the graph limit topology can stand on its own as a more robust form of model-free consistency. We also believe that the mathematical framework developed in this paper goes beyond the study of clustering algorithms, and will guide the development of similar model-free frameworks to analyze other procedures in the broader mathematical sciences.

math.CO↗

Schur polynomials and matrix positivity preservers

A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefiniteness (psd) when applied entrywise to matrices of arbitrary dimension. Schoenberg's work has continued to attract significant interest, including renewed recent attention due to applications in high-dimensional statistics. However, despite a great deal of effort in the area, an effective characterization of entrywise functions preserving positivity in a fixed dimension remains elusive to date. As a first step, we characterize new classes of polynomials preserving positivity in fixed dimension. The proof of our main result is representation theoretic, and employs Schur polynomials. An alternate, variational approach also leads to several interesting consequences including (a) a hitherto unexplored Schubert cell-type stratification of the cone of psd matrices, (b) new connections between generalized Rayleigh quotients of Hadamard powers and Schur polynomials, and (c) a description of the joint kernels of Hadamard powers.

math.CO↗

Matrix positivity preservers in fixed dimension. I

A classical theorem proved in 1942 by I.J. Schoenberg describes all real-valued functions that preserve positivity when applied entrywise to positive semidefinite matrices of arbitrary size; such functions are necessarily analytic with non-negative Taylor coefficients. Despite the great deal of interest generated by this theorem, a characterization of functions preserving positivity for matrices of fixed dimension is not known. In this paper, we provide a complete description of polynomials of degree $N$ that preserve positivity when applied entrywise to matrices of dimension $N$. This is the key step for us then to obtain negative lower bounds on the coefficients of analytic functions so that these functions preserve positivity in a prescribed dimension. The proof of the main technical inequality is representation theoretic, and employs the theory of Schur polynomials. Interpreted in the context of linear pencils of matrices, our main results provide a closed-form expression for the lowest critical value, revealing at the same time an unexpected spectral discontinuity phenomenon. Tight linear matrix inequalities for Hadamard powers of matrices and a sharp asymptotic bound for the matrix-cube problem involving Hadamard powers are obtained as applications. Positivity preservers are also naturally interpreted as solutions of a variational inequality involving generalized Rayleigh quotients. This optimization approach leads to a novel description of the simultaneous kernels of Hadamard powers, and a family of stratifications of the cone of positive semidefinite matrices.

math.CA↗

Faces and maximizer subsets of highest weight modules

In this paper we study general highest weight modules $\mathbb{V}^λ$ over a complex finite-dimensional semisimple Lie algebra $\mathfrak{g}$. We present three formulas for the set of weights of a large family of modules $\mathbb{V}^λ$, which include but are not restricted to all simple modules and all parabolic Verma modules. These formulas are direct and do not involve cancellations, and were not previously known in the literature. Our results extend the notion of the Weyl polytope to general highest weight $\mathfrak{g}$-modules $\mathbb{V}^λ$. We also show that for all simple modules, the convex hull of the weights is a $W_J$-invariant polyhedron for some parabolic subgroup $W_J$. We compute its vertices, faces, and symmetries - more generally, we also do this for all parabolic Verma modules, and for all modules $\mathbb{V}^λ$ with highest weight $λ$ not on a simple root hyperplane. To show our results, we extend the notion of convexity to arbitrary additive subgroups $\mathbb{A} \subset (\mathbb{R},+)$ of coefficients. Our techniques enable us to completely classify "weak $\mathbb{A}$-faces" of the support sets ${\rm wt}(\mathbb{V}^λ)$, in the process extending classical results of Satake, Borel-Tits, Vinberg, and Casselman, as well as modern variants by Chari-Dolbin-Ridenour and Cellini-Marietti, to general highest weight modules.

math.RT↗

Drinfeld-Hecke algebras over cocommutative algebras

If A is a cocommutative algebra with coproduct, then so is the smash product algebra of a symmetric algebra Sym(V) with A, where V is an A-module. Such smash product algebras, with A a group ring or a Lie algebra, have families of deformations that have been studied widely in the literature; examples include symplectic reflection algebras and infinitesimal Hecke algebras. We introduce a family of deformations of these smash product algebras for general A, and characterize the PBW property. We then characterize the Jacobi identity for "grouplike" algebras (that include group rings and the nilCoxeter algebra), and precisely identify the PBW deformations in the example where A is the nilCoxeter algebra. We end with the more prominent case - where A is a Hopf algebra. We show the equivalence of several versions of the "deformed" relations in the smash product, and identify the PBW deformations which are Hopf algebras as well.

math.RA↗

Preserving positivity for matrices with sparsity constraints

Functions preserving Loewner positivity when applied entrywise to positive semidefinite matrices have been widely studied in the literature. Following the work of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J. 26], and others, it is well-known that functions preserving positivity for matrices of all dimensions are absolutely monotonic (i.e., analytic with nonnegative Taylor coefficients). In this paper, we study functions preserving positivity when applied entrywise to sparse matrices, with zeros encoded by a graph $G$ or a family of graphs $G_n$. Our results generalize Schoenberg and Rudin's results to a modern setting, where functions are often applied entrywise to sparse matrices in order to improve their properties (e.g. better conditioning). The only such result known in the literature is for the complete graph $K_2$. We provide the first such characterization result for a large family of non-complete graphs. Specifically, we characterize functions preserving Loewner positivity on matrices with zeros according to a tree. These functions are multiplicatively midpoint-convex and super-additive. Leveraging the underlying sparsity in matrices thus admits the use of functions which are not necessarily analytic nor absolutely monotonic. We further show that analytic functions preserving positivity on matrices with zeros according to trees can contain arbitrarily long sequences of negative coefficients, thus obviating the need for absolute monotonicity in a very strong sense. This result leads to the question of exactly when absolute monotonicity is necessary when preserving positivity for an arbitrary class of graphs. We then provide a stronger condition in terms of the numerical range of all symmetric matrices, such that functions satisfying this condition on matrices with zeros according to any family of graphs with unbounded degrees are necessarily absolutely monotonic.

math.FA↗

On Category $\mathcal{O}$ over triangular Generalized Weyl Algebras

We analyze the BGG Category $\mathcal{O}$ over a large class of generalized Weyl algebras (henceforth termed GWAs). Given such a "triangular" GWA for which Category $\mathcal{O}$ decomposes into a direct sum of subcategories, we study in detail the homological properties of blocks with finitely many simples. As consequences, we show that the endomorphism algebra of a projective generator of such a block is quasi-hereditary, finite-dimensional, and graded Koszul. We also classify all tilting modules in the block, as well as all submodules of all projective and tilting modules. Finally, we present a novel connection between blocks of triangular GWAs and Young tableaux, which provides a combinatorial interpretation of morphisms and extensions between objects of the block.

math.RT↗

Critical exponents of graphs

The study of entrywise powers of matrices was originated by Loewner in the pursuit of the Bieberbach conjecture. Since the work of FitzGerald and Horn (1977), it is known that $A^{\circ α} := (a_{ij}^α)$ is positive semidefinite for every entrywise nonnegative $n \times n$ positive semidefinite matrix $A = (a_{ij})$ if and only if $α$ is a positive integer or $α\geq n-2$. This surprising result naturally extends the Schur product theorem, and demonstrates the existence of a sharp phase transition in preserving positivity. In this paper, we study when entrywise powers preserve positivity for matrices with structure of zeros encoded by graphs. To each graph is associated an invariant called its "critical exponent", beyond which every power preserves positivity. In our main result, we determine the critical exponents of all chordal/decomposable graphs, and relate them to the geometry of the underlying graphs. We then examine the critical exponent of important families of non-chordal graphs such as cycles and bipartite graphs. Surprisingly, large families of dense graphs have small critical exponents that do not depend on the number of vertices of the graphs.

math.CO↗

Integration and measures on the space of countable labelled graphs

In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$. We first study several interrelated $σ$-algebras and a large family of probability measures on graph space. We then focus on a "dyadic" Hamming distance function $\left\| \cdot \right\|_{ψ,2}$, which was very useful in the study of differentiation on $\mathscr{G}(V)$. The function $\left\| \cdot \right\|_{ψ,2}$ is shown to be a Haar measure-preserving bijection from the subset of infinite graphs to the circle (with the Haar/Lebesgue measure), thereby naturally identifying the two spaces. As a consequence, we establish a "change of variables" formula that enables the transfer of the Riemann-Lebesgue theory on $\mathbb{R}$ to graph space $\mathscr{G}(V)$. This also complements previous work in which a theory of Newton-Leibnitz differentiation was transferred from the real line to $\mathscr{G}(V)$ for countable $V$. Finally, we identify the Pontryagin dual of $\mathscr{G}(V)$, and characterize the positive definite functions on $\mathscr{G}(V)$.

math.CA↗

Axiomatic framework for the BGG Category O

The main goal of this paper is to show that a wide variety of infinite-dimensional algebras all share a common structure, including a triangular decomposition and a theory of weights. This structure allows us to define and study the BGG Category O, generalizing previous definitions of it. Having presented our axiomatic framework, we present sufficient conditions that guarantee finite length, enough projectives, and a block decomposition into highest weight categories. The framework is strictly more general than the usual theory of O; this is needed to accommodate (quantized or higher rank) infinitesimal Hecke algebras, in addition to semisimple Lie algebras and their quantum groups. We then present numerous examples, two families of which are studied in detail. These are quantum groups defined using not necessarily the root or weight lattices (for these, we study the center and central characters), and infinitesimal Hecke algebras.

math.RT↗

Axiomatic framework for the BGG Category O

We introduce a general axiomatic framework for algebras with triangular decomposition, which allows for a systematic study of the Bernstein-Gelfand-Gelfand Category $\mathcal{O}$. The framework is stated via three relatively simple axioms; algebras satisfying them are termed "regular triangular algebras (RTAs)". These encompass a large class of algebras in the literature, including (a) generalized Weyl algebras, (b) symmetrizable Kac-Moody Lie algebras $\mathfrak{g}$, (c) quantum groups $U_q(\mathfrak{g})$ over "lattices with possible torsion", (d) infinitesimal Hecke algebras, (e) higher rank Virasoro algebras, and others. In order to incorporate these special cases under a common setting, our theory distinguishes between roots and weights, and does not require the Cartan subalgebra to be a Hopf algebra. We also allow RTAs to have roots in arbitrary monoids rather than root lattices, and the roots of the Borel subalgebras to lie in cones with respect to a strict subalgebra of the Cartan subalgebra. These relaxations of the triangular structure have not been explored in the literature. We then study the BGG Category $\mathcal{O}$ over an RTA. In order to work with general RTAs - and also bypass the use of central characters - we introduce conditions termed the "Conditions (S)", under which distinguished subcategories of Category $\mathcal{O}$ possess desirable homological properties, including: (a) being a finite length, abelian, self-dual category; (b) having enough projectives/injectives; or (c) being a highest weight category satisfying BGG Reciprocity. We discuss whether the above examples satisfy the various Conditions (S). We also discuss two new examples of RTAs that cannot be studied using previous theories of Category $\mathcal{O}$, but require the full scope of our framework. These include the first construction of algebras for which the "root lattice" is non-abelian.

math.RT↗

Differential Calculus on Graphon Space

Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the general structure of differentiable graphon parameters $F$. We derive consistency conditions among the higher Gâteaux derivatives of $F$ when restricted to the subspace of edge weighted graphs $\mathcal{W}_{\bf p}$. Surprisingly, these constraints are rigid enough to imply that the multilinear functionals $Λ: \mathcal{W}_{\bf p}^n \to \mathbb{R}$ satisfying the constraints are determined by a finite set of constants indexed by isomorphism classes of multigraphs with $n$ edges and no isolated vertices. Using this structure theory, we explain the central role that homomorphism densities play in the analysis of graphons, by way of a new combinatorial interpretation of their derivatives. In particular, homomorphism densities serve as the monomials in a polynomial algebra that can be used to approximate differential graphon parameters as Taylor polynomials. These ideas are summarized by our main theorem, which asserts that homomorphism densities $t(H,-)$ where $H$ has at most $N$ edges form a basis for the space of smooth graphon parameters whose $(N+1)$st derivatives vanish. As a consequence of this theory, we also extend and derive new proofs of linear independence of multigraph homomorphism densities, and characterize homomorphism densities. In addition, we develop a theory of series expansions, including Taylor's theorem for graph parameters and a uniqueness principle for series. We use this theory to analyze questions raised by Lovász, including studying infinite quantum algebras and the connection between right- and left-homomorphism densities.

math.CO↗

Complete characterization of Hadamard powers preserving Loewner positivity, monotonicity, and convexity

Entrywise powers of symmetric matrices preserving positivity, monotonicity or convexity with respect to the Loewner ordering arise in various applications, and have received much attention recently in the literature. Following FitzGerald and Horn [J. Math. Anal. Appl., 1977], it is well-known that there exists a critical exponent beyond which all entrywise powers preserve positive definiteness. Similar phase transition phenomena have also recently been shown by Hiai (2009) to occur for monotonicity and convexity. In this paper, we complete the characterization of all the entrywise powers below and above the critical exponents that are positive, monotone, or convex on the cone of positive semidefinite matrices. We then extend the original problem by fully classifying the positive, monotone, or convex powers in a more general setting where additional rank constraints are imposed on the matrices. We also classify the entrywise powers that are super/sub-additive with respect to the Loewner ordering. Finally, we extend all the previous characterizations to matrices with negative entries. Our analysis consequently allows us to answer a question raised by Bhatia and Elsner (2007) regarding the smallest dimension for which even extensions of the power functions do not preserve Loewner positivity.

math.FA↗

Loewner positive entrywise functions, and classification of measurable solutions of Cauchy's functional equations

Entrywise functions preserving Loewner positivity have been studied by many authors, most notably Schoenberg and Rudin. Following their work, it is known that functions preserving positivity when applied entrywise to positive semidefinite matrices of all dimensions are necessarily analytic with nonnegative Taylor coefficients. When the dimension is fixed, it has been shown by Vasudeva and Horn that such functions are automatically continuous and sufficiently differentiable. A natural refinement of the aforementioned problem consists of characterizing functions preserving positivity under rank constraints. In this paper, we begin this study by characterizing entrywise functions which preserve the cone of positive semidefinite real matrices of rank $1$ with entries in a general interval. Classifying such functions is intimately connected to the classical problem of solving Cauchy's functional equations, which have non-measurable solutions. We demonstrate that under mild local measurability assumptions, such functions are automatically smooth and can be completely characterized. We then extend our results by classifying functions preserving positivity on rank $1$ Hermitian complex matrices.

math.FA↗

On fractional Hadamard powers of positive block matrices

Entrywise powers of matrices have been well-studied in the literature, and have recently received renewed attention in the regularization of high-dimensional correlation matrices. In this paper, we study powers of positive semidefinite block matrices $(H_{st})_{s,t=1}^n$ with complex entries. We first characterize the powers $α\in\mathbb{R}$ such that the blockwise power map $(H_{st}) \mapsto (H_{st}^α)$ preserves Loewner positivity. The characterization is obtained by exploiting connections with the theory of matrix monotone functions developed by Loewner. Second, we revisit previous work by Choudhury [Proc. AMS 108] who had provided a lower bound on $α$ for preserving positivity when the blocks $H_{st}$ pairwise commute. We completely settle this problem by characterizing the full set of powers preserving positivity in this setting. Our characterizations generalize previous work by FitzGerald-Horn, Bhatia-Elsner, and Hiai from scalars to arbitrary block size, and in particular, generalize the Schur Product Theorem. Finally, a natural and unifying framework for studying the case of diagonalizable blocks consists of replacing real powers by general characters of the complex plane. We thus classify such characters, and generalize our results to this more general setting. In the course of our work, given $β\in\mathbb{Z}$, we provide lower and upper bounds for the threshold power $α>0$ above which the complex characters $re^{iθ}\mapsto r^αe^{iβθ}$ preserve positivity when applied entrywise to positive semidefinite matrices. In particular, we completely resolve the $n=3$ case of a question raised in 2001 by Xingzhi Zhan. As an application, we extend previous work by de Pillis [Duke Math. J. 36] by classifying the characters $K$ of the complex plane for which the map $(H_{st})_{s,t=1}^n \mapsto (K({\rm tr}(H_{st})))_{s,t=1}^n$ preserves positivity.

math.FA↗

The critical exponent conjecture for powers of doubly nonnegative matrices

Doubly non-negative matrices arise naturally in many setting including Markov random fields (positively banded graphical models) and in the convergence analysis of Markov chains. In this short note, we settle a recent conjecture by C.R. Johnson et al. [Linear Algebra Appl. 435 (2011)] by proving that the critical exponent beyond which all continuous conventional powers of $n$-by-$n$ doubly nonnegative matrices are doubly nonnegative is exactly $n-2$. We show that the conjecture follows immediately by applying a general characterization from the literature. We prove a stronger form of the conjecture by classifying all powers preserving doubly nonnegative matrices, and proceed to generalize the conjecture for broad classes of functions. We also provide different approaches for settling the original conjecture.

math.CA↗

Weights of simple highest weight modules over a complex semisimple Lie algebra

In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight λ, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These include, but are not restricted to, all (highest weight) simple modules L(λ). We also assert that these formulas are the "best possible", in that they do not hold in general for other highest weight modules in a very precise sense. The proofs of the results in this note are included in an updated copy (Version 3) of the paper arxiv:1301.1140 . The proofs involve studying the convex hull of the set of $\lie{h}$-weights $\wt(\V)$ in their own right. Thus, we show that if $\V = L(λ)$ is simple, or if λ is not on a simple root hyperplane and $\V$ is arbitrary, the hull of the infinite set $\wt(\V)$ is a convex polyhedron - i.e., cut out by only finitely many hyperplanes. (This extends the notion of the Weyl polytope to arbitrary simple modules L(λ).) It is also shown that the partially ordered set (under quotienting) of modules $\V$ with fixed convex hull, has unique "largest" and "smallest" elements.

math.RT↗