# Tagged Questions

52 views

### Finding Required Permutation

I have numbers from $1$..$n$. I want to find number of permutation from all $n!$ permutation where the numbers have following arrangement. $L$ $G$ $L$ $G$ $L$ or $G$ $L$ $G$ $L$ $G$. Where L means ...
36 views

178 views

### Equation to find possible combinations of combining lists while retaining order

Lets say I have two ordered lists of size n, [A1, A2, ..., An] and [B1, B2, ...,Bn]. I want to find all the possible ...
57 views

### Matrix Representation of Integer Series

I would like some feedback regarding this process or the meaning of this process. Let say that I have a discrete time series: S = [1 2 3 4 5] And that I represent this serie by a stochastic matrix M ...
347 views

### Summation of a finite series involving permutations.

$$\large \sum_{i = 2}^{25}P(i,2)$$ $P$ stands for "permutations".
267 views

### How to get the N-th word in a sequence

Suppose I have an alphabet (e.g. consisting of ABCDEF) and a lexicographic order is defined i.e. A -> B ... -> F -> AA -> AB .. -> AF -> BA -> BB -> ... -> BF ... -> FF -> AAA -> ... Is there a ...
Given two finite ordered sequences with possibly non-unique elements all greater than one: $A,B \in \mathcal{Z}_{>1}$. Given that we have: \begin{eqnarray} |A| &= |B| \\ \Pi_{x \in ...
Given an integer $n$, define $s(n)$ to be the length of the shortest sequence $S = (a_1, \cdots a_{s(n)})$ such that every permutation of $\{1,\cdots,n\}$ is a subsequence of $S$. If $n=1$, then \$S = ...