𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Symmetry Problem Related to Wirtinger's and Poincaré's Inequality

✍ Scribed by M. Belloni; B. Kawohl

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
95 KB
Volume
156
Category
Article
ISSN
0022-0396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Best Approximation for Constant e and
A Best Approximation for Constant e and an Improvement to Hardy's Inequality
✍ Xie Zitian; Zhong Yibing 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 54 KB

In this paper, the best approximating form of constant e and Hardy's inequality are discussed, and the improved conclusions of earlier work are achieved. w x Recently, Y. Bicheng 1, 2 attained the inequalities involving constant e, x 1 1 1 e 1 y -1 q e 1 y , 1 Ž . ž / ž / 2 x q 1 x 2 x q 1 Ž .

On the traveling salesman problem restri
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
✍ Thomas Andreae 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract For a finite set __X__, let __c__ be a mapping which assigns to every two‐element subset {__u, v__} of __X__ a nonnegative real number __c__(__u, v__), the __cost__ of {__u, v__}. For τ ∈ ℝ, τ ≥ 1, we say that the pair (__X, c__) satisfies the τ‐__inequality__ (“__relaxed triangle inequ

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
✍ Dingyi Pei 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB 👁 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially