✦ LIBER ✦

Stellar permutations of the two-element subsets of a finite set

✍ Scribed by D. de Caen

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 383 KB
Volume: 6
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1998)6:5<381::aid-jcd6>3.0.co;2-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Antichains in Random Subsets of

Maximum Antichains in Random Subsets of a Finite Set

✍ Deryk Osthus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

The Excedance Set of a Permutation

✍ Richard Ehrenborg; Einar Steingrı́msson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The excedance set of a permutation π = π 1 π 2 • • • π n is the set of indices i for which π i > i. We give a formula for the number of permutations with a given excedance set and recursive formulas satisfied by these numbers. We prove log-concavity of certain sequences of these numbers and we show

Application of the level set method to t

Application of the level set method to the finite element solution of two-phase flows

✍ M. Quecedo; M. Pastor 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB 👁 2 views

A Semilattice on the Set of Permutations

A Semilattice on the Set of Permutations on an Infinite Set

✍ I. G. Rosenberg 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 440 KB 👁 1 views

Routing a Permutation in the Hypercube b

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

✍ Qian-Ping Gu; Hisao Tamaki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.

Representing the Quotient Groups of a Fi

Representing the Quotient Groups of a Finite Permutation Group

✍ Derek F. Holt; Jacqueline Walton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has