scholarly journals Trees, Forests, and Total Positivity: I. $q$-Trees and $q$-Forests Matrices

2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Tomack Gilmore

We consider matrices with entries that are polynomials in $q$ arising from natural $q$-generalisations of two well-known formulas that count: forests on $n$ vertices with $k$ components; and rooted labelled trees on $n+1$ vertices where $k$ children of the root are lower-numbered than the root. We give a combinatorial interpretation of the corresponding statistic on forests and trees and show, via the construction of various planar networks and the Lindström-Gessel-Viennot lemma, that these matrices are coefficientwise totally positive. We also exhibit generalisations of the entries of these matrices to polynomials in eight indeterminates, and present some conjectures concerning the coefficientwise Hankel-total positivity of their row-generating polynomials.

Author(s):  
Raj Agrawal ◽  
Uma Roy ◽  
Caroline Uhler

Abstract Selecting the optimal Markowitz portfolio depends on estimating the covariance matrix of the returns of N assets from T periods of historical data. Problematically, N is typically of the same order as T, which makes the sample covariance matrix estimator perform poorly, both empirically and theoretically. While various other general-purpose covariance matrix estimators have been introduced in the financial economics and statistics literature for dealing with the high dimensionality of this problem, we here propose an estimator that exploits the fact that assets are typically positively dependent. This is achieved by imposing that the joint distribution of returns be multivariate totally positive of order 2 (MTP2). This constraint on the covariance matrix not only enforces positive dependence among the assets but also regularizes the covariance matrix, leading to desirable statistical properties such as sparsity. Based on stock market data spanning 30 years, we show that estimating the covariance matrix under MTP2 outperforms previous state-of-the-art methods including shrinkage estimators and factor models.


2004 ◽  
Vol 41 (A) ◽  
pp. 321-332 ◽  
Author(s):  
Paul Glasserman ◽  
David D. Yao

An optimal coupling is a bivariate distribution with specified marginals achieving maximal correlation. We show that optimal couplings are totally positive and, in fact, satisfy a strictly stronger condition we call the nonintersection property. For discrete distributions we illustrate the equivalence between optimal coupling and a certain transportation problem. Specifically, the optimal solutions of greedily-solvable transportation problems are totally positive, and even nonintersecting, through a rearrangement of matrix entries that results in a Monge sequence. In coupling continuous random variables or random vectors, we exploit a characterization of optimal couplings in terms of subgradients of a closed convex function to establish a generalization of the nonintersection property. We argue that nonintersection is not only stronger than total positivity, it is the more natural concept for the singular distributions that arise in coupling continuous random variables.


2004 ◽  
Vol 41 (A) ◽  
pp. 321-332
Author(s):  
Paul Glasserman ◽  
David D. Yao

An optimal coupling is a bivariate distribution with specified marginals achieving maximal correlation. We show that optimal couplings are totally positive and, in fact, satisfy a strictly stronger condition we call the nonintersection property. For discrete distributions we illustrate the equivalence between optimal coupling and a certain transportation problem. Specifically, the optimal solutions of greedily-solvable transportation problems are totally positive, and even nonintersecting, through a rearrangement of matrix entries that results in a Monge sequence. In coupling continuous random variables or random vectors, we exploit a characterization of optimal couplings in terms of subgradients of a closed convex function to establish a generalization of the nonintersection property. We argue that nonintersection is not only stronger than total positivity, it is the more natural concept for the singular distributions that arise in coupling continuous random variables.


10.37236/6270 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Qiongqiong Pan ◽  
Jiang Zeng

Recently Chen-Liang-Wang (Linear Algerbra Appl. 471 (2015) 383—393) proved some sufficient conditions for the total positivity of Catalan-Stieltjes matrices. Our aim is to provide a combinatorial interpretation of their sufficiant conditions. More precisely, for any Catalan-Stieltjes matrix $A$ we construct a digraph with a weight, which is positive under their sufficient conditions, such that every minor of $A$ is equal to the sum of weights of families of nonintersecting paths of the digraph. We have also an analogue result for the minors of Hankel matrix associated to the first column of Catalan-Stieltjes matrix $A$.


Author(s):  
G Lusztig

Abstract Let u be a unipotent element in the totally positive part of a complex reductive group. We consider the intersection of the Springer fibre at u with the totally positive part of the flag manifold. We show that this intersection has a natural cell decomposition which is part of the cell decomposition (Rietsch) of the totally positive flag manifold.


Author(s):  
Shaun M. Fallat ◽  
Charles R. Johnson

This introductory chapter is an overview of totally positive (or nonnegative) matrices (TP or TN matrices). Positivity has roots in every aspect of pure, applied, and numerical mathematics. The subdiscipline, total positivity, also is entrenched in nearly all facets of mathematics. At first it may appear that the notion of total positivity is artificial; however, this class of matrices arises in a variety of important applications. Historically, the theory of totally positive matrices originated from the pioneering work of Gantmacher and Krein in 1960. The chapter explores the extant literature on total positivity since then, before proceeding to the definitions and notations to be used in the rest of this volume. It also provides a brief overview of the succeeding chapters.


1994 ◽  
Vol 31 (3) ◽  
pp. 721-730 ◽  
Author(s):  
Abdulhamid A. Alzaid ◽  
Frank Proschan

The concept of max-infinite divisibility is viewed as a positive dependence concept. It is shown that every max-infinitely divisible distribution function is a multivariate totally positive function of order 2 (MTP2). Inequalities are derived, with emphasis on exchangeable distributions. Applications and examples are given throughout the paper.


1991 ◽  
Vol 34 (2) ◽  
pp. 202-207
Author(s):  
N. Dyn ◽  
D. S. Lubinsky ◽  
Boris Shekhtman

AbstractWe consider the density in C[a, b] of generalized polynomials of the form The main point of this note is that total positivity of K(x, t) has little relationship to density: There is a symmetric, analytic, totally positive (in fact ETP (∞)) kernel K for which these generalized polynomials are not dense.


2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Xuli Han ◽  
Yuanpeng Zhu

Within the general framework of Quasi Extended Chebyshev space, we prove that the cubic trigonometric Bézier basis with two shape parametersλandμgiven in Han et al. (2009) forms an optimal normalized totally positive basis forλ,μ∈(-2,1]. Moreover, we show that forλ=-2orμ=-2the basis is not suited for curve design from the blossom point of view. In order to compute the corresponding cubic trigonometric Bézier curves stably and efficiently, we also develop a new corner cutting algorithm.


Sign in / Sign up

Export Citation Format

Share Document