Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 133 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 80 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 432 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
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.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.