Pith. sign in

REVIEW 2 minor

Algebraic values of certain analytic functions defined by a canonical product

T0 review · 0 major / 2 minor · reviewed 2026-05-24 · grok-4.3

Pith's one-line read Transcendental entire functions given as canonical products admit at most C(log H)^n algebraic points of height at most H on suitable subsets of their graphs.

desk verdict Effective C(log H)^n bounds on algebraic points for restricted subsets of graphs of order-<1 canonical products, with explicitly computable constants from the zero data. read the letter →

arxiv 1907.10463 v1 pith:4UTRGU2O submitted 2019-07-24 math.NT math.CV

classification math.NTmath.CV
keywords algebraicpointstranscendentalfunctionscanonicalproductsentireheightboundsorderlessthanoneMillerquestionnumbertheory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper establishes counting bounds for algebraic points on the graphs of certain transcendental entire functions. These functions have order less than one and are expressed via canonical products. On chosen subsets of the graphs the number of points whose coordinates are algebraic numbers of height at most H is bounded by C times (log H) to a power n. Both the constant C and the exponent n are determined by explicit data from the function and can be computed from it. This supplies a partial answer to a question on when such functions take algebraic values at algebraic arguments.

What carries the argument

Canonical product representation of transcendental entire functions of order less than one, which supplies the data needed to derive the explicit counting bounds.

What would settle it

A single canonical product of order less than one whose suitable graph subset contains more than C(log H)^n algebraic points of height H, for the C and n computed from its data, would refute the bound.

Watch

Extended reading notes

Core claim

We give a partial answer to a question attributed to Chris Miller on algebraic values of certain transcendental functions of order less than one. We obtain C(logH)^n bounds for the number of algebraic points of height at most H on certain subsets of the graphs of such functions. The constant C and exponent n depend on certain data associated with the functions and can be effectively computed from them.

Load-bearing premise

The functions under study must be transcendental entire functions of order less than one that admit a canonical product representation, and the subsets of the graphs must be chosen so that the stated bound applies.

Editorial extensions

If this is right

  • The number of algebraic points remains bounded by a power of the logarithm of the height.
  • Both the multiplicative constant and the exponent are computable directly from data attached to the given function.
  • The result applies only after the subsets of the graph are restricted in a manner compatible with the counting method.
  • The bounds give a concrete, effective limitation on algebraic values taken by these low-order transcendental functions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same counting technique might apply to other classes of entire functions once a suitable product representation is available.
  • The bounds could be combined with existing results on algebraic independence to limit simultaneous algebraic values.
  • Effective versions of the bounds open the possibility of explicit numerical checks for small heights on concrete examples.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The manuscript establishes effective bounds of the form C (log H)^n on the number of algebraic points of height at most H lying on certain subsets of the graphs of transcendental entire functions of order less than one that admit a Weierstrass canonical product representation. The subsets are defined by avoidance of small disks around zeros together with growth restrictions compatible with the order bound; the constants C and n are shown to depend explicitly on the zero sequence and order parameter and to be effectively computable from them. The argument reduces the counting problem to standard height estimates from Diophantine geometry applied to the chosen subsets.

Significance. If the result holds, it supplies a concrete partial answer to the question attributed to Chris Miller on algebraic values of such functions, with the notable strength that the constants are effective and computable directly from the function data. The combination of canonical-product estimates with height bounds from Diophantine geometry yields a polylogarithmic count that is falsifiable and reproducible in principle, which strengthens its utility in transcendental number theory and Diophantine geometry.

minor comments (2)
  1. The precise definition of the subsets (avoidance of disks and growth restrictions) is stated in the main theorem but would benefit from an explicit reference to the corresponding section or equation number for the zero-sequence data used in the Weierstrass factorization.
  2. A short remark clarifying how the effective computability of n follows from the order parameter would improve readability, even though the derivation is indicated to be explicit.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. The summary accurately reflects the effective C(log H)^n bounds obtained via canonical product estimates combined with Diophantine height bounds.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity

full rationale

The derivation reduces the counting problem to explicit estimates on the Weierstrass canonical product for entire functions of order less than one, combined with standard height bounds from Diophantine geometry applied to subsets avoiding small disks around zeros. The effective constants C and n are stated to depend explicitly on the zero sequence and order parameter, with no fitted inputs renamed as predictions, no load-bearing self-citations, and no uniqueness theorems imported from the author's prior work. The argument is therefore self-contained against external benchmarks in transcendental number theory and arithmetic geometry.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The claim rests on the standard theory of entire functions of finite order, the definition of canonical products, and the usual height function on algebraic numbers; no free parameters or invented entities are visible in the abstract.

assumptions (2)
  • standard math Entire functions of order less than one admit canonical product representations with the expected growth properties.
    Invoked implicitly by the description of the functions under study.
  • standard math The height function on algebraic numbers satisfies the usual Northcott-type finiteness properties.
    Required for the counting statement to be meaningful.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Algebraic values of certain analytic functions defined by a canonical product." pith.science (2026). https://pith.science/paper/4UTRGU2O

@misc{pith2026190710463,
  author       = {Pith},
  title        = {Pith review of: Algebraic values of certain analytic functions defined by a canonical product},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4UTRGU2O}},
  note         = {Machine review of arXiv:1907.10463}
}
read the original abstract

We give a partial answer to a question attributed to Chris Miller on algebraic values of certain transcendental functions of order less than one. We obtain C(logH)^n bounds for the number of algebraic points of height at most H on certain subsets of the graphs of such functions. The constant C and exponent n depend on certain data associated with the functions and can be effectively computed from them.

Discussion (0). Sign in to comment.

Pith tools

Reviewed May 24, 2026 · model on record in the stance chip above.