Exact consecutive-bin coefficient merging
DefinitionTaoFivePrimes_RHHighBinningMergenumerical-verificationriemann-zetatao-five-primes
Transparent list algorithm that combines consecutive equal frequency-bin indices by componentwise addition of coefficient lists. No sortedness, correctness, analytic approximation, sign, count or RH statement is asserted.
Definition code
import Definitions.Def_TaoFivePrimes_RHHighDirichletBinning
set_option autoImplicit false
namespace RHHighBinningMerge
open RHHighDirichletBinning
noncomputable def auxiliary : Nat→List (Int×Int)→List (Nat×List (Int×Int))→List (Nat×List (Int×Int))
| j,acc,[] => [(j,acc)]
| j,acc,(m,a)::gs => if m=j then auxiliary j (add acc a) gs
else (j,acc)::auxiliary m a gs
noncomputable def merge : List (Nat×List (Int×Int))→List (Nat×List (Int×Int))
| [] => []
| (j,a)::gs => auxiliary j a gs
end RHHighBinningMerge
noncomputable def TaoFivePrimes_RHHighBinningMerge : Nat := 24
Source
Platt DOI10.1090/mcom/3198. Original surrounding attribution sometik179 c9908072-d99a-4431-aad8-a72c6352619a and Gabewhigham.