English
Related papers

Related papers: Distal expansions of Presburger arithmetic by a sp…

200 papers

We prove the linear orders first-order definable in the standard model $(\ZZ;<,+)$ of Presburger arithmetic are exactly those that are $(\ZZ;<,+)$-definably embeddable into the lexicographic ordering on $\ZZ^n$ for some $n$.

Logic · Mathematics 2026-04-21 Fedor Pakhomov , Alexander Zapryagaev

For a compact and connected Lie group $G$, we present an explicit construction of an $\mathbb{S}^1$-gerbe over the differentiable stack $[G/G]$ in the framework of $\mathbb{S}^1$-central extensions of Lie groupoids. This gives a complete…

Symplectic Geometry · Mathematics 2026-05-01 Dadi Ni , Kaichuan Qi

This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…

Logic in Computer Science · Computer Science 2025-05-21 Stanislav Semenov

In this note, we observe several properties of arithmetic divisors on the projective line over Z and give their Zariski decompositions.

Algebraic Geometry · Mathematics 2010-02-11 Atsushi Moriwaki

Let $K$ be a Henselian, non-trivially valued field with separated analytic structure. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$. Hence directly follow definable non-Archimedean…

Algebraic Geometry · Mathematics 2019-02-01 Krzysztof Jan Nowak

If $\mathcal{Z}$ is a dp-minimal expansion of a discrete ordered abelian group $(Z,<,+)$ and $\mathcal{Z}$ does not admit a nontrivial definable convex subgroup then $\mathcal{Z}$ is interdefinable with $(Z,<,+)$ and $(Z,<,+)$ is…

Logic · Mathematics 2020-04-29 Erik Walsberg

This paper is devoted to understand groups definable in Presburger arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded group…

Logic · Mathematics 2018-11-13 Alf Onshuus , Mariana Vicaría

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

Logic in Computer Science · Computer Science 2020-11-12 Nazanin Roshandel Tavana

Let R be a sufficiently saturated o-minimal expansion of a real closed field, let O be the convex hull of the rationals in R, and let st: O^n \to \mathbb{R}^n be the standard part map. For X \subseteq R^n define st(X):=st(X \cap O^n). We…

Logic · Mathematics 2007-06-04 Jana Maříková

We generalize a result of Lindenstrauss on the interplay between measurable and topological dynamics which shows that every separable ergodic measurably distal dynamical system has a minimal distal model. We show that such a model can, in…

Dynamical Systems · Mathematics 2022-08-04 Nikolai Edeko , Henrik Kreidler

We reconsider some estimates the paper "M. Griebel, P. Oswald, On additive Schwarz preconditioners for sparse grid discretizations. Numer. Math. 66 (1994), 449-463" concerning the hierarchical basis preconditioner for sparse grid…

Numerical Analysis · Mathematics 2018-03-06 Peter Oswald

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

Representation Theory · Mathematics 2020-06-26 Andrés Franco , Hernán Giraldo , Pedro Rizzo

There are various notions of dimension in fractal geometry to characterise (random and non-random) subsets of $\mathbb R^d$. In this expository text, we discuss their analogues for infinite subsets of $\mathbb Z^d$ and, more generally, for…

Probability · Mathematics 2019-12-12 Markus Heydenreich

A well studied family of random fractals called fractal percolation is discussed. We focus on the projections of fractal percolation on the plane. Our goal is to present stronger versions of the classical Marstrand theorem, valid for almost…

Dynamical Systems · Mathematics 2013-06-18 Michal Rams , Károly Simon

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

Logic · Mathematics 2021-06-24 Pantelis E. Eleftheriou , Alex Savatovsky

We call a singularity of a presymplectic form $\omega$ removable in its graph if its graph extends to a smooth Dirac structure over the singularity. An example for this is the symplectic form of a magnetic monopole. A criterion for the…

Symplectic Geometry · Mathematics 2018-10-09 Christian Blohmann

We show that a complete first-order theory $T$ is distal provided it has a model $M$ such that the theory of the Shelah expansion of $M$ is distal.

Logic · Mathematics 2019-11-26 Gareth Boxall , Charlotte Kestner

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…

Logic · Mathematics 2013-04-05 Alessandro Berarducci , Marcello Mamino

We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.

Number Theory · Mathematics 2025-10-08 Jakub Konieczny

Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…

Combinatorics · Mathematics 2023-02-28 Gabriel Currier , Jozsef Solymosi , Ethan Patrick White