๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Upper Bound for the Multiplicity of a Certain Local Ring

โœ Scribed by Amao, J. O.

Book ID
120096177
Publisher
Oxford University Press
Year
1976
Tongue
English
Weight
94 KB
Volume
s2-12
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An upper bound for orders of certain (k,
An upper bound for orders of certain (k, k))-connected graphs
โœ Kiyoshi Ando ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

A fragment of a connected graph G is a subset A of V(C) consisting of components of G-S such that V(G)-S-A #0 where S is a minimum cut of G. A graph G is said to be (k, I;)- We prove the following result. Let k and k be integers with 1 <i < k, and let G be a critically (k, k)-connected graph. If no

An Upper Bound for the Extended Klooster
An Upper Bound for the Extended Kloosterman Sums over Galois Rings
โœ Abhijit G. Shanbhag; P. Vijay Kumar; Tor Helleseth ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 389 KB

An upper bound for the extended Kloosterman sum over Galois rings is derived. This bound is then used to construct new sequence families with low correlation properties and alphabet size a power of a prime.

An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
โœ David Barnette ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d