Suppose you have a set, and want to order the k-permutations of the set (for example, the permutations of 5 elements of the set {1, 2, 3, ..., 16}). Is there a fast way of finding 'n' (the "lexicographical index") for, say {3, 16, 4, 11, 7}, and a fast way of finding the 5-permutation such that n = 100000?
2026-04-09 18:15:14.1775758514
Finding the 'n'th k-permutation of a set, and finding 'n' for a given k-permutation (lexicographical ordering)
431 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in ALGORITHMS
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Do these special substring sets form a matroid?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Correct way to prove Big O statement
- Product of sums of all subsets mod $k$?
- (logn)^(logn) = n^(log10+logn). WHY?
- Clarificaiton on barycentric coordinates
- Minimum number of moves to make all elements of the sequence zero.
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
- sources about SVD complexity
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
When you say fast, what do you mean? If you mean a faster way than actually compute all the k-permutations, you actually can treat the problem as finding some element in a base(here the basis coefficients are gonna be Permutation numbers).For example, if you give me the set $[p]=\{1,\ldots ,p\}$, an integer q and an index i you must iteratively compute $\lfloor \frac{i}{\binom{p-n-1}{q-1-n}*(q-1-n)!} \rfloor+1$ (where $\binom{p-n-1}{q-1-n}*(q-1-n)!$ states because you want to choose the other numbers that are gonna be in the sequence and they have an order)and then decrement i in the residue.
For example, suposse you want to calculate the 837th 3-permutation of $[16]$. The first element would be $\lfloor \frac{837}{\binom{16-0-1}{3-1-0}*(3-1-0)!}\rfloor +1= \lfloor \frac{837}{\binom{15}{2}*2!}\rfloor+1=\lfloor \frac{837}{210}\rfloor+1=4$
then you update the i as $837-210*\lfloor \frac{837}{210}\rfloor=207$
$\lfloor \frac{207}{\binom{16-1-1}{3-1-1}*(3-1-1)!}\rfloor +1= \lfloor \frac{207}{\binom{14}{1}*1!}\rfloor+1=\lfloor \frac{207}{14}\rfloor+1=15$ but you put 4, so it's gonna be 16.
update i as $207-14*\lfloor\frac{207}{14}\rfloor=11$ but because you put 4,it's gonna be 13. So the 3-permutation in $[16]$ with index 837 is $\{4,16,13\}$.
I think the complexity is gonna be $O(p*q)$.
For the inverse problem its the same Suposse i give $(a_1,\ldots a_q)$, the index of that permutation in $[p]$ is going to be like $(a_1-1)*\binom{p-1}{q-1}*(q-1)!+(a_2-1-[a_1<a2])*\binom{p-2}{q-2}(q-2)!+\ldots+(a_q-1-|\{j:a_j<a_q\}|)*\binom{p-q}{q-q}*(q-q)!$ I think this must be $O(p*q)$ also because of the binomial numbers.