Related papers: Shift Radix Systems - A Survey

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

The set \[ \overline{\mathbb{E}}= \{ x \in {\mathbb{C}}^3: \quad 1-x_1 z - x_2 w + x_3 zw \neq 0 \mbox{ whenever } |z| < 1, |w| < 1 \} \] is called the tetrablock and has intriguing complex-geometric properties. It is polynomially convex,…

Motivated by recent results on radial projections and applications to the celebrated Falconer distance problem, we study radial projections in the setting of finite fields. More precisely, we extend results due to Mattila and Orponen…

The Laguerre functions constitute one of the fundamental basis sets for calculations in atomic and molecular electron-structure theory, with applications in hadronic and nuclear theory as well. While similar in form to the Coulomb…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…

We define a tau function for a generic Riemann-Hilbert problem posed on a union of non-intersecting smooth closed curves with jump matrices analytic in their neighborhood. The tau function depends on parameters of the jumps and is expressed…

Let $\Sigma_{A}$ be a topologically mixing shift of finite type, let $\sigma:\Sigma_{A}\to\Sigma_{A}$ be the usual left-shift, and let $\mu$ be the Gibbs measure for a H\"{o}lder continuous potential that is not cohomologous to a constant.…

We consider solvable matrix models. We generalize Harish-Chandra-Itzykson-Zuber and certain other integrals (Gross-Witten integral and integrals over complex matrices) using the notion of tau function of matrix argument. In this case one…

In this paper, we study Random Dynamical Systems (RDSs) of homeomorphisms on the circle without a finite orbit. We characterize the topological dynamics of the associated semigroup by identifying the existence of invariant sets which are…

There is a basic paradigm, called here the radius of well-posedness, which quantifies the "distance" from a given well-posed problem to the set of ill-posed problems of the same kind. In variational analysis, well-posedness is often…

Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $\mathbb{Z}$ and $\mathbb{Z}^2$ based on the binary alphabet $\{0,1\}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane…

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

We introduce analysis of orbital parities as a concept and a tool for understanding radicals. Based on fundamental reduced one- and two-electron density matrices, our approach allows us to evaluate a total measure of radical character and…

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

We revisit the problem of well-defining rotation numbers for discrete random dynamical systems on the circle. We show that, contrasting with deterministic systems, the topological (i.e. based on Poincar\'{e} lifts) approach does depend on…

Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the…

Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…

Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…

Let $t=t_1t_2\cdots$ be an element of the full shift with shift map $\tau$ on a finite set of characters $\mathcal{A}$ and let $ \Sigma=\text{ closure} \{\tau^i(t):\;i\in\N\cup\{0\}\}$. Let $f_t=f_{t_1,\,\infty}=\cdots\circ f_{t_2}\circ…