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

A new upper bound for the length of snakes

โœ Scribed by Knut Deimer


Book ID
110564417
Publisher
Springer-Verlag
Year
1985
Tongue
English
Weight
443 KB
Volume
5
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The snake-in-the-box problem: A new uppe
โœ Hunter S. Snevily ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

We give a new upper bound for the length of the largest induced cycle in the hypercube. ## 1. Introduction Let G1 and Gz be two graphs. The Cartesian product G= G1 x G2 has V(G)= V(G,) x V(G,), and two vertices (ul, u2) and (vl, u2) of G are adjacent if and only if either ul=vl and uzuz~E(G2) or u

An Upper Bound for the Length of a Finit
โœ Christopher J Pappacena ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

Let F be a field, and let A be a finite-dimensional F-algebra. Write d s dim A, F and let e be the largest degree of the minimal polynomial for any a g A. Define ลฝ . ' the function f d, e s e 2dr e y 1 q 1r4 q er2 y 2. We prove that, if S is ลฝ . any finite generating set for A as an F-algebra, the

A new upper bound for Shellsort
โœ Robert Sedgewick ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 796 KB