Effective Pólya semi-positivity for non-negative polynomials on the simplex

We consider homogeneous polynomials f∈R[_x1,…,_xn]$f\in \mathbb{R}[x_1,\dots ,x_n]$ which are non-negative on the standard simplex in Rⁿ${\mathbb{R}}^n$, and we obtain sufficient conditions for such an f   to be Pólya semi-positive, that is, all the coefficients of (_x1+?+_xn)^Nf$(x_1+?+x_n{)}^{N}f$ are non-negative for all sufficiently large positive integers N. Such sufficient conditions are expressed in terms of the vanishing orders of the monomial terms of f along the faces of the simplex. Our result also gives effective estimates on N   under such conditions. Moreover, we also show that any Pólya semi-positive polynomial necessarily satisfies a slightly weaker condition. In particular, our results lead to a simple characterization of the Pólya semi-positive polynomials in the low dimensional case when n?3$n?3$ as well as the case (in any dimension) when the zero set of the polynomial in the simplex consists of a finite number of points. We also discuss an application to the representations of non-homogeneous polynomials which are non-negative on a general simplex.     

On the roots of independence polynomials of almost all very well-covered graphs

If s_k denotes the number of stable sets of cardinality k in graph G, and α(G) is the size of a maximum stable set, then is the independence polynomial of G [I. Gutman, F. Harary, Generalizations of the matching polynomial, Utilitas Math. 24 (1983) 97-106]. A graph G is very well-covered [O. Favaron, Very well-covered graphs, Discrete Math. 42 (1982) 177-187] if it has no isolated vertices, its order equals 2α(G) and it is well-covered, i.e., all its maximal independent sets are of the same size [M.D. Plummer, Some covering concepts in graphs, J. Combin. Theory 8 (1970) 91-98]. For instance, appending a single pendant edge to each vertex of G yields a very well-covered graph, which we denote by G^*. Under certain conditions, any well-covered graph equals G^* for some G [A. Finbow, B. Hartnell, R.J. Nowakowski, A characterization of well-covered graphs of girth 5 or greater, J. Combin. Theory Ser B 57 (1993) 44-68].The root of the smallest modulus of the independence polynomial of any graph is real [J.I. Brown, K. Dilcher, R.J. Nowakowski, Roots of independence polynomials of well-covered graphs, J. Algebraic Combin. 11 (2000) 197-210]. The location of the roots of the independence polynomial in the complex plane, and the multiplicity of the root of the smallest modulus are investigated in a number of articles.In this paper we establish formulae connecting the coefficients of I(G;x) and I(G^*;x), which allow us to show that the number of roots of I(G;x) is equal to the number of roots of I(G^*;x) different from -1, which appears as a root of multiplicity α(G^*)-α(G) for I(G^*;x). We also prove that the real roots of I(G^*;x) are in [-1,-1/2α(G^*)), while for a general graph of order n we show that its roots lie in |z|>1/(2n-1).Hoede and Li [Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994) 219-228] posed the problem of finding graphs that can be uniquely defined by their clique polynomials (clique-unique graphs). Stevanovic [Clique polynomials of threshold graphs, Univ. Beograd Publ. Elektrotehn. Fac., Ser. Mat. 8 (1997) 84-87] proved that threshold graphs are clique-unique. Here, we demonstrate that the independence polynomial distinguishes well-covered spiders among well-covered trees.     

An extension of the Wang transform derived from Bühlmann’s economic premium principle for insurance risk

It is well known that the Wang transform [Wang, S.S., 2002. A universal framework for pricing financial and insurance risks. Astin Bull. 32, 213–234] for the pricing of financial and insurance risks is derived from Bühlmann’s economic premium principle [Bühlmann, H., 1980. An economic premium principle. Astin Bull. 11, 52–60]. The transform is extended to the multivariate setting by [Kijima M., 2006. A multivariate extension of equilibrium pricing transforms: The multivariate Esscher and Wang transforms for pricing financial and insurance risks, Astin Bull. 36, 269–283]. This paper further extends the results to derive a class of probability transforms that are consistent with Bühlmann’s pricing formula. The class of transforms is extended to the multivariate setting by using a Gaussian copula, while the multiperiod extension is also possible within the equilibrium pricing framework.     

Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight 1. Strongly equistable graphs are graphs such that for every and every nonempty subset T of vertices that is not a maximal stable set, there exist positive vertex weights assigning weight 1 to every maximal stable set such that the total weight of T does not equal c . General partition graphs are the intersection graphs of set systems over a finite ground set U such that every maximal stable set of the graph corresponds to a partition of U . General partition graphs are exactly the graphs every edge of which is contained in a strong clique. In 1994, Mahadev, Peled, and Sun proved that every strongly equistable graph is equistable, and conjectured that the converse holds as well. In 2009, Orlin proved that every general partition graph is equistable, and conjectured that the converse holds as well. Orlin's conjecture, if true, would imply the conjecture due to Mahadev, Peled, and Sun. An “intermediate” conjecture, posed by Miklavi? and Milani? in 2011, states that every equistable graph has a strong clique. The above conjectures have been verified for several graph classes. We introduce the notion of equistarable graphs and based on it construct counterexamples to all three conjectures within the class of complements of line graphs of triangle‐free graphs. We also show that not all strongly equistable graphs are general partition.     

Strong and absolute almost-convergence of vector functions and related Tauberian theorems

We discuss relations among notions of (C,1)-convergence, almost-convergence, absolute almost-convergence, and -convergence of a continuous vector-valued function f(t) as t tends to infinity. Equivalent conditions and Tauberian criterions are obtained, and some examples are exhibited.     

Set-theoretic defining equations of the tangential variety of the Segre variety

We prove a set-theoretic version of the Landsberg-Weyman Conjecture on the defining equations of the tangential variety of a Segre product of projective spaces. We introduce and study the concept of exclusive rank. For the proof of this conjecture, we use a connection to the author’s previous work and re-express the tangential variety as the variety of principal minors of symmetric matrices that have exclusive rank no more than 1. We discuss applications to semiseparable matrices, tensor rank versus border rank, context-specific independence models and factor analysis models.     

On the spectral radius and the spectral norm of Hadamard products of nonnegative matrices

We prove the spectral radius inequality ρ(A₁°A₂°?°A_k)?ρ(A₁A₂?A_k) for nonnegative matrices using the ideas of Horn and Zhang. We obtain the inequality ‖A°B‖?ρ(A^TB) for nonnegative matrices, which improves Schur’s classical inequality ‖A°B‖?‖A‖‖B‖, where ‖·‖ denotes the spectral norm. We also give counterexamples to two conjectures about the Hadamard product.     

Existence of real eigenvalues of real tensors

We use the Brouwer degree to establish the existence of real eigenpairs of higher order real tensors in various settings. Also, we provide some finer criteria for the existence of real eigenpairs of two-dimensional real tensors and give a complete classification of the Brouwer degree zero and ±2 maps induced by general third order two-dimensional real tensors.     

Connected Domination Stable Graphs Upon Edge Addition

Abstract

A set S of vertices in a graph G is a connected dominating set of G if S dominates G and the subgraph induced by S is connected. We study the graphs for which adding any edge does not change the connected domination number.     

Cayley transform and the Kronecker product of Hermitian matrices

We consider the conditions under which the Cayley transform of the Kronecker product of two Hermitian matrices can be again presented as a Kronecker product of two matrices and, if so, if it is a product of the Cayley transforms of the two Hermitian matrices. We also study the related question: given two matrices, which matrix under the Cayley transform yields the Kronecker product of their Cayley transforms.