Paper detail

Integer sequences and k-commuting permutations

Let $β$ be any permutation on $n$ symbols and let $c(k, β)$ be the number of permutations that $k$-commute with $β$. The cycle type of a permutation $β$ is a vector $(c_1, \dots, c_n)$ such that $β$ has exactly $c_i$ cycles of length $i$ in its disjoint cycle factorization. In this article we obtain formulas for $c(k, β)$, for some cycle types. We also express these formulas in terms of integer sequences as given in "The On-line Encyclopedia of Integer Sequences" (OEIS). For some of these sequences we obtain either new interpretations or relationships with sequences in the OEIS database.

preprint2015arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.