Re: Permutations counting problem
From: Gerry Myerson (gerry_at_maths.mq.edi.ai.i2u4email)
Date: 10/14/04
- Next message: flip: "Re: outlook....error"
- Previous message: Jon Miller: "Re: Prove this is a metric"
- In reply to: Rani Sharoni: "Permutations counting problem"
- Next in thread: Rani Sharoni: "Re: Permutations counting problem"
- Reply: Rani Sharoni: "Re: Permutations counting problem"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 14 Oct 2004 11:22:55 +1000
In article <df893da6.0410130102.523af172@posting.google.com>,
rani_sharoni@hotmail.com (Rani Sharoni) wrote:
> What is the number of enumerations, starting from identity, of all
> n-length permutations, without repetitions, where each step is a
> transposition (i.e. changing exactly two elements)?
>
> Let's call such enumeration a "low const path".
>
> Examples of two low cost paths for 3-length permutation:
> 123 ; identity 123 ; identity
> 132 ; (2,3) 321 ; (1,3)
> 231 ; (1,3) 231 ; (1,2)
> 213 ; (2,3) 213 ; (2,3)
> 312 ; (1,3) 312 ; (1,3)
> 321 ; (2,3) 132 ; (1,2)
>
> I counted 3*2*2=12 paths for 3-length.
Let me see if I understand the problem.
You have a graph. There is one vertex for each permutation on n
symbols, and there is an edge between vertices if you can get
from the one permutation to the other by a single transposition.
You want the number of hamiltonian paths in this graph.
I have no idea how to answer it, but this looks like a more
mathematician-friendly way to ask it.
If you can calculate it for a few small values of n, you can
try looking up the terms in Sloane's online encyclopedia of
integer sequences.
-- Gerry Myerson (gerry@maths.mq.edi.ai) (i -> u for email)
- Next message: flip: "Re: outlook....error"
- Previous message: Jon Miller: "Re: Prove this is a metric"
- In reply to: Rani Sharoni: "Permutations counting problem"
- Next in thread: Rani Sharoni: "Re: Permutations counting problem"
- Reply: Rani Sharoni: "Re: Permutations counting problem"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|