R help - Jul 2011 - Optimal Code for subset of Integer Sets

Hi,

I wanted to know if there existed an good implementation in R of the
following classical subset Integers  :

$P_{n,m} = {k_1, \ldots, k_m \in \mathbb{N} : k_1 + \ldots + k_m = n }$

for any integers $m < n$. There is an obvious not optimal code which would
be to run through $m$ sums and put a boolean condition to report if the
integers respect these condition but it would take $m^n$ steps...

Thanks for your answers,

David Pham

	[[alternative HTML version deleted]]

If I understand you correctly, you are looking for partitions of an integer, so
look at Robin Hankin's package 'partitions'

David L. Reiner

-----Original Message-----
From: r-help-bounces at r-project.org [mailto:r-help-bounces at r-project.org]
On Behalf Of David Pham
Sent: Tuesday, July 26, 2011 5:14 AM
To: r-help at r-project.org
Subject: [R] Optimal Code for subset of Integer Sets

Hi,

I wanted to know if there existed an good implementation in R of the following
classical subset Integers  :

$P_{n,m} = {k_1, \ldots, k_m \in \mathbb{N} : k_1 + \ldots + k_m = n }$

for any integers $m < n$. There is an obvious not optimal code which would be
to run through $m$ sums and put a boolean condition to report if the integers
respect these condition but it would take $m^n$ steps...

Thanks for your answers,

David Pham

        [[alternative HTML version deleted]]

______________________________________________
R-help at r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.


This e-mail and any materials attached hereto, including, without limitation,
all content hereof and thereof (collectively, "XR Content") are
confidential and proprietary to XR Trading, LLC ("XR") and/or its
affiliates, and are protected by intellectual property laws.  Without the prior
written consent of XR, the XR Content may not (i) be disclosed to any third
party or (ii) be reproduced or otherwise used by anyone other than current
employees of XR or its affiliates, on behalf of XR or its affiliates.

THE XR CONTENT IS PROVIDED AS IS, WITHOUT REPRESENTATIONS OR WARRANTIES OF ANY
KIND.  TO THE MAXIMUM EXTENT PERMISSIBLE UNDER APPLICABLE LAW, XR HEREBY
DISCLAIMS ANY AND ALL WARRANTIES, EXPRESS AND IMPLIED, RELATING TO THE XR
CONTENT, AND NEITHER XR NOR ANY OF ITS AFFILIATES SHALL IN ANY EVENT BE LIABLE
FOR ANY DAMAGES OF ANY NATURE WHATSOEVER, INCLUDING, BUT NOT LIMITED TO, DIRECT,
INDIRECT, CONSEQUENTIAL, SPECIAL AND PUNITIVE DAMAGES, LOSS OF PROFITS AND
TRADING LOSSES, RESULTING FROM ANY PERSON'S USE OR RELIANCE UPON, OR
INABILITY TO USE, ANY XR CONTENT, EVEN IF XR IS ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES OR IF SUCH DAMAGES WERE FORESEEABLE.