相关论文: Constructing non-uniquely ergodic arational trees
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. Dense Gaussian networks are potential alternatives for…
We introduce an extension of the P\'olya tree approach for constructing distributions on the space of probability measures. By using optional stopping and optional choice of splitting variables, the construction gives rise to random…
We introduce two abstract constructions for building new measurable dynamical systems from existing ones and study their ergodic properties. The first of these constructions, a "reciprocal transformation," produces a type of non-singular…
We construct and study noncommutative deformations of toric varieties by combining techniques from toric geometry, isospectral deformations, and noncommutative geometry in braided monoidal categories. Our approach utilizes the same fan…
Origami structures have been proposed as a means of creating three-dimensional structures from the micro- to the macroscale, and as a means of fabricating mechanical metamaterials. The design of such structures requires a deep understanding…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…
We construct an example of a uniquely ergodic measured foliation on a surface such that the associated translation flow on the orientation double cover is minimal but not uniquely ergodic. We then prove a geometric criterion for the…
Algebraic methods are used to construct families of unramified abelian extensions of some families of number fields with specified Galois groups.
One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. A nonparametric, rank-based method to estimate this structure is presented. The idea is to represent…
The aim of this note is to characterize trees, endowed with coarse wedge topology, that have a retractional skeleton. We use this characterization to provide new examples of non-commutative Valdivia compact spaces that are not Valdivia.
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…
The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…
Reachability analysis is a powerful tool when it comes to capturing the behaviour, thus verifying the safety, of autonomous systems. However, general-purpose methods, such as Hamilton-Jacobi approaches, suffer from the curse of…
We describe a method for constructing Teichm\"uller geodesics where the vertical measured foliation $\nu$ is minimal but is not uniquely ergodic and where we have a good understanding of the behavior of the Teichm\"uller geodesic. The…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
We construct examples of minimal and uniquely ergodic systems realizing all possible behaviors in the interplay of measurable and topological nilfactors. To build such examples, we adapt an idea that stems from Furstenberg's construction of…
Using ideas from geometric stability theory we construct differentially closed fields with no non-trivial automorphisms.