Related papers: Odometers in non-compact spaces
Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
We describe how self-adjoint ordered operator spaces, also called non-unital operator systems in the literature, can be understood as $*$-vector spaces equipped with a matrix gauge structure. We explain how this perspective has several…
Floyd gave an example of a minimal dynamical system which was an extension of an odometer and the fibres of the associated factor map were either singletons or intervals. Gjerde and Johansen showed that the odometer could be replaced by any…
We describe the inverse image of the Riemannian exponential map at a basepoint of a compact symmetric space as the disjoint union of so called focal orbits through a maximal torus. These are orbits of a subgroup of the isotropy group acting…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…
The notion of a two-dimensional word arises naturally in the study of combinatorics on words, while the iterative construction of pedal triangles results in a rich dynamical system in the study of geometry. At first, these two classes of…
We describe the infinite interval exchange transformations, called the rotated odometers, that are obtained as compositions of finite interval exchange transformations and the von Neumann-Kakutani map. We show that with respect to Lebesgue…
Given a natural number $n \geq 1$, the odometer semigroup $O_n$, also known as the adding machine or the Baumslag-Solitar monoid with two generators, is a well-known object in group theory. This paper examines the odometer semigroup in…
We study extensions of the measure of maximal entropy to suitable compactifications of the parameter space and the moduli space of rational maps acting on the Riemann sphere. For parameter space, we consider a space which resolves the…
Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…
We propose a new topological invariant of unlabeled trees of N nodes. The invariant is a set of Nx2 matrices of integers, with sum_j k^{d_{i,j}} and v_i as the matrix elements, where d_{i,j} are the elements of the distance matrix and v_i…
We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…