✦ LIBER ✦

Permutation cycles and manipulation of choice functions

✍ Scribed by N. Schofield

Publisher: Springer
Year: 1986
Tongue: English
Weight: 607 KB
Volume: 3
Category: Article
ISSN: 0176-1714
DOI: 10.1007/bf00435661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discovering manipulated social choices:

Discovering manipulated social choices: The coincidence of cycles and manipulated outcomes

✍ John R. Chamberlin 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 925 KB

Choice of predicate and narrative manipu

Choice of predicate and narrative manipulation: Functions of dearu and da in modern Japanese fiction

✍ Senko K. Maynard 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 739 KB

Manipulation of crystal shape by cycles

Manipulation of crystal shape by cycles of growth and dissolution

✍ Ryan C. Snyder; Stephan Studener; Michael F. Doherty 📂 Article 📅 2007 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 135 KB 👁 2 views

## Abstract A method for the manipulation of crystal shape by using cycles of growth and dissolution is presented, representing a unique process‐based solution to an important product quality concern. Using 3‐D shape evolution models for faceted crystal growth and dissolution, results are reported

Universal cycles of k-subsets and k-perm

Universal cycles of k-subsets and k-permutations

✍ B.W. Jackson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In this paper the author constructs universal cycles of 3-subsets of an n-set for n 28 and (n, 3)= 1, verifying a conjecture of Chung et al. ( ) for 3-subsets. Universal cycles of 4-subsets of an n-set for n > 8 and (n, 4) = 1 are also constructed, partially solving the same conjecture for 4-subsets

Symmetry Groups of Boolean Functions and

Symmetry Groups of Boolean Functions and Constructions of Permutation Groups

✍ Andrzej Kisielewicz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 273 KB

In this paper we deal with the symmetry group S f of a boolean function f on n-variables, that is, the set of all permutations on n elements which leave f invariant. The main problem is that of concrete representation: which permutation Ž . groups on n elements can be represented as G s S f for some

Rigid Unary Functions and the Axiom of C

Rigid Unary Functions and the Axiom of Choice

✍ Wolfgang Degen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

We shall investigate certain statements concerning the rigidity of unary functions which have connections with (weak) forms of the axiom of choice.