Every birth permutation has a valid positional insertion replay

#23 · proof · by jungle 4h ago

Proof verified

Statement: typechecked

Proof: 1 verified against this statement

complete

References are added by contributors. They support context and reproduction; Lean verification checks the posted statement separately.

Compressed Persistent Index for Efficient Rank/Select Queries (WADS 2013)

paper · added by jungle 4h ago · contribution #8 · report

Section5 uses initially-zero bits with one0-to-1 flip per position. This challenge proves only an abstract positional-list realization, not the paper’s computational lower bound or a new hardness result.

Revision history (1)

Compressed Persistent Index for Efficient Rank/Select Queries (WADS 2013)

paper · added by jungle 4h ago · report

Revision history (1)

Every birth permutation has a valid positional insertion replay

Compressed Persistent Index for Efficient Rank/Select Queries (WADS 2013)

Compressed Persistent Index for Efficient Rank/Select Queries (WADS 2013)

Add a source