On the enumeration of the roots of arbitrary separable equations using HW hyper-Lambert maps

Ioannis Galidakis; Ioannis Papadoperakis

arxiv: 1907.07204 · v1 · pith:7ERVMRIQnew · submitted 2019-07-16 · 🧮 math.CV

On the enumeration of the roots of arbitrary separable equations using HW hyper-Lambert maps

Ioannis Galidakis , Ioannis Papadoperakis This is my paper

Pith reviewed 2026-05-24 20:27 UTC · model grok-4.3

classification 🧮 math.CV

keywords HW hyper-Lambert mapsroot enumerationseparable equationsRiemann surface projectionstranscendental equationsbranch enumeration

0 comments

The pith

HW hyper-Lambert maps enumerate all roots of arbitrary separable equations f=0 through projection onto their branches.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that any separable equation can be solved by mapping its roots onto the branches of the HW hyper-Lambert maps, which yields a complete enumeration of those roots. The enumeration arises from projecting a pin-line on the Riemann surface of the equation through the HW maps. A reader would care because this turns root-finding into a systematic listing of projection points rather than ad-hoc solving. The approach applies to arbitrary separable f without requiring closed-form expressions for the roots themselves.

Core claim

The roots of an arbitrary separable equation f=0 are enumerated effectively as the projection points of a pin-line on the Riemann surface of f onto and at the branches of the HW hyper-Lambert maps.

What carries the argument

The HW hyper-Lambert maps, which supply the branching structure and projection mechanism that turns root locations into an ordered list of points on those branches.

If this is right

Any separable equation admits a root list indexed by the branches of the HW maps.
The method converts the problem of locating roots into one of tracing projections on a known Riemann surface structure.
Enumeration works uniformly for equations that lack elementary closed-form solutions.
The pin-line projection supplies an ordering of the roots without separate case analysis.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same projection technique might allow ordering of roots by real part or modulus once the maps are fixed.
Numerical approximation of the enumerated roots could follow by evaluating the inverse branches at chosen points.
The framework may extend to counting roots inside specific contours by restricting the pin-line segments.

Load-bearing premise

The HW hyper-Lambert maps are equipped with branching and projection properties sufficient to capture every root of any separable equation.

What would settle it

A concrete separable equation f whose complete set of roots cannot be recovered as projections onto the branches of the HW maps.

read the original abstract

In this article we use the HW maps to solve arbitrary equations f=0, by providing an effective enumeration of the roots of f, as these project on and at the branches of the HW maps. This is just an enumeration of the projection points (roots) of a pin-line on the Riemann surface of f through HW.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The abstract claims an enumeration of roots for separable equations via projection on HW hyper-Lambert map branches, but supplies no definitions, constructions, or checks, so the claim cannot be evaluated.

read the letter

The main thing to know is that the paper says it solves arbitrary separable equations f=0 by enumerating their roots as projections of a pin-line onto the branches of HW hyper-Lambert maps. That is the entire stated contribution. The approach treats root location as a geometric projection on a Riemann surface through these maps, which extends the familiar use of multi-valued functions like Lambert W for solving equations. If the maps carry the right branching, this could in principle give a systematic listing of all solutions without ad-hoc search. The paper does attempt to frame the problem in terms of an explicit enumeration rather than numerical approximation, which aligns with work on special functions in complex analysis. That framing is the only concrete element visible. The soft spots are large and central. The abstract gives no definition of the HW maps, no description of how the pin-line is built, and no argument showing that every root is hit exactly once with no duplicates or omissions. The key assumption—that the branching structure supports complete enumeration for arbitrary separable f—remains untested here. Without any derivation, example, or verification, it is impossible to tell whether the method works or whether it reduces to circular use of the authors' own prior definitions. The full manuscript would need to supply those pieces before any assessment of soundness or novelty is possible. This is aimed at a narrow group of researchers already working on generalizations of the Lambert W function and complex root-finding. A reader in that niche might want to see the details if they exist, but the abstract alone does not give enough to decide. I would not send this to peer review until the authors provide the missing definitions, at least one worked example, and a check that the enumeration is complete and non-redundant.

Referee Report

2 major / 0 minor

Summary. The manuscript claims to solve arbitrary separable equations f=0 by providing an effective enumeration of their roots via projection onto the branches of HW hyper-Lambert maps; this is described as enumerating the projection points of a pin-line on the Riemann surface of f through the HW maps.

Significance. If the claimed enumeration were rigorously established with explicit constructions and proofs of completeness and uniqueness, the work could introduce a new technique in complex analysis for root-finding using specialized multi-valued functions. The abstract alone supplies no such development, leaving the potential significance unassessable.

major comments (2)

Abstract: the central claim that roots 'project on and at the branches of the HW maps' and that this yields an 'effective enumeration' is stated without any definition of the HW hyper-Lambert maps, the pin-line construction, or the projection mechanism, so the claim cannot be verified or falsified from the given text.
Abstract: no argument, theorem, or example is supplied showing that every root of an arbitrary separable f is hit exactly once by the described projection, leaving the completeness and injectivity of the enumeration unsupported.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the comments. We respond point by point to the major comments below.

read point-by-point responses

Referee: Abstract: the central claim that roots 'project on and at the branches of the HW maps' and that this yields an 'effective enumeration' is stated without any definition of the HW hyper-Lambert maps, the pin-line construction, or the projection mechanism, so the claim cannot be verified or falsified from the given text.

Authors: We agree the abstract is too concise and omits explicit definitions. The body of the manuscript introduces the HW hyper-Lambert maps, the pin-line on the Riemann surface, and the projection, but the abstract does not. We will revise the abstract to include brief definitions of these terms so the central claim can be assessed from the abstract alone. revision: yes
Referee: Abstract: no argument, theorem, or example is supplied showing that every root of an arbitrary separable f is hit exactly once by the described projection, leaving the completeness and injectivity of the enumeration unsupported.

Authors: The manuscript frames the enumeration as the set of projection points of the pin-line through the branches of the HW maps. We acknowledge that neither the abstract nor the provided text contains an explicit theorem, proof, or example establishing that every root is attained exactly once. We will add a formal theorem statement together with a sketch of the completeness and uniqueness argument in the revised manuscript. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The abstract and title describe an enumeration of roots for separable equations f=0 via projection onto branches of HW hyper-Lambert maps, presented as an application of those maps. No equations, definitions, or derivation steps are supplied that reduce the enumeration result to a quantity defined in terms of itself, a fitted parameter renamed as prediction, or a self-citation chain whose load-bearing premise is unverified. The maps are invoked as an established tool whose branching properties enable the enumeration, without any exhibited self-definitional loop or ansatz smuggling within the provided text. This qualifies as a normal non-finding for a paper whose central claim rests on external map properties rather than internal reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim depends on the existence and projection properties of HW hyper-Lambert maps, which are not evidenced or derived in the abstract and appear to be a domain-specific construct.

axioms (1)

domain assumption HW hyper-Lambert maps possess well-defined branches that permit complete projection-based enumeration of roots for any separable equation f=0.
Invoked directly in the abstract as the mechanism for solving and enumerating roots.

invented entities (1)

HW hyper-Lambert maps no independent evidence
purpose: Provide the branched structure for projecting and enumerating roots of f=0.
The method is built around these maps; no independent evidence or external validation is mentioned in the abstract.

pith-pipeline@v0.9.0 · 5573 in / 1042 out tokens · 25771 ms · 2026-05-24T20:27:29.184290+00:00 · methodology

On the enumeration of the roots of arbitrary separable equations using HW hyper-Lambert maps

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)