✦ LIBER ✦

Proof of a conjecture on partitions of a Boolean lattice

✍ Scribed by Zbigniew Lonc

Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 562 KB
Volume: 8
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00385810

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bijective proof of Kadell's conjecture

A bijective proof of Kadell's conjecture on plane partitions

✍ Dongsu Kim 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 273 KB

Proof of Nishida's Conjecture on Anharmo

Proof of Nishida's Conjecture on Anharmonic Lattices

✍ Bob Rink 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 213 KB

A Proof of a Partition Conjecture of Bat

A Proof of a Partition Conjecture of Bateman and Erdős

✍ Jason P Bell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Bateman and Erdo s found necessary and sufficient conditions on a set A for the kth differences of the partitions of n with parts in A, p (k) A (n), to eventually be positive; moreover, they showed that when these conditions occur p (k+1) A (n) tends to zero as n tends to infinity. Bateman and Erdo

On a Conjecture of Nicolas–Sárközy about

On a Conjecture of Nicolas–Sárközy about Partitions

✍ F. Ben saı̈d 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Let N be the set of positive integers, B ¼ fb 1 5 . . . 5b k g & N, N 2 N, and N5b k . For i ¼ 0 or 1, A ¼ A i ðB; NÞ is the set (introduced by Nicolas, Ruzsa, and Sa´rko¨zy, J. Number Theory 73 (1998), 292-317) such that A \ f1; . . . ; Ng ¼ B and pðA; nÞ iðmod2Þ for n 2 N; n4N, where pðA; nÞ denot

Proof of a conjecture on game domination

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on Genocchi number

Proof of a conjecture on Genocchi numbers

✍ John Riordan; Paul R. Stein 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 446 KB

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')