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

On constructing Markov partitions by computer

โœ Scribed by Valter Franceschini; Fernando Zironi

Publisher
Springer
Year
1985
Tongue
English
Weight
1005 KB
Volume
40
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Construction of Markov partitions
Construction of Markov partitions
โœ Ya. G. Sinai ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Springer US ๐ŸŒ English โš– 716 KB
On Sets Represented by Partitions
On Sets Represented by Partitions
โœ Jean-Christophe Aval ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 58 KB

We prove a lemma that is useful for obtaining upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n.