For questions related to permutations, which can be viewed as re-ordering a collection of objects.

learn more… | top users | synonyms

11
votes
0answers
391 views

Sorting of prime gaps

Let $g_i $ be the $i^{th}$ prime gap $p_{i+1}-p_i.$ If we re-arrange the sequence $ (g_{n,i})_{i=1}^n$ so that for any finite $n$ the gaps are arranged from smallest to largest we have a new sequence ...
7
votes
0answers
191 views

Citation for subset complement result

Let $S = \{s_1, \ldots, s_n\} \subset \{1, \ldots, 2n\}$. Consider two operations on $S$, unfortunately both called complement in different setting: let $A(S) = \{1, \ldots, 2n\} \setminus S$ (set ...
6
votes
0answers
40 views
+50

Product of permutations of consecutive numbers yields arithmetic sequence

Let $n\geq 3$ be an integer, and $a,b$ be positive integers. Let $c_1,\ldots,c_n$ be a permutation of $a,a+1,\ldots,a+(n-1)$, and $d_1,\ldots,d_n$ be a permutation of $b,b+1,\ldots,b+(n-1)$. Is it ...
6
votes
0answers
104 views

Knuth equivalence of unshuffles

For any permutation $\sigma\in S_k$ and any $i\in\left\lbrace 1,2,...,k\right\rbrace$, I will denote $\sigma\left(i\right)$ by $\sigma_i$. For any word $w$, I will denote by $\mathrm{st}w$ the ...
6
votes
0answers
62 views

functions representable as a sum of two permutations

I am trying to prove that for every function $f:\mathbb{Z}/n\mathbb{Z}\to \mathbb{Z}/n\mathbb{Z}$ satisfying $\sum_if(i)=0$, there exist permutations $\pi_1, \pi_2:\mathbb{Z}/n\mathbb{Z}\to ...
6
votes
0answers
119 views

Expression of basis vectors of permutation modules in different bases.

Write $[n]:=\{1,\ldots,n\}$. For a partition $\lambda\vdash n$, I will write $[\lambda]$ for the Specht module that corresponds to $\lambda$, i.e. the complex vector space spanned by all standard ...
5
votes
0answers
186 views

Factorizations in the symmetric group

Notation notes: The cycle $(i,i+1,\dots,j)\in S_n$ is the permutation $(1)(2)...(i,i+1,\dots,j)\dots(n)$ in cycle notation. Motivation Given a factorization of a permutation into certain cycles ...
5
votes
0answers
134 views

How find this $aA_{m+1}=\overline{\sigma_{0}\sigma_{1}\sigma_{2}\cdots\sigma_{m}}$

Question let $m$ is positive numbers,and such $m\ge 5$,and $$A_{m+1}=\overline{1234\cdots m}=1\times (m+1)^{m-1}+2\times (m+1)^{m-2}+\cdots+(m-1)\times (m+1)+m$$(or see ...
4
votes
0answers
49 views

Permutation order statistics integral

Let $U_i$ be $[0,1]$ i.i.d. uniform random variables, for $i=1,\ldots,n$. As an example, let $n=3$. Now pick an ordering, say $x_1>x_2<x_3$. and consider the order statistics integral ...
4
votes
0answers
205 views

Special Products of Transpositions

[Edit. Significantly expanded to add examples and (I hope) clarification. Feel free to skim by reading the gray boxes.] A colleague asked me for insights on a collection of special permutations, ...
4
votes
0answers
101 views

Number of ways to order a list of permutations by swapping

I want to solve a problem and I have no idea how or where to begin. I don't even know if it's possible to solve. I tried to find any clues in books about discrete maths but I didn't find anything that ...
4
votes
0answers
108 views

Wikipedia's Cayley Table and Pictures for 3 by 3 Permutation Matrices

Are there any explanations or clarifications of the pictures at https://en.wikipedia.org/wiki/Permutation_matrix#Permutation_of_rows_and_columns? ...
4
votes
0answers
90 views

Permutation: How many ways to put 7 people in 10 rooms?

How many ways can 7 people be placed into 10 rooms, if (only) 2 of them can’t share a room with anyone? I'm not sure how to go about this, mostly because of the "share a room" bit. I'm thinking I ...
4
votes
0answers
75 views

Selecting k numbers out of N sorted numbers to a minimize a condition/Formula

A sorted list of $\mathbf N$ numbers is given. $X_1$ $\le$ $X_2$ $\le$ $X_3$ $\le$ .... $\le$ $X_N$ Select $\mathbf K$ Numbers - $Y_1$ , $Y_2$ , $Y_3$ , ..... , $Y_K$ - Such that the following ...
4
votes
0answers
123 views

Is there a name for such matrices

Let $Z$ be a $K \times K$ matrix. All its left diagonal elements are zero. Further it satisfies the following properties: 1.) $Z[ i ][ j ] = Z[j][i] > 0$ for $1 ≤ i < j ≤ K$. 2.) $Z[i][j]$ ...
4
votes
0answers
44 views

