Statement and scope
Karlheinz Gröchenig, Infinite totally positive matrices: some open problems, Acta Scientiarum Mathematicarum (2026), DOI 10.1007/s44146-026-00264-3, Problem 4.12 asks whether
for every Pólya frequency function and every
Here . The source defines coefficient sign changes by
Thus zeros in the coefficient sequence are skipped when deciding whether its next nonzero term has the opposite sign. Its upper density is
For a locally finite subset , write
Restricting to positive integer lengths does not change this density. Using integer starting points also suffices for the lower bounds below. If a supremum is infinite, the same formulas have their extended-real meaning.
We construct a real sequence for the Gaussian
such that the corresponding nonzero function is entire and
The Gaussian is explicitly listed as a Pólya frequency function in the source following Definition 2.5. This refutes the upper-density inequality and therefore answers the universal assertion in Problem 4.12 negatively. It does not settle the separate lower-density inequality.
1. Finite Gaussian blocks
For every integer , define
All roots of are positive, so
In particular every coefficient is nonzero, and consecutive coefficients have opposite signs. Put
The elementary identity
gives the exact factorization
Consequently has simple real zeros at and changes sign between the successive test points
More precisely,
Define the positive number
Also,
and as , since it is a finite sum of Gaussian translates.
2. Recursive separation of the blocks
Choose even integers recursively. Let . After have been chosen, choose so large that all the following finite families of strict inequalities hold:
Such an even integer exists. In (6), every summand tends to zero as . In (7), the argument of the fixed function tends to . There are only finitely many inequalities at each step, and every right side is positive. One may, for definiteness, choose the least even integer satisfying (5)–(7).
This is an exact recursive definition by explicit elementary functions. No numerical approximation is required to establish existence or any subsequent conclusion.
3. The infinite shift sum
The integer intervals are pairwise disjoint by (5). Define
and at every other integer. The disjointness makes this unambiguous. The support is contained in , and (4) gives
Set
Both equalities are legitimate by absolute local uniform convergence. Indeed, for ,
On every compact subset of , this is bounded independently of , and (8) supplies a summable majorant. The sum is therefore entire. On the real line, , and its representation has , so exactly as required in Problem 4.12.
4. Every block retains its sign changes
Fix and , and evaluate (9) at
At the step when was chosen, (6) made the contribution from all earlier blocks less than in absolute value; for that contribution is zero. Every later block satisfies (7), so its total contribution is bounded by
Thus
The values of at consequently have the same alternating signs as in (2). In particular is not identically zero. Its real zeros are locally finite because it is a nonzero entire function.
By the intermediate value theorem, every one of the disjoint open intervals
contains a zero. Therefore
This interval has length . As is arbitrary, (11) implies
Even if the density definition is restricted to integer starting points and lengths, the containing interval gives the ratio and the same conclusion.
5. Exact upper density of coefficient sign changes
Every index in is an index of a nonzero coefficient. Since the support of is contained in ,
An interval of integer length contains at most even integers. Hence
Conversely, within the th block the consecutive nonzero coefficients
have alternating signs, with the intervening odd coefficients zero. The source's definition of therefore gives
The interval has length and contains at least coefficient sign changes. Letting yields
An additional sign change between two blocks can only occur at an even endpoint and does not affect either bound. Equations (13) and (14) prove .
Combining this with (12) gives
This is a counterexample to the upper-density assertion in Gröchenig's Problem 4.12. It uses one fixed Gaussian generator and one infinite coefficient sequence, with all sufficiently long density scales supplied by the recursive construction. It is not a finite-dimensional or fixed-size numerical instance.