Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Cobham theorem for scalar multiplication (2407.15118v1)

Published 21 Jul 2024 in math.LO and cs.LO

Abstract: Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \beta x)$ is already definable in $(\mathbb{R},{<},+,\mathbb{Z})$. As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to $\beta$-numeration systems, where $\beta$ is a quadratic irrational.

Summary

We haven't generated a summary for this paper yet.