Linked Questions

2 votes
1 answer
2k views

I have to create two algorithms (but I think it is more of a combinatorics question). Let there be list of permutations on elements $\{1,2,...,k\}, k \in N$ and this list is alphabetically ordered (...
devWeSp's user avatar
  • 39
1 vote
1 answer
97 views

I'm not sure if the title is the correct description. What I want to do is basically like this: For example, if I have a binary sequence of 3-bits, I can have the following permutations: 1 -> [0,0,0] ...
madu's user avatar
  • 113
0 votes
0 answers
20 views

For example, if I have a set of all permutations of the set {1, 2, 3, 4} and the permutation 1, 4, 3, 2 how do i calculate which element of the set it is without calculating all the permutations?
user avatar
5 votes
2 answers
574 views

I've seen this post about the $n^{\textrm{th}}$ permutation of a set but that is not what I need. If you have a bit string (ones and zeros only) there are algorithms to quickly permute the NEXT ...
amcalde's user avatar
  • 4,684
3 votes
1 answer
834 views

Given a set of symbols (e.g. $(A, A, B, B, B, C, D, D)$), calculate the nth permutation sorted in alphabetical order. I know how to do this with a set of symbols containing no repeats, but I can't ...
rlms's user avatar
  • 903
2 votes
1 answer
338 views

Let say I have a sequence [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] and I want to retrieve the 4th element of the 1,000,000th permutation of this list. I know how to compute the 1,000,000th permutation of the ...
fbparis's user avatar
  • 163
1 vote
1 answer
498 views

Can someone please explain the logic behind the mathematical equation, that for finding the Nth Lexicographic rank of a string the Leading Entry is $a_q$ if $k=q\cdot (n!)+r.$ The link to the problem ...
Art's user avatar
  • 111
6 votes
1 answer
108 views

I am working on a project and this is a mathematical issue I have encountered. Combinatorics is not my strong point so some help would be most welcome. The idea is you have 81 elements to pick from ...
Zelos Malum's user avatar
  • 6,684
0 votes
0 answers
207 views

Problem: If we have a set of letter: {A,D,E,I,K,M,O,T}. Problem is to find which permutation is "METODIKA". alphabetically (lexicographic order) Solution is to see that if we write first letter A we ...
josf's user avatar
  • 1,387
0 votes
1 answer
123 views

Let's assume that we have a number sequence which starts as 1# -1 2 3 4 5 6 7 8 9 2# -1 2 3 4 5 6 7 9 8 3# -1 2 3 4 5 6 8 7 9 n# -9 8 7 6 5 4 3 2 1 There could ...
Spark's user avatar
  • 1