Classification of $n \times n$ matrix in which each two components differ in each row and column up to automorphism

Suppose, we define a class $A$ of $n \times n$ matrix as follows: $$\text{In each Row }i, \text{for any} j,k\ (1 \leq j,k \leq n )\ a_{ij} \neq a_{ik} $$ $$\text{In each Column }l, \text{for any } ...
4
votes
0answers
72 views

Expectation of Reciprocals Involving Permutations

Let $a_i$ be $n$ distinct real numbers. What is the expectation: $$\mathbb E_\sigma \left[ \sum_{i=1}^{n} \frac {1} {a_{\sigma(i)} - \sum_{j=1}^{i-1}a_{\sigma(j)}} \right] $$ where the expectation ...
3
votes
0answers
57 views

Is there away to swap adjacent items in a sequence, such that each permutation occurs once?

Let's us say you have a finite sequence of things. Some are identical, some distinct. For example: $$\langle 2,5,7,2,3\rangle$$ Now, under what conditions can each permutation of a sequence be ...
3
votes
0answers
33 views

Naming elements of a group

Assume one comes across some set and constructs a finite groups out of these elements. One knows what group it is, names the elements from 1 to order of the group and constructs the multiplication ...
3
votes
0answers
25 views

(Counting problem) more challenging Modular N algebraic eqs - for combinatorics-permutation experts

Experts in algebra please help - Part II after Part I: we would like to know the number of solutions for this set of six of modular N algebraic equations: $$ x_1 y_2 = x_2 y_1 \pmod N \qquad (1) \\ ...
3
votes
0answers
160 views

Circular permutations - $n$ sitting at a round table without repeating neighbors

I hope this isn't a duplicate - the problem is to find the number of ways of sitting $n$ people (who initially were sitting in the order $1, 2, \dots,n$, with $1$ and $n$ being neighbors) at a round ...
3
votes
0answers
65 views

Probability/selection problem

Assume that we have $N$ items of $M$ distinct types in a closed bag. We also have $K$ bowls $(K \leq M)$ that can hold only items of same type. In the beginning bowls are empty. And bowls can hold a ...
3
votes
0answers
83 views

Sign of some permutation.

