Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
500 views

Rank and frequency of permutations

(a) Let $[n] = \{1,\dotsc,n\}$, and let $\pi:[n]\to [n]$ be a permutation. Define an $n$-by-$n$ matrix $A=A(\pi)$ as follows: $A_{i,j}=1$ if $j>i$ and $\pi(j)>\pi(i)$, $A_{i,j}=-1$ If $j<i$ ...
2 votes
1 answer
308 views

The number of unitary circulant matrices over a finite field $\mathbb{F}_{q^2}$

I asked this question in MSE few days ago but there was no response. Suppose $\mathbb{F}=\mathbb{F}_{q^2}$, where $q$ is a prime power. The conjugate of elements in $\mathbb{F}$ is defined by $\...
15 votes
1 answer
1k views

Free subgroups of $\mathrm{GL}(2,\mathbb{Z})$

Is there a bound $B$ such that every 2-generator subgroup $G = \langle a, b \rangle \le {\rm GL}(2,\mathbb{Z})$ whose generators do not satisfy a relation of length $\leq B$ is free? If it exists, ...
5 votes
1 answer
503 views

does this set of permutations form a group? And more

Consider the group of $mn\times mn$ permutation matrices $\mathfrak{S}_{mn}$ and partition each such matrix $P$ into $n^2$ blocks of $m\times m$ matrices $Q_{i,j}$. Now, transpose each $Q_{i,j}$ (...
1 vote
1 answer
171 views

transposing "unrimmed" permutations

Denote the set of $n\times n$ permutation matrices by $\mathfrak{S}_n$. The ordinary transpose preserves this group. Given $P\in\mathfrak{S}_n$, construct the $n\times n$ matrix ${}^tP$ according to ...
3 votes
1 answer
195 views

Switching representatives of right coset in a paper on fundamental domain of tree of GL(2)

I have a question concerning the following paper: "The fundamental domain of the tree of GL(2) over the function field of an elliptic curve" by Shuzo Takahashi. (1993, Duke Math. J., Vol. 72, No. 1). ...
3 votes
2 answers
1k views

A problem about Determinant of sum of permutation matrices

Let $w_1$ and $w_2$ be two permutations of $\{1, \cdots , k\}$ such that for all $1\leq i \leq k$, $w_1(i)\neq w_2(i)$. Let $m$ and $n$ be two relatively prime integers. Then is there exist two ...