Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.06297

A Generalized Monoid of Words with Applications to Divergent Arithmetic Products

A. Alvarez Cruz·E. A. Alvarez Gutierrez
View original source ↗Read source document ↗Export metadata ↓

Abstract

A generalized monoid of words is constructed as an extension of the free monoid Sigma-star with elements of controlled infinite length. The construction uses a bidirectional prefix-suffix metric and an asymptotic equivalence relation on moderate nets of finite words. The resulting quotient is a monoid carrying a natural partial order, a length homomorphism, and a well-defined reversal involution. Moulds, in the sense of Ecalle's resurgent analysis, are defined on this monoid. The logarithmic window provided by the asymptotic equivalence guarantees that moulds depending only on logarithmic prefixes descend to well-defined functionals on the quotient. The framework is applied to the regularization of divergent arithmetic products whose oscillations follow a regular pattern. The alternating products of integers, primes, and factorials acquire canonical finite values that coincide with zeta regularization. A symmetrized functional cancels leading oscillations, and a logarithmic Cesaro renormalization extracts the constant term. The method is then extended to products beyond the reach of classical regularization, such as products whose sign sequences are constant on dyadic blocks. A conjecture is proposed for the Thue-Morse product. The selection of evaluation functionals and renormalization schemes is systematized according to the divergence type of the arithmetic sequence.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Alvarez Cruz, E. A. Alvarez Gutierrez. 2026-08-29. A Generalized Monoid of Words with Applications to Divergent Arithmetic Products. https://arxiv.org/abs/2608.06297

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