𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complex Maslov germ generated by a linear connection

✍ Scribed by Yu. M. Vorob'ev

Publisher
SP MAIK Nauka/Interperiodica
Year
1990
Tongue
English
Weight
509 KB
Volume
48
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound on the size of a complex g
A lower bound on the size of a complex generated by an antichain
✍ P. Frankl πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.

A linear attack on the random generator
A linear attack on the random generator by a nonlinear combiner
✍ Hidema Tanaka; Toshinobu Kaneko πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 777 KB

We propose a linear attack on random generators by a nonlinear combiner. This attack assumes that the attacker knows the nonlinear function f(Γ—) and generator polynomials of the LFSR in the random generator. It estimates the initial value of the LFSR from the tapped bits. The linear attack is as fol

On the connectivity of graphs generated
On the connectivity of graphs generated by a sum of random mappings
✍ Jerzy Jaworski; MichaΕ‚ KaroΕ„ski πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 537 KB

## Abstract We consider four models of random directed multigraphs with __n__ labeled vertices of out‐degree __d__. First we establish formal relationships between our models with respect to exact and asymptotic (as __n__ β†’ ∞) probabilities of possessing a graph monotone property. We also study the