🔢 mathematics

Median-Extremes Alternation

This paper introduces the Median-Extremes Alternation (MEA) permutation, a deterministic family generated by alternating median and extreme element extractions, and proves that these permutations possess a rigid structure characterized by being alternating with parity-dependent types, having a descent set determined by $n$ , and satisfying the exact inversion formula $\text{inv}(\pi_n) = \lfloor(n-1)^2/4\rfloor$ .

Original authors: David Carr

Published 2026-03-19

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: David Carr

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a line of people standing in perfect order, from the shortest (1) to the tallest (n). Your job is to create a new lineup by pulling people out of this line one by one, but you have to follow a very specific, rhythmic game of "Middle vs. Ends."

This paper, written by David Carr, introduces a new family of number patterns called Median-Extremes Alternation (MEA) permutations. While the rules sound simple, the resulting patterns turn out to be surprisingly rigid and predictable, almost like a mathematical dance.

Here is the breakdown of the paper in everyday language:

1. The Game: How to Build the Line

Imagine you have a line of people numbered 1 to $n$ . You want to create a new line by removing them one by one. You follow these steps, alternating between two moves:

Move A (The Middle): Look at the current line. If there's an odd number of people, grab the exact person in the middle. If there's an even number, grab the two people right in the middle. Put them at the end of your new line.
Move B (The Ends): Look at the remaining people. Grab the shortest person and the tallest person left in the line. Put them at the end of your new line.
Repeat: Keep switching between Move A and Move B until everyone is in the new line.

Example:
Let's try with 5 people: [1, 2, 3, 4, 5]

Middle: The middle of 5 is 3. New line: [3]. Remaining: [1, 2, 4, 5].
Ends: The ends are 1 and 5. New line: [3, 1, 5]. Remaining: [2, 4].
Middle: The middle of 2 is 2 and 4 (the two middle ones). New line: [3, 1, 5, 2, 4].
Done! The final pattern is 3, 1, 5, 2, 4.

2. The Big Surprise: The "Zig-Zag" Dance

You might think this random-looking process would create a messy, chaotic line. But the paper proves something amazing: The result is always a perfect "Zig-Zag."

If you start with an odd number of people, the new line goes Down, Up, Down, Up... (High, Low, High, Low).
If you start with an even number, it goes Up, Down, Up, Down... (Low, High, Low, High).

It's like a pendulum that never stops swinging. No matter how big the group is, the pattern is perfectly predictable. The paper calls these Alternating Permutations.

3. The "Magic Number" of Messiness (Inversions)

In math, an "inversion" is a pair of numbers that are out of order (like having a 5 before a 2). The paper calculates exactly how many "messy pairs" exist in this new line.

The formula is surprisingly simple:
$\text{Messiness} = \text{Round down of } \frac{(n-1)^2}{4}$

If you have 5 people, the messiness is 4.
If you have 10 people, the messiness is 20.