I trying to find the sign of this permutation: $\left(\begin{array}{cccccccccc} 1 & 2 & 3 & \cdots & \cdots & \cdots & \cdots & \cdots & n-1 & n\\ 2 & 4 & ...
3
votes
0answers
51 views

Dinner group rotation. Sixteen couples. Four couples per house. Each couple to meet all the others, no repetition.

I want to set up a rotation of sixteen couples with four couples per house so that all couples eventually have dinner together, no repetition. Each couple is to host one dinner. Meetings are monthly ...
3
votes
0answers
82 views

Counting number of distinct systems

This is an enumeration problem in conjonction with some lottery problems. Given an integer $N \ge 5$. Let a ticket be a set of 5 distinct integers between $1$ and $N$. Given an integer $T$ between ...
3
votes
0answers
119 views

Is there a simple way to show that wreath product is associative?

Is there a simple way to show that wreath product is associative? If your proof is short, please write it explicitly. Thank you.
3
votes
0answers
195 views

Combinatorics Issue without repetitive combinations

We have 26 Boxes Labeled: Box 1, Box 2, Box 3 and so on. The boxes are in a specific order. We also have 15 rocks. Rocks are all identical. meaning Rock 1 is no different then Rock 2, or does not have ...
3
votes
0answers
127 views

Defining a signed involution

We define the displacement of $\pi$ as $\mathrm{disp}(\pi)=\sum_{i=1}^n|\pi(i)-i|$. I know that it's even. Could you help me to find a good signed involution of the set of permutation with ...
3
votes
0answers
536 views

Social Golfer Problem - Quintets

I wrote an article on the Social Golfer Problem, which has questions like: Each day, 16 people play Munchkin in foursomes simultaneously. How many days can they play with no two people playing with ...
2
votes
0answers
21 views

Need a hint with permutations and pigeonhole-principle question

let $\pi_1,\pi_2,\pi_3\in S_{28}$. Help me prove that there are two sub-sequences of 28 with length 4 $i_1< i_2 <i_3<i_4,\ and\ \ j_1<j_2<j_3<j_4$ so that $\pi_q(i_n)=\pi_p(j_n)$ ...
2
votes
0answers
18 views

Different permutations of n identical groups with sizes a, b, and c.

My question is trying to solve how many paths there are from $(x,y)$ to $(tx, ty)$ 3 possible moves are allowed at each step: increment $x$ by $1$ increment $x$ by $2$ increment $y$ by $1$ I know ...
2
votes
0answers
15 views

Is there an effective way to convert a product of 2-cycles into a product of n cycles?

I came across this problem that asks me to convert (12)(34) into a product of 5 cycles. After testing for many different combinations i get (12345)(14352)(12345). The way I do it is this: ...
2
votes
0answers
34 views

Concerning cycles and group actions.

Here is the problem that I have. Let $C=\{a=(ijkl)\}$ be the set of all cycles of length 4 in the symmetric group $S_4$. $S_4$ acts on the set $C$ by conjugation. For every cycle $a\in C$ determine ...
2
votes
0answers
35 views

The number of bijective polynomials of particular degree in a field

I need to know please: In a finite field of q elements how many bijective polynomials exist whose degree are smaller than d?
2
votes
0answers
101 views

Permutation & combination for creating housie tickets

A game called housie (similar to Bingo) is played in India. This game is played by a group of people based on a few rules. I need to know how many unique tickets can be printed in one session of a ...
2
votes
0answers
24 views

Total number of possible graphs in a network with $m$ edges and $n$ vertices?

How do you calculate the total number of possible graphs in a network with $m$ undirected edges and $n$ vertices? No self-loops. For instance, if I have a network with $7$ vertices in it, I want to ...
2
votes
0answers
37 views

What is the motivation behind the study of pattern-avoiding permutations?

There is a ton of research on pattern-avoiding permutations (permutations that do not contain some designated permutation pattern). We're figuring out how to enumerate them, what random ones are ...
2
votes
0answers
64 views

Numbers which are writable as a sum of permutation pairs

We say that $N$ is writable as a sum of permutation pair $\{a,b\}$ if $a+b=N$, $a\neq b$ and $a$ and $b$ are permutations of each other (e.g. $321 = 156 + 165 = 147 + 174 = ... $). Looking at 3-digit ...
2
votes
0answers
63 views

Drawing a Truncated Octahedron

I'm trying to draw a truncated octahedron in MATLAB. This is also known as a permutahedron so my strategy is to link up all the vertices via adjacent transpositions of permutations in $S_4$. What I ...
2
votes
0answers
24 views

'Canonical' form of permutations, product of transpositions

I have such 'canonical' form of permutations: $\prod_{i=0}^n (i \ k_i)$, where $i \leq k_i \leq n$. For example, there are all $6$ permutations of $3$ elements. Of course, some transpositions do ...
2
votes
0answers
66 views

Finding different sum factors of a number

Actual Question : A fair die is thrown k times. What is the probability of sum of k throws to be equal to a number n? My Work: Lets have k buckets, fill-in each bucket with value(1-6) so that the sum ...
2
votes
0answers
91 views

permutation and combination advanced

I have n sets having values less than 100. I need to find how many arrangements could be made if I pick one element from each set such that in the given arrangement there are no duplicates? NOTE: A ...
2
votes
0answers
56 views

What do you call the following operations on a symmetric matrix?

Suppose we have a symmetric matrix of the following form, where the diagonal is always zero: \begin{array}{cccc} 0 & 1 & 1 & 0\\ 1 & 0 & 1 & 1\\ 1 & 1 & 0 & 0\\ 0 ...
2
votes
0answers
82 views

Help calculating Combinations

A boy has n objects to paint, ordered in a row and numbered form left to right starting from 1. There are totally c colors, numbered from 0 to c-1. At the beginning all objects are colored in color ...
2
votes
0answers
235 views

Count swap permutations

Given an array A = [1, 2, 3, ..., n]: ...
2
votes
0answers
39 views

Possible number of permutations

I've generally been seeing the formula nPr = n!/(n-r)! to calculate the number of permutations. But this is the case only when elements cannot be repeated, am I correct? If elements can be repeated, ...
2
votes
0answers
40 views

Find k such that, $\displaystyle\frac{n^{\underline k}}{n^k}<a$

How to find k here $\displaystyle\frac{n^{\underline k}}{n^k}<a$ ? With, $n^{\underline k}=n\cdot(n-1)\cdot...(n-k+1)$ and $(n>k,\ a>0)$ Of course if $k\approx n/2$ the inequality ...
2
votes
0answers
22 views

Permutation elections

During a local campaign eight republician and five democratic candidates are nominated for president. a) If president to be one of thias candidates, how many possibilities are there for the eventual ...
2
votes
0answers
30 views

How many commutative block ciphers are there?

Let $K$ and $M$ and be two finite sets. Let $(G,\circ)$ be the group of permutations over $M$ under composition. Let a (implicitly: block) cipher with key in $K$ and message in $M$ be any application ...
2
votes
0answers
59 views

Composing permutations in factorial notation

Given two permutations $p_1$ and $p_2$ in factorial notation, is there a direct algorithm which computes their composition directly, i.e. without translating to a different notation or via computing ...