OurBigBook
About
$
Donate
Sign in
Sign up
Alternating-permutation convolution
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Combinatorics
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Splitting an
alternating permutation
at its maximum gives
2
A
n
+
1
=
∑
k
=
0
n
(
k
n
)
A
k
A
n
−
k
,
(1)
where
A
n
counts up-down
permutations
and complementation identifies up-down with down-up
permutations
.
Ancestors
(4)
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2023
/
ia
/
Paper 4
/
1F
/
b
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version