Abstract not found

What do I mean? Look at the example of Newton’s Law of Gravitation. Here is a mathematical statement of great simplicity which implies logically vast number of phenomena of incredible variety. For example, Galileo’s observation that objects of different weights fall to the Earth with the same acceleration, or Kepler’s laws governing the motion

by the min-cut. The result (which is existentially optimal) establishes an important analogue of the famous 1-commodity max-flow min-cut theorem for problems with multiple commodities. The result also has substantial applications to the field of approximation algorithms. For example, we use the flow result

We present a theoretical model for breaking various cryptographic schemes by taking advantage of random hardware faults. We show how to attack certain implementations of RSA and Rabin signatures. An implementation of RSA based on the Chinese Remainder Theorem can be broken using a single erroneous

The famous max-flow min-cut theorem states that a source node can send information through a network ( ) to a sink node at a rate determined by the min-cut separating and. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided

Abstract. A categorical version of the famous theorem of Stone and Weierstrass is formulated and studied in detail. Several applications and examples are given.

In these paragraphs one presents three generalizations of the famous theorem of Ceva, which states: “If in a triangle ABC one draws the concurrent straight lines

. The famous theorem of Szemer'edi asserts that for every positive integer k and every positive real number ffi ? 0 there is a positive integer N such that every subset of f1

The elementary binomial theorem is arguably one of the oldest and perhaps most well-known result in mathematics. This famous theorem, which was known to Chinese mathematicians from as early as the thirteenth century, has been subject since that time to a number of generalizations, one of which

Abstract. Let p be a prime. A famous theorem of Lucas states that ( mp+s) ≡ ( np+t m) ( s) (mod p) ifm, n, s, t are nonnegative integers with s, t < p. Inthispaper n t we aim to prove a similar result for generalized binomial coefficients defined in terms of second order recurrent sequences