Signpost sequence

In mathematics and apportionment theory, a signpost sequence is a sequence of real numbers, called signposts, used in defining generalized rounding rules. A signpost sequence defines a set of signposts that mark the boundaries between neighboring whole numbers: a real number less than the signpost is rounded down, while numbers greater than the signpost are rounded up.^[1]

Signposts allow for a more general concept of rounding than the usual one. For example, the signposts of the rounding rule "always round down" (truncation) are given by the signpost sequence ${\displaystyle s_{0}=1,s_{1}=2,s_{2}=3\dots }${\displaystyle s_{0}=1,s_{1}=2,s_{2}=3\dots }

Mathematically, a signpost sequence is a localized sequence, meaning the ${\displaystyle n}${\displaystyle n}th signpost lies in the ${\displaystyle n}${\displaystyle n}th interval with integer endpoints: ${\displaystyle s_{n}\in (n,n+1]}${\displaystyle s_{n}\in (n,n+1]} for all ${\displaystyle n}${\displaystyle n}. This allows us to define a general rounding function using the floor function:

${\displaystyle \operatorname {round} (x)={\begin{cases}\lfloor x\rfloor &x<s(\lfloor x\rfloor )\\\lfloor x\rfloor +1&x>s(\lfloor x\rfloor )\end{cases}}}${\displaystyle \operatorname {round} (x)={\begin{cases}\lfloor x\rfloor &x<s(\lfloor x\rfloor )\\\lfloor x\rfloor +1&x>s(\lfloor x\rfloor )\end{cases}}}

Where exact equality can be handled with any tie-breaking rule, most often by rounding to the nearest even.

In the context of apportionment theory, signpost sequences are used in defining highest averages methods, a set of algorithms designed to achieve equal representation between different groups.^[2]

• Sequences and series
• Apportionment methods
• Mathematics stubs
• Political science stubs

• Articles with short description
• Short description matches Wikidata
• All stub articles