The author notes that this sequence of numbers (0, 0, 1, 2, 4, 6, 9...) is famous in math circles (it's called the "quarter-squares" sequence), but finding a simple rule that generates it this way is new.

4. The Secret Recipe (Recursion)

The paper also reveals a "secret recipe" for how these lines are built. Instead of simulating the whole game, you can build the line by taking a smaller version of the game and pasting a few numbers in front of it.

The Odd Rule: To build a line of size 5, you take the line for size 3, add a few specific numbers to the front, and shift the rest of the numbers up.
The Even Rule: To build a line of size 6, you take the line for size 2, add a few numbers to the front, and shift the rest.

This means the whole family of patterns is connected like a fractal; the big patterns are just smaller patterns wearing a different coat.

5. Why Does This Matter?

Usually, when you create a random-looking process, the results are chaotic. Here, a very simple set of rules (Middle, then Ends, then Middle...) creates a structure that is:

Predictable: You know exactly where every number will go.
Symmetric: It follows a strict up-down rhythm.
Calculable: You can instantly know how "mixed up" the line is without counting every single pair.

The Takeaway

David Carr's paper is like discovering a new type of crystal. You start with a simple set of instructions (pick the middle, pick the ends), and out pops a structure with a rigid, beautiful, and mathematically perfect shape. The paper provides the blueprints (formulas) to understand exactly how this crystal grows, how it flips, and how to reverse the process to get back to the original line.

It's a reminder that even in the world of numbers, simple rules can create complex, elegant, and surprising order.

Based on the provided paper "Median-Extremes Alternation Permutations: Initial Structural Results" by David Carr (March 2026), here is a detailed technical summary.

1. Problem Statement

The paper investigates a specific, deterministic family of permutations generated by an alternating extraction process on the ordered set $[n] = \{1, 2, \dots, n\}$ . The core problem is to characterize the structural properties of the resulting permutation $\pi_n$ , which is formed by reading the extracted elements in the order they are removed.

The extraction process alternates between two operations:

Median Step: Remove the middle element(s) of the current list.
- If the list length is odd ( $2k+1$ ), remove the unique middle element.
- If the list length is even ( $2k$ ), remove the two middle elements (left-to-right).
Extreme Step: Remove the minimum and maximum elements of the remaining list.

The process begins with a median step and alternates until the list is exhausted. The resulting sequence is the Median-Extremes Alternation (MEA) permutation, denoted $\pi_n$ . While the construction rule is elementary, the paper posits that the resulting permutations exhibit unexpectedly rigid combinatorial structures.

2. Methodology

The author employs a structural analysis approach based on recursive decomposition and mathematical induction.

Recursive Decomposition: The primary method involves analyzing the first few steps of the extraction process to derive a recurrence relation. The paper demonstrates that $\pi_n$ can be constructed by concatenating a short, parity-dependent prefix with a "rank-shifted" copy of a smaller MEA permutation ( $\pi_{n-2}$ or $\pi_{n-4}$ ).
Relabeling Maps: To establish the recursion, the author defines specific bijections (relabeling maps) that transform the remaining values after the initial extraction steps back into the domain of a smaller permutation.
Inductive Proofs: Once the recursive structure is established, the author uses induction to prove properties regarding the alternating nature of the permutations, their descent sets, inversion numbers, and the structure of their inverses.

3. Key Contributions and Results

A. Exact Recursive Structure (Proposition 3.1)

The paper establishes that $\pi_n$ is built from a prefix followed by a transformed version of a smaller MEA permutation:

Odd Case ( $n=2m+1$ ):
$\pi_{2m+1} = [m+1, 1, 2m+1] \parallel T_{2m+1}$
where $T_{2m+1}$ is a rank-shifted copy of $\pi_{2m-2}$ .
Even Case ( $n=2m$ ):
$\pi_{2m} = [m, m+1, 1, 2m] \parallel T_{2m}$
where $T_{2m}$ is a rank-shifted copy of $\pi_{2m-4}$ .

B. Alternating Structure and Descent Set (Theorem 4.1 & Corollary 4.2)

The MEA permutations are proven to be alternating permutations (also known as zigzag permutations), with the specific pattern determined solely by the parity of $n$ :

If $n$ is odd: $\pi_n$ is of down-up type ( $\pi_n(1) > \pi_n(2) < \pi_n(3) > \dots$ ).
If $n$ is even: $\pi_n$ is of up-down type ( $\pi_n(1) < \pi_n(2) > \pi_n(3) < \dots$ ).

Consequently, the descent set $Des(\pi_n)$ is completely determined:

For odd $n$ : $Des(\pi_n) = \{1, 3, 5, \dots, n-2\}$ .
For even $n$ : $Des(\pi_n) = \{2, 4, 6, \dots, n-2\}$ .

C. Inversion Number and Sign (Theorem 5.1 & Corollary 5.2)

The paper derives an exact closed-form formula for the number of inversions, $inv(\pi_n)$ :
$inv(\pi_n) = \left\lfloor \frac{(n-1)^2}{4} \right\rfloor$
This sequence corresponds to the quarter-squares sequence (OEIS A002620): $0, 0, 1, 2, 4, 6, 9, 12, 16, \dots$ .

From this, the sign of the permutation is characterized:
$\text{sgn}(\pi_n) = (-1)^{\lfloor (n-1)^2/4 \rfloor}$
Specifically, $\pi_n$ is an odd permutation if and only if $n \equiv 3 \pmod 4$ .

D. Inverse Permutation (Proposition 6.1)

The recursive structure allows for an exact recursive description of the inverse permutation $\pi_n^{-1}$ . The paper provides explicit formulas for the positions of the first few elements and a recursive rule for the remaining elements based on the inverse of the smaller MEA permutation.

4. Significance

Rigidity from Simplicity: The work highlights how a computationally trivial, deterministic rule (alternating median and extreme removal) generates a family of permutations with highly rigid and predictable combinatorial properties.
Connection to Known Sequences: The inversion numbers align perfectly with the quarter-squares sequence, linking this specific construction to a well-known integer sequence in the OEIS.
New Class of Alternating Permutations: The MEA family adds a distinct, recursively defined subclass to the landscape of alternating permutations, characterized by a parity-dependent descent set and a simple inversion formula.
Foundation for Further Study: The paper isolates these initial structural properties, setting the stage for future research into non-recursive formulas, cycle structures, iteration orders, and extremal interpretations of the associated inversion graphs.

In summary, David Carr's paper formalizes the MEA construction, proving that despite its simple generation rule, it yields a mathematically elegant family of permutations with exact recursive definitions, predictable alternating patterns, and closed-form statistical properties.