Related papers: Rotated Odometers and Actions on Rooted Trees

Generalized interval exchange transformations (GIETs) are semi-conjugate to interval exchange transformations (IETs) when the Rauzy-Veech combinatorics is $\infty$-complete. When this semi-conjugacy is a homeomorphism, a fundamental problem…

An annular continuum is a compact connected set $K$ which separates a closed annulus $A$ into exactly two connected components, one containing each boundary component. The topology of such continua can be very intricate (for instance,…

We present an approach for radar-inertial odometry which uses a continuous-time framework to fuse measurements from multiple automotive radars and an inertial measurement unit (IMU). Adverse weather conditions do not have a significant…

We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…

This paper presents a method that leverages vehicle motion constraints to refine data associations in a point-based radar odometry system. By using the strong prior on how a non-holonomic robot is constrained to move smoothly through its…

Computing the rotation distance between two binary trees with $n$ internal nodes efficiently (in $poly(n)$ time) is a long standing open question in the study of height balancing in tree data structures. In this paper, we initiate the study…

This work introduces a novel interpretable machine learning method called Mixture of Decision Trees (MoDT). It constitutes a special case of the Mixture of Experts ensemble architecture, which utilizes a linear model as gating function and…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

We investigate a class of mixing dynamical systems around the concept of iceberg transformation. In brief, an iceberg transformation is defined using symbolic language as follows. We build a sequence of words such that the next word is a…

The topology of a robotic swarm affects the convergence speed of consensus and the mobility of the robots. In this paper, we prove the existence of a complete set of local topology manipulation operations that allow the transformation of a…

In this paper, we investigate a class of non-invertible piecewise isometries on the upper half-plane known as Translated Cone Exchanges. These maps include a simple interval exchange on a boundary we call the baseline. We provide a…

Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and efficient tool for finding collision-free paths in robotic systems. However, adding dynamic constraints makes the motion planning problem significantly…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

In high-dimensional robotic path planning, traditional sampling-based methods often struggle to efficiently identify both feasible and optimal paths in complex, multi-obstacle environments. This challenge is intensified in robotic…

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…

We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…

We consider the Aluthge transform $|T|^{1/2}U|T|^{1/2}$ of a Hilbert space operator $T$, where $T=U|T|$ is the polar decomposition of $T$. We prove that the map that sends $T$ to its Aluthge transform is continuous with respect to the norm…

Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged intervals. We prove that if $T$ is minimal and the rank of $T$ is greater…

A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\meg 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. A vector homogeneous tree $\mathbf{T}$…

We build a Shannon orbit equivalence between the universal odometer and a variety of rank-one systems. This is done in a unified manner, using what we call flexible classes of rank-one transformations. Our main result is that every flexible…