Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
0
votes
1
answer
126
views
Expected value of maximal distance between neighbors in permutations
Let $S_n$ denote the set of permutations (bijections) $\pi:[n]\to [n]$. …
3
votes
1
answer
241
views
Minimal neighbor distance in permutations
Let $S_n$ denote the set of permutations (bijections) $\pi:[n]\to [n]$. …
1
vote
1
answer
81
views
Cycling through $\{0,1\}^n$ by shifting and applying a $n$-ary function
This question is motivated by Linear Feedback Shift Registers, which cycle through $\{0,1\}^n \setminus \{(0,\ldots,0)\}$ by shifting and applying a small set of XOR operations.
Let $n>1$ be an intege …
17
votes
1
answer
926
views
Fraction of $S_n$ reachable by using every transposition once as $n\to\infty$?
For $n\in \mathbb{N}$ let $S_n$ denote the set of permutations (bijections) $\pi: \{0,\ldots,n-1\}\to \{0,\ldots,n-1\}$. …
4
votes
1
answer
375
views
Is $(\mathbb{R},+)$ isomorphic to a subgroup of $S_\omega$?
Is $(\mathbb{R},+)$ isomorphic to a subgroup of $S_\omega$, the group of permutations of the set of non-negative integers $\omega$? …
5
votes
2
answers
255
views
Neighboring number of a permutation
For any positive integer $n\in\mathbb{N}$ let $S_n$ denote the set of all bijective maps $\pi:\{1,\ldots,n\}\to\{1,\ldots,n\}$. For $n>1$ and $\pi\in S_n$ define the neighboring number $N_n(\pi)$ as t …
0
votes
1
answer
215
views
Is there a lop-sided permutation $\pi:\mathbb{N}\to\mathbb{N}$? [closed]
For any $A\subseteq \mathbb{N}$ we let the (lower) density of $A$ be defined by $$d(A) = \liminf_{n\to\infty}\frac{|A\cap\{0,\ldots,n\}|}{n+1}.$$
If $\pi:\mathbb{N}\to\mathbb{N}$ is a permutation (bij …
2
votes
1
answer
57
views
Left-shift cycle generating maps $f:\{0,1\}^{c_0}\to\{0,1\}$ for fixed length $c_0$
This is a strengthening of an older question.
Is there a positive integer $c_0$ with the following property?
For every integer $n\geq c_0$ there is a function $f:\{0,1\}^{c_0}\to\{0,1\}$ such that th …
1
vote
0
answers
106
views
Expected value of maximal cycle length in fixed-point free bijections
By $\FF_n$ we denote the collection of fixed-point-free permutations $\pi:\n\to\n$. For any $\pi \in \FF_n$ we let $\lc(\pi)$ be the lengh of the longest cycle of $\pi$. …
1
vote
1
answer
149
views
Chromatic number of the insert-and-shift graph on $S_n$
Let $S_n$ be the collection of bijections $\varphi:\{1,\ldots,n\}\to \{1,\ldots,n\}$. In an earlier question, the insert-and-shift graph structure was introduced on $S_n$ and the resulting graph is ca …
11
votes
1
answer
1k
views
Order of the "children's card shuffle"
Let $S_k$ be the group of permutations $\pi:\{1,\ldots,k\} \to \{1,\ldots,k\}$ for any positive integer $k$. …
2
votes
1
answer
327
views
Transversal of $\mathbb{N}\times\mathbb{N}$
Motivation. I am trying to make an interesting infinite version out of this fascinating problem from the Russian mathematical olympiad:
There are $c$ flavours of cookies, we are given $n$ cookies of …
6
votes
0
answers
254
views
Maximal bijection-dodging families on $\mathbb{N}$
We say that a family ${\cal S}\subseteq{\cal P}(\mathbb{N})$ is bijection-dodging if there is a bijection $\varphi:\mathbb{N}\to\mathbb{N}$ with $\varphi(T)\notin {\cal S}$ for all $T\in{\cal S}$.
Gi …
8
votes
2
answers
506
views
Bijection $\varphi:\mathbb{N}\to\mathbb{N}$ that distorts every finite arithmetic progression
Let $\mathbb{N}$ denote the set of non-negative integers. We say $A\subseteq \mathbb{N}$ is a finite arithmetic progression if there are $a, n, d\in\mathbb{N}$ with $d \geq 1$ and $n \geq 2$ such that …
2
votes
2
answers
295
views
"Haar-like" measure on $S_\omega$
If yes: Let $M$ be the set of "finitely bounded permutations of $\omega$, that is, $$M=\{\pi \in S_\omega: \exists K\in\omega(\forall n\in \omega(|\pi(n)-n| < K))\}.$$ What is the Haar measure of $M$, …