Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09975

On Integer-Division Bases for the Kalmár Elementary Functions

Joseph M. Shunia
View original source ↗Read source document ↗Export metadata ↓

Abstract

Prunescu, Sauras-Altuzarra, and Shunia asked whether addition, totalized integer division, and base-two exponentiation form a substitution basis for the Kalmár elementary functions. We answer this problem negatively, even after adjoining multiplication. On independent powers of two, every fixed term built from addition, multiplication, and integer division takes only polylogarithmically many distinct values below a given bound, and the same restriction survives arbitrary nesting of $2^x$. No such term recovers $n$ from $2^n$, so neither $\lfloor\log_2 x\rfloor$ nor integer remainder is representable. The obstruction is not special to the base two. For every fixed integer $b\geq 2$, the same sparsity bound holds with constants independent of $b$, and $\langle x+y,\lfloor x/y\rfloor,b^x\rangle$ remains a proper subclass of the elementary functions. Variable exponentiation reverses the conclusion: addition, integer division, and $x^y$ do form a substitution basis, $$ \langle x+y,\ \lfloor x/y\rfloor,\ x^y\rangle=\mathcal{E} .$$ Once the base may depend on the input, integer remainder and truncated subtraction become representable. The incomplete base-two class is nevertheless complete for truth values. Every elementary characteristic function belongs to it, as does every elementary function with a fixed finite range.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph M. Shunia. 2026-10-07. On Integer-Division Bases for the Kalmár Elementary Functions. https://arxiv.org/abs/2610.09975

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

KEEP EXPLORING

Related papers

arXiv2026

Complexity of deep computations via topology of function spaces

We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification of Rosenthal compacta, to identify new complexity classes. We use the language of model theory, specifically, the concept of \emph{independence} from Shelah's classification theory, to translate between topology and computation. We use the theory of Rosenthal compacta to characterize approximablility of deep computations, both deterministically and probabilistically.

math.LO↗
arXiv2026

Points and their multiples on curves in powers of simple abelian varieties

Let $G$ be a simple abelian variety of dimension $g \in \mathbb{N}$ defined over $\mathbb{Q}^\mathrm{alg}$ and let $C_1, C_2 \subseteq G^N(\mathbb{C})$ be irreducible closed algebraic curves with $N \geq 3$. Further assume that at least one of $C_1$ and $C_2$ is not defined over $\mathbb{Q}^\mathrm{alg}$. Suppose that there does not exist an algebraic subgroup $H_1 \subseteq G^N(\mathbb{C})$ of dimension $g$ such that $C_1 \subseteq H_1$ and that there does not exist an algebraic subgroup $H_2 \subseteq G^N(\mathbb{C})$ of dimension $2g$ such that $C_1 \cup C_2 \subseteq H_2$. Denoting $\mathcal{N} = \{n \in \mathbb{N} \ | \ [n]C_1 \subseteq C_2\}$, we prove that $\bigcup_{n \in \mathbb{N} \setminus \mathcal{N}}\{x \in C_1 \ | \ nx \in C_2\}$ is finite.

math.LO↗
arXiv2026

Condensed Whitehead Problem

The Whitehead problem, which asks whether every abelian group $A$ satisfying $\mathrm{Ext}^1(A,\mathbb{Z}) = 0$ is free, is independent of ZFC. However, this problem has an analogue in condensed mathematics that can be answered affirmatively. In this note, we give a new proof that an abelian group $ A $ of size $κ$ is free if and only if $\underline{\mathrm{Ext}}^1(\underline{A}, \underline{\mathbb{Z}})(S_κ) = 0$, where $ S_κ$ is the Stone space of the Boolean completion of $\operatorname{Add}(ω,κ)$.

math.LO↗