Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2011

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: k-permutations enumeration

  • To: mathgroup at smc.vnet.net
  • Subject: [mg116425] Re: k-permutations enumeration
  • From: Michal Kvasnicka <michal.kvasnicka at gmail.com>
  • Date: Tue, 15 Feb 2011 06:32:19 -0500 (EST)
  • References: <ijasi6$nfk$1@smc.vnet.net>

Once again... is there any enumeration (closed form) formula? The
problem looks like simple combinatorics problem, but I can not find
any relevant formula.

The above mentioned algorithms looks very good, but I am still looking
for closed form formula.

Michal


  • Prev by Date: Re: how to drop ContextPath when printing from a package?
  • Next by Date: Approximation
  • Previous by thread: Re: k-permutations enumeration
  • Next by thread: Re: k-permutations enumeration