Trumping and Power Majorization

Majorization is a basic concept in matrix theory that has found applications in numerous settings over the past century. Power majorization is a more specialized notion that has been studied in the theory of inequalities. On the other hand, the trumping relation has recently been considered in quantum information, specifically in entanglement theory. We explore the connections between trumping and power majorization. We prove an analogue of Rado’s theorem for power majorization and consider a number of examples.     

On Applications of Quasi-Monotone Sequences and Quasi Power Increasing Sequences

In this article, we prove a general theorem dealing with an application of quasi-f-power increasing sequences and δ-quasi monotone sequences. This theorem also includes some known and new results.     

Majorization and multiplier sequences

We present applications of matrix methods to the analytic theory of polynomials. We first show how matrix analysis can be used to give new proofs of a number of classical results on roots of polynomials. Then we use matrix methods to establish a new log-majorization result on roots of polynomials. The theory of multiplier sequences gives the common link between the applications.     

Majorization and relative concavity

In this paper, some results established in [H.-N. Shi, Refinement and generalization of a class of inequalities for symmetric functions, Math. Practice Theory 29 (4) (1999) pp. 81-84] are extended from the classical majorization preordering to group-induced cone orderings. To this end the notion of relative concavity introduced in [C.P. Niculescu, F. Popovici, The extension of majorization inequalities within the framework of relative convexity, J. Inequal. Pure Appl. Math. 7 (1) (2005) (Article 27)] is used. In addition, some Ky Fan’s inequalities are discussed.     

Kantorovich's Majorization and Functional Equations

Abstract

We consider systems of nonlinear difference equations arising when convergence analysis of an iterative method for solving operator equations in Banach spaces is carried out via Kantorovich's technique of majorization. The main challenge in this context is to determine the convergence domain of the corresponding majorant generator. As it turns out, dealing with this task leads to solution of functional equations of a certain kind. After considering several examples, we formulate two generic models and develop an approach to their solution.     

Power Classes Of Recurrence Sequences

In this note, we improve upon a result from [4] concerning q-power classes of linearly recurrent sequences with a dominant root.     

Majorization versus power majorization

, . , [1]. 42.     

Majorization and some operator monotone functions

Let h(t) be a non-decreasing function on I and k(t) an increasing function on J. Then h is said to be majorized by k if k(A)≦k(B) implies h(A)≦h(B). f(t) is operator monotone, by definition, if f(t) is majorized by t. By making use of this majorization we will show that is operator monotone on [0,∞) for 0≦a,b<∞ and for 0≦r≦1; the special case of a=b=1 is the theorem due to Petz-Hasegawa.     

Majorization of Gaussian processes and geometric applications

Summary Let (x _i ^* ) _i=1 ⁿ denote the decreasing rearrangement of a sequence of real numbers (x _i ) _i=1 ⁿ . Then for everyij, and every 1kn, the 2-nd order partial distributional derivatives satisfy the inequality, . As a consequence we generalize the theorem due to Fernique and Sudakov. A generalization of Slepian's lemma is also a consequence of another differential inequality. We also derive a new proof and generalizations to volume estimates of intersecting spheres and balls in ⁿ proved by Gromov.Supported by NSF grant # DMS 8909745, and the USA-Israel Binational Science Foundation grant # 86-00074, and grant for the Promotion of Research at the Technion     

Majorization principles for meromorphic functions

Supplements to the Lindelöf principle on the behavior of Green’s function and the Nevanlinna principle on the behavior of the harmonic measure under meromorphic maps are proposed; these supplements go back to Mityuk’s work on the change of the inner radius of a domain under the action of regular functions.     

Vector Majorization Via Hessenberg Matrices

In this paper it is proved that, for real n-vectors x and y,x is majorized by y if and only if x = PHQy for some permutationmatrices P, Q, and for some doubly stochastic matrix H whichis a direct sum of doubly stochastic Hessenberg matrices. Thisresult reveals that any n-vector which is majorized by a vectory can be expressed as a convex combination of at most (n² –n + 2)/2 permutations of y.     

Majorization of polynomials on the plane

We prove that for every χ[−1, 1] and every real algebraic polynomial f of degree n such that |f(t): 1 on [−1, 1], the following inequality takes place on the complex plane |f(x+iy)||T_n(1+iy)|,−∞y∞ where T_n is the Tchebycheff polynomial. This implies easily Vladimir Markov inequality.     

图的规范拉普拉斯谱与优超（英文）

令G是简单图.记L(G)为图G的规范拉普拉斯矩阵,其特征值称为图的规范拉普拉斯特征值.[Adv.Math.(China),2017,46(6):848-856]给出了关于规范拉普拉斯特征值和的相关结论,并提出相关猜想.我们发现在上述文章中的一些重要结果中存在一些错误.本文修正了所有不正确的结果.此外,我们讨论了￡(G)的特征值优超不等式.利用这些结果,我们证实了[Adv.Math.(China),2017,46(6):848-8561中提出的一个猜想.     

Majorization and arrangement orderings in open queueing networks

Consider an open Jackson network of queues. Majorization and arrangement orderings are studied to order, respectively, various loading and server-assignment policies. It is shown that under these order relations, stochastic and likelihood ratio orderings can be established for the maximum and the minimum queue lengths and for the total number of jobs in the network. Stochastic majorization and stochastic orderings are also established, respectively, for the queue-length vector and the associated order-statistic vector. Implications of the results on loading and assignment decisions are discussed.     

Majorization of characters of the symmetric group

Suppose λ and χ are different irreducible characters of the symmetric group S_m. If the partition of m to which λ corresponds majorizes the partition to which χ corresponds, then $\text{λ(τ)}\text{λ(e)}\text{>}\text{χ(τ)}\text{χ(e)}$, where τ is a transposition and e is the identity.     

Bounds and Majorization Relations for the Zeros of Polynomials

We use matrix inequalities to prove several bounds and majorization relations for the zeros of polynomials. Our results generalize the classic bound of Montel and improve some other known bounds.