Related papers: Rotated Odometers and Actions on Rooted Trees
Transport systems on networks are crucial in various applications, but face a significant risk of being adversely affected by unforeseen circumstances such as disasters. The application of entropy-regularized optimal transport (OT) on graph…
We study bounded weighted shifts on directed trees. We show that the set of multiplication operators associated with an injective weighted shift on a rooted directed tree coincides with the WOT/SOT closure of the set of polynomials of the…
The paper is focused on the study of continuous orbit equivalence for generalized odometers (profinite actions). We show that two generalized odometers are continuously orbit equivalent if and only if the acting groups have finite index…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…
We consider a transformation of a normalized measure space such that the image of any point is a finite set. We call such transformation $m$-transformation. In this case the orbit of any point looks like a tree. In the study of…
Let $\Om$ be a Borel subset of $S^\Bbb N$ where $S$ is countable. A measure is called exchangeable on $\Om$, if it is supported on $\Om$ and is invariant under every Borel automorphism of $\Om$ which permutes at most finitely many…
We consider the problem of embedding odometers in one-dimensional cellular automata. We show that (1) every odometer can be be embedded in a gliders with reflecting walls cellular automaton, which one depending on the odometer, and (2) an…
This paper presents EROAM, a novel event-based rotational odometry and mapping system that achieves real-time, accurate camera rotation estimation. Unlike existing approaches that rely on event generation models or contrast maximization,…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
This paper presents ETA-IK, a novel Execution-Time-Aware Inverse Kinematics method tailored for dual-arm robotic systems. The primary goal is to optimize motion execution time by leveraging the redundancy of both arms, specifically in tasks…
Controlling the interaction between localized optical and mechanical excitations has recently become possible following advances in micro- and nano-fabrication techniques. To date, most experimental studies of optomechanics have focused on…
This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of…
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an infinite open cluster; in the opposite case, it…
We study optimal transport (OT) problem for probability measures supported on a tree metric space. It is known that such OT problem (i.e., tree-Wasserstein (TW)) admits a closed-form expression, but depends fundamentally on the underlying…
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…
We study invariant metrics on Ledger-Obata spaces $F^m/\mathrm{diag}(F)$. We give the classification and an explicit construction of all naturally reductive metrics, and also show that in the case $m=3$, any invariant metric is naturally…