Related papers: Odometers in non-compact spaces
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
The space of parametric b-measures endowed with appropriate topologies is introduced to define a new class of generalized ODEs given by parametric b-measures. This framework offers a new approach for dealing with precompact families of…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We give a necessary and sufficient condition for a map defined on a simply-connected quasiconvex metric space to factor through a tree. In case the target is the Euclidean plane and the map is H\"older continuous with exponent bigger than…
Let X be a non-empty set and U a ring of subsets of X. The countable additive functions U->{0,1} are called measures. The paper gives some definitions (derivable measures, the Lebesgue-Stieltjes measures) and properties of these functions,…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
Visual odometry techniques typically rely on feature extraction from a sequence of images and subsequent computation of optical flow. This point-to-point correspondence between two consecutive frames can be costly to compute and suffers…
We introduce the concept of ODD ('$\mathbf{O}$rthogonally $\mathbf{D}$egenerating on a $\mathbf{D}$ivisor') Riemannian metrics on real analytic manifolds $M$. These semipositive symmetric $2$-tensors may degenerate on a finite collection of…
With the algebraic trees, L\"ohr and Winter (2021) introduced a generalization of the notion of graph-theoretic trees to account for potentially uncountable structures. The tree structure is given by the map which assigns to each triple of…
We study affine maps between CAT(0) spaces with geometric actions, and show that they essentially split as products of dilations and linear maps (on the Euclidean factor). This extends known results from the Riemannian case. Furthermore, we…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
We observe that, up to conjugation, a majority of symmetric higher order ODEs (ordinary differential equations) and ODE systems have only fiber-preserving point symmetries. By exploiting Lie's classification of Lie algebras of vector…
Operads are algebraic devices offering a formalization of the concept of operations with several inputs and one output. Such operations can be naturally composed to form bigger and more complex ones. Coming historically from algebraic…