Searcharxiv⌕ Search

arXiv subjects

E. A. Alvarez Gutierrez

Publications and source records attributed to E. A. Alvarez Gutierrez.

3 recordsLinked to original sources

Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of $(-1)^{ω(n)}$

We apply the generalized monoid of words and logarithmic-prefix functionals of \cite{C1} to the regularization of the divergent product \[ P_ω=\prod_{n=1}^{\infty} n^{(-1)^{ω(n)}}, \] where \(ω(n)\) is the number of distinct prime divisors of \(n\). The associated Dirichlet series \(D_ω(s)=\sum_{n\ge1}(-1)^{ω(n)}n^{-s}\) has a natural boundary at \(\Re(s)=0\), as established by Meretov (1987) and recovered here as a special case of the Estermann--Dahlquist theory of Euler products, which makes zeta regularization impossible: the derivative \(D_ω'(0)\) does not exist. This product therefore lies completely beyond the reach of classical regularization methods. We construct the canonical net encoding the sign sequence, define the logarithmic-prefix functional with exponent \(α=2\), and extract a finite value through the weighted evaluation functional of the monoid framework. The evaluation functional is shown to converge absolutely, and this convergence is unconditional: it follows from the classical zero-free region of \(ζ(s)\) (de la Vallée Poussin), which yields the effective bound \(T_ω(x)=O(x\,e^{-c\sqrt{\log x}})\) for some \(c>0\). Numerical computation up to \(N=10^7\) gives the regularized value \[ P_{ω,\mathrm{ren}}\approx 0.7731, \] a new constant of arithmetic origin that cannot be obtained by any classical summation method. We also compute the second derivative of the Dirichlet series at \(s=1\), \[ D_ω''(1)=8\,C_2\ln 2, \] where \(C_2\) is the Hardy--Littlewood twin prime constant, which provides an unconditional analytical link to the arithmetic structure of the sequence \((-1)^{ω(n)}\). A self-contained proof of the natural boundary, based on the Estermann--Dahlquist theorem, is given in Appendix~A.

math.NT↗

Asymptotic monoids of words and logarithmic-prefix functionals for divergent arithmetic products

We define a generalized monoid of words, an asymptotic quotient of moderate nets of finite words, to regularize divergent products of arithmetic origin. Divergent sequences are encoded as moderate nets over a finite alphabet, while prefix-dependent observables are evaluated along admissible asymptotic scales. We characterize the evaluation and renormalization schemes axiomatically. Once the asymptotic scale and class of admissible regular expansions are fixed, the constant-term prescription is uniquely determined. Thus the regularized value is canonical relative to the chosen scale and evaluation functional, without absolute uniqueness. The regularizing functionals arise as expectations of logarithmic-prefix functionals under empirical distributions of sign oscillations. The alternating product of integers is regularized to $\sqrt{2/π}$, matching zeta regularization, while the alternating product of factorials yields $(2/π)^{1/4}$ and satisfies $\mathfrak{F}_{\mathrm{ren}}=\sqrt{P_{\mathrm{ren}}}$. Products governed by dyadic block signs acquire finite values through logarithmic-scale averaging in the corresponding dyadic quotient, invariant under dyadic equivalence. For the Thue--Morse sequence, zeta regularization is well defined via meromorphic continuation of its Dirichlet series. A separate convergent functional associated with its logarithmic partial sums yields $\exp(\mathcal F)\approx0.9732$. We also study numerically a substitution-generated sign sequence with exact square-root growth on dyadic blocks and fractal log-periodic structure. Its Dirichlet series shows a candidate log-periodic pole structure, separating local scale constants from a candidate global regularized value. The choice of asymptotic scale is determined by the arithmetic structure of the sequence: logarithmic scales for ordinary alternating products and dyadic scales for block-automatic sequences.

math.CO↗

A generalized monoid of infinite words: asymptotic prefix-suffix quotients and algebraic structure

A generalized monoid of words tilde{Sigma}* is constructed as the quotient of moderate nets of finite words by an asymptotic equivalence relation based on a bidirectional prefix-suffix metric. The main algebraic result is that this quotient is a monoid containing Sigma* faithfully, with a reversal involution, a natural divisibility preorder, failure of cancellation, and nontrivial idempotents. The construction is designed so that any functional depending only on a logarithmic prefix descends to the quotient, yielding a well-defined action of logarithmic-prefix functionals. Finite scalar values arise only after applying an additional renormalization functional, which depends on the chosen mould and window. With respect to the fixed truncation injection, the monoid strictly enlarges the classical set Sigma^{infty}: an explicit oscillating net is exhibited that has no limit in the Cantor space but defines a genuine element of tilde{Sigma}* not coming from a finite or right-infinite word under that injection.

math.GR↗