Related papers: Intermediate \beta-shifts of finite type
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
We consider two cases of kinetically constrained models, namely East and FA-1f models. The object of interest of our work is the activity A(t) defined as the total number of configuration changes in the interval [0,t] for the dynamics on a…
Two replicas of spatially extended chaotic systems synchronize to a common spatio-temporal chaotic state when coupled above a critical strength. As a prototype of each single spatio-temporal chaotic system a lattice of maps interacting via…
We study the greedy (exploitation-only) algorithm in bandit problems with a known reward structure. We allow arbitrary finite reward structures, while prior work focused on a few specific ones. We fully characterize when the greedy…
Interval exchange transformations are typically uniquely ergodic maps and therefore have uniformly distributed orbits. Their degree of uniformity can be measured in terms of the star-discrepancy. Few examples of interval exchange…
The main objective of the work presented here is to understand the appearance of phase transitions in pure gauge and scalar lattice QED. Main results are as follows: Pure gauge compact QED with PBC shows a monopole percolation phenomena…
We analyze a simple asset transfer model in which the transfer amount is a fixed fraction $f$ of the giver's wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for…
We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those…
Random reshuffling, which randomly permutes the dataset each epoch, is widely adopted in model training because it yields faster convergence than with-replacement sampling. Recent studies indicate greedily chosen data orderings can further…
The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
Suppose $X$ is a finite discrete space with at least two elements, $\Gamma$ is a nonempty countable set, and consider self--map $\varphi:\Gamma\to\Gamma$. We prove that the generalized shift $\sigma_\varphi:X^\Gamma\to X^\Gamma$ with…
If a real-valued function is continuous on a real interval and it takes on two different values, then it will also take any value in between those two, by the Intermediate Value Theorem. It is not immediately clear what would be a natural…
This work highlights a peculiar phenomenon of interval exchange. Considering a real number beta less than -1, the negative beta-shift is coded if and only if its absolute value is greater than the golden ratio. We study an increasing…
This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…
Mechanisms for encoding positional information are central for transformer-based language models. In this paper, we analyze the position embeddings of existing language models, finding strong evidence of translation invariance, both for the…
The Greedy binary search tree (BST) algorithm, like the Splay tree, is a prominent candidate for the \emph{dynamic optimality conjecture}. While Greedy satisfies many desirable properties of BST, its cost and analysis to execute a search…
This work develops a nonlinear analogue of alternating projections on Hilbert space, based on iterating a weighted residual transformation that removes the portion of an operator detected by a projection after conjugation by its square…
I provide a novel approach to characterizing the set of interim realizable allocations, in the spirit of Matthews (1984) and Border (1991). The approach allows me to identify precisely why exact characterizations are difficult to obtain in…
Let $B$, $I$ be the unweighted backward shift and the identity operator respectively on $l^{\infty}(\mathbb{N})$, the space of bounded sequences over the complex numbers endowed with the supremum norm. We prove that $I+\lambda B$ is locally…