Related papers: Functional tilings and the Coven-Meyerowitz tiling…
While routinely used in other areas of dynamics, image sets are ill-defined objects in general non-invertible measurable dynamics. We propose a way of consistently working with image sets of null-preserving (and hence, in particular, of…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
We study the ring of rational functions admitting a continuous extension to the real affine space. We establish several properties of this ring. In particular, we prove a strong Nullstelensatz. We study the scheme theoretic properties and…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
In Mathias forcing, conditions are pairs $(D,S)$ of sets of natural numbers, in which $D$ is finite, $S$ is infinite, and $\max D < \min S$. The Turing degrees and computational characteristics of generics for this forcing in the special…
We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
We find sufficient conditions on a set $\mathscr{M}\subset\mathbf{R}^n\times\mathscr{L}(\mathbf{R}^n,\mathbf{R}^m)$ ensuring that the set of functions such that $(F(x),DF(x))\in\mathscr{M}$ is rectifiable. We also prove a more general…
Given a programming language, can we give a monadic denotational semantics that is stable under language extension? Models containing only a single monad are not stable. Models based on type-and-effect systems, in which there is a monad for…
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…
Consider a finite collection $\{T_1, \ldots, T_J\}$ of differential operators with constant coefficients on $\mathbb{T}^n$ ($n\geq 2$) and the space of smooth functions generated by this collection, namely, the space of functions $f$ such…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
We study a family of substitution tilings with similar right triangles of two sizes which is obtained using the substitution rule introduced in [Danzer, L. and van Ophuysen, G. A species of planar triangular tilings with inflation factor…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
Returning to a classical question in Harmonic Analysis we strengthen an old result of Walter Rudin. We show that there exists a weakly almost periodic function on the group of integers Z which is not in the norm-closure of the algebra B(Z)…
Using properties of the Riemann zeta-function we propose two new large classes of evaluated series. Incidentally the first class represents integrals as generalized average on very nonuniform sequences. The second class contains inter alia…
Let K be a field of characteristic 0 and A be a rigid tensor K-linear category. Let M be a finite-dimensional object of A in the sense of Kimura-O'Sullivan. We prove that the "motivic" zeta function of M with coefficients in K\_0(A) has a…
In this paper we establish a new connection between central sets and the strong coincidence conjecture for fixed points of irreducible primitive substitutions of Pisot type. Central sets, first introduced by Furstenberg using notions from…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
Additive functions on translation quivers have played an important role in the representation theory of finite dimensional algebras, the most prominent ones are the hammock functions introduced by S. Brenner. When dealing with cluster…