On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$

Details On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$ On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$

2008-12-13

arxiv.org/abs/0812.2522v1

Mathematics

Combinatorics

Scientific paper

A {\em Wakeford pairing} from $S$ onto $T$ is a bijection $\phi : S \to T$ such that $x\phi(x)\notin T,$ for every $x\in S.$ The number of such pairings will be denoted by $\mu(S,T)$. Let $A$ and $ B$ be finite subsets of a group $G$ with $1\notin B$ and $|A|=|B|.$ Also assume that the order of every element of $B$ is $\ge |B|$. Extending results due to Losonczy and Eliahou-Lecouvey, we show that $\mu(B,A)\neq 0.$ Moreover we show that $\mu(B,A)\ge \min \{\frac{||B|+1}{3},\frac{|B|(q-|B|-1)}{2q-|B|-4}\},$ unless there is $a\in A$ such that $|Aa^{-1}\cap B|=|B|-1$ or $Aa^{-1}$ is a progression. In particular, either $\mu(B,B) \ge \min \{\frac{||B|+1}{3},\frac{|B|(q-|B|-1)}{2q-|B|-4}\},$ or for some $a\in B,$ $Ba^{-1}$ is a progression.

Affiliated with

Also associated with

No associations

Rating

On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Group bijections $φ$ with $φ(B)=A$ and $\forall a\in B, aφ(a) \notin A$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-193512