Upper and lower bounds are derived for the absolute values of the eigenvalues of a matrix polynomial (or λ-matrix). The bounds are based on norms of the coefficient matrices and involve the inverses of the leading and trailing coefficient matrices. They generalize various existing bounds for scalar polynomials and single matrices. A variety of tools are used in the derivations, including block ...

Necessary and sufficient coefficient bounds and convolution condition for certain multivalent harmonic functions whose convolution with generalized hypergeometric functions is starlike of order γ are investigated. Results on extreme points, convex combination and distortion bounds using the coefficient condition are also obtained. 2010 Mathematics Subject Classification: 30C45, 30C50

We present a new method of deriving microstructure-dependent bounds on the effective properties of general heterogeneous media. The microstructure is specified by the average Eshelby tensors. In the small contrast limit, we introduce and calculate the expansion coefficient tensors. We then show that the effective tensor satisfies a differential inequality with the initial condition given by the...

In this thesis, I present an associative diagram algebra that is a faithful representation of a particular Temperley–Lieb algebra of type affine C, which has a basis indexed by the fully commutative elements of the Coxeter group of the same type. The Coxeter group of type affine C contains an infinite number of fully commutative elements, and so the corresponding Temperley–Lieb algebra is of in...

The dilation coefficient of a graph representation is defined as the quotient of the longest and the shortest edge representation. The minimum of the dilation coefficients over all planar representations of a graph G is called the dilation coefficient of the graph G. The dilation coefficient of different planar representations of complete graphs is considered and upper and lower bounds for the ...