betaFeedback

WorksMathematics

A Density Bound for Muñiz's List Reversal

Abstract

Muñiz described the problem of reversing a list of positive integers under the following rules: given a list of distinct positive integers, at each step, one can combine two adjacent entries into their sum or break an entry into two entries with the same sum, under the constraints that after each step the list must contain distinct entries no larger than the original largest entry. The question of what lists are and are not reversible under these rules is studied and an asymptotic upper bound on the density of an irreversible list is established.

Paper details

vlnc:W_2u89wfu3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…