✦ LIBER ✦

A Note on Layer Replacements and Solid Partitions

✍ Scribed by E.E. Guerin

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 161 KB
Volume: 15
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1017

No coin nor oath required. For personal study only.

✦ Synopsis

A layer replacement method is used to obtain combinatorial interpretations of solid partitions with ' (f(a)) copies of (a) ' for some arithmetic functions (f).

📜 SIMILAR VOLUMES

A Note on Graphical Partitions

✍ C.C. Rousseau; F. Ali 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We give a simple proof that the number of graphical partitions of an even positive integer \(n\) is at least \(p(n)-p(n-1) . \quad 1995\) Academic Press. Inc.

A note on complete partitions in boolean

A note on complete partitions in boolean algebras

✍ Wojciech Sachwanowicz 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

A note on parallel machine replacement

✍ Jen Tang; Kwei Tang 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

A further note on parallel machine repla

A further note on parallel machine replacement

✍ Wallace J. Hopp; Philip C. Jones; James L. Zydiak 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

A note on Prandtl boundary layers

✍ Yan Guo; Toan Nguyen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract This note concerns nonlinear ill‐posedness of the Prandtl equation and an invalidity of asymptotic boundary layer expansions of incompressible fluid flows near a solid boundary. Our analysis is built upon recent remarkable linear illposedness results established by Gérard‐Varet and Dorm

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit