✦ LIBER ✦

An improved upper bound for the subarray partial concentrators

✍ Scribed by X.D. Hu; F.K. Hwang

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 501 KB
Volume: 37-38
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90143-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved upper bound for Laplacian gr

An improved upper bound for Laplacian graph eigenvalues

✍ Kinkar ch. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 104 KB

An improved bound for extending partial

An improved bound for extending partial projective planes

✍ Stephen Dow 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 895 KB

A partial projective plane S of order n is a collection of subse:(s (called lines) of an (n' + n + l)-set (of points) such that every line has size n + 1 and any two lines meet in a unique point. We denote the number of lines by b. In this paper it is shown that if b > n\* -2(n + 3)f + 6, then 2 can

An improved upper bound in the maximum d

An improved upper bound in the maximum dispersal problem

✍ Michael H. Moore 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 220 KB

An improved upper bound on the non-3-col

An improved upper bound on the non-3-colourability threshold

✍ Paul E. Dunne; Michele Zito 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 470 KB

In this paper we derive an improved upper bound on the average vertex degree, 6. needed to ensure that: Vc > 0 and n sufficiently large, a random n-vertex graph with at least (6 + E)&! edges is almost certainly not 3-colourable. @

Improved upper bounds for the atomic ion

Improved upper bounds for the atomic ionization potential

✍ J. C. Angulo; E. Romera 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB 👁 2 views

Two sets of rigorous upper bounds on the atomic ionization potential are derived from some known inequalities of the classical analysis. The first set of bounds are expressed in terms of radial expectation values of the electron density; they improve previously found bounds of the same kind and conv

An improved upper bound on the crossing

An improved upper bound on the crossing number of the hypercube

✍ Luerbio Faria; Celina Miraglia Herrera de Figueiredo; Ondrej Sýkora; Imrich Vrt' 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

## Abstract We draw the __n__‐dimensional hypercube in the plane with ${5\over 32}4^{n}-\lfloor{{{{n}^{2}+1}\over 2}}\rfloor {2}^{n-2}$ crossings, which improves the previous best estimation and coincides with the long conjectured upper bound of Erdös and Guy. © 2008 Wiley Periodicals, Inc. J Graph