𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration with the lattice of periods

✍ Scribed by Mauro Cerasoli

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
384 KB
Volume
59
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Automorphisms of the Lattice of Recursiv
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
✍ Iraj Kalantari πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 910 KB

AUTOMORPHISMS O F THE LATTICE OF RECURSIVELY ENUMERABLE VECTOR SPACES by IRAJ KALANTARI in Macomb, Illinois (U.S.A. ) l ) I ) This paper forms a part of the author's dissertation. We would like to acknowledge valuable discussions with GEORGE METAKIDES, ANU NERODE, ALLEN RETZLAFF and RICHARD SHORE. R

Enumeration of Symmetry Classes of Conve
Enumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice
✍ P. Leroux; E. Rassart; A. Robitaille πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 544 KB

This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the Ε½ groups ᑝ , of rotations, and α‘ž , of symmetries, of the square, acting on transla-4 4 . tion-type polyominoes. By virtue of Burnside's lemma, it i

Not every finite lattice is embeddable i
Not every finite lattice is embeddable in the recursively enumerable degrees
✍ A.H Lachlan; R.I Soare πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 469 KB

## A certain lattice with eight elements is shown to be not embeddable as a lattice in the recursively enumerable degrees. This refutes the well-known Embedding Conjecture which asserted that every finite lattice could be so embedded.