✦ LIBER ✦

Characteristic inequalities for binary trees

✍ Scribed by Roberto De Prisc; Giuseppe Persiano

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 562 KB
Volume: 53
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00193-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hook immanantal inequalities for trees e

Hook immanantal inequalities for trees explained

✍ Onn Chan; T.K. Lam 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Let d k denote the normalized hook immanant corresponding to the partition (k, 1 "-k) of n. P. Heyfron proved the family of immanantal inequalities det A=e71(A) ~<t~2(A)-<< .--.<<d.(A) =perA (1) for all positive semidefinite Hermitian matrices A. Motivated by a conjecture of R. Merris, it was shown

Some Inequalities for Tree Martingales

✍ Tong-jun He; You-liang Hou 📂 Article 📅 2005 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 184 KB

Hook immanantal inequalities for Laplaci

Hook immanantal inequalities for Laplacians of trees

✍ Onn Chan; T.K. Lam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

For an irreducible character xh of the symmetric group S,#, indexed by the partition A, the immanant function d,, acting on an n X n matrix A = (u,~), is defined as d,(A) = Z:, t s, ,y\*(c~)rI:= la,CCij. Th e associated normalized immanant d, is defined as z\* = d,/x\*(identity) where identity is t

Weighted Binary Trees for Concurrent Sea

Weighted Binary Trees for Concurrent Searching

✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

Binary clutter inequalities for integer

Binary clutter inequalities for integer programs

✍ Adam N. Letchford 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 213 KB

Bounds for optimalα-βbinary trees

✍ David M. Choy; C. K. Wong 📂 Article 📅 1977 🏛 Springer Netherlands 🌐 English ⚖ 843 KB