Related papers: Tree-like is not a transitive relation on paths
We derive an effective field theory (EFT) for cosmological Lyman alpha forest fluctuations valid for the power spectrum at the one-loop order. The ``bottom-up'' EFT expansion at the level of the transmitted flux is identical to the…
In many complex networks the vertices are ordered in time, and edges represent causal connections. We propose methods of analysing such directed acyclic graphs taking into account the constraints of causality and highlighting the causal…
In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
A well-known bijection between Motzkin paths and ordered trees with outdegree always $\le2$, is lifted to Grand Motzkin paths (the nonnegativity is dropped) and an ordered list of an odd number of such $\{0,1,2\}$ trees. This offers an…
Tree transductions are binary relations of finite trees. For tree transductions defined by non-deterministic top-down tree transducers, inclusion, equivalence and synthesis problems are known to be undecidable. Adding origin semantics to…
Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…
Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be…
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.
Let $X$ be a compact metric space and $\mathcal M_X$ be the set of isometry classes of compact metric spaces $Y$ such that the Lipschitz distance $d_L(X,Y)$ is finite. We show that $(\mathcal M_X, d_L)$ is not separable when $X$ is a closed…
Recently Simenhaus proved that for any elliptic random walk in random environment, transience in the neighborhood of a given direction is equivalent to the a.s. existence of a deterministic asymptotic direction and to transience in any…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
In Gromov's treatise Partial Differential Relations (volume 9 of Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 1986), a continuous map between Riemannian manifolds is called isometric if it preserves the length of rectifiable…
This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisition. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are…
Traversals are commonly seen in tree data structures, and performance-enhancing transformations between tree traversals are critical for many applications. Existing approaches to reasoning about tree traversals and their transformations are…
We present a series of examples of pairs of singular semialgebraic surfaces (real semialgebraic sets of dimension two) in ${\mathbb R}^3$ and ${\mathbb R}^4$ which are bi-Lipschitz equivalent with respect to the outer metric, ambient…
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
Breaking Lorentz reciprocity was believed to be a prerequisite for nonreciprocal transmissions of light fields, so the possibility of nonreciprocity by linear optical systems was mostly ignored. We put forward a structure of three mutually…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…