相关论文: Uniqueness for the signature of a path of bounded …

Any finite dimensional semisimple algebra A over a field K is isomorphic to a direct sum of finite dimensional full matrix rings over suitable division rings. In this paper we will consider the special case where all division rings are…

Hybridization networks are representations of evolutionary histories that allow for the inclusion of reticulate events like recombinations, hybridizations, or lateral gene transfers. The recent growth in the number of hybridization network…

We propose a novel technique, termed compact shape trees, for computing correspondences of single-boundary 2-D shapes in O(n2) time. Together with zero or more features defined at each of n sample points on the shape's boundary, the compact…

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…

Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

This is the third part of a cycle of papers devoted to the construction of a finitely presented infinite nil-semigroup satisfying the identity $x^9 = 0$. This construction answers the problem of L. N. Shevrin and M. V. Sapir, posed, for…

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…

A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the…

A Leavitt labelled path algebra over a commutative unital ring is associated with a labelled space, generalizing Leavitt path algebras associated with graphs and ultragraphs as well as torsion-free commutative algebras generated by…

The independence equivalence class of a graph $G$ is the set of graphs that have the same independence polynomial as $G$. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton,…

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 reasoning frameworks for path expressions where node…

The Bar\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into…

A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We…

Discrete signatures are invariants computed from time series corresponding to the discretised version of the signature of paths. We study the algebraic varieties arising from their images, the discrete signature varieties. We introduce them…

Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…

The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…

We present a new class of graded irreducible representations of a Leavitt path algebra. This class is new in the sense that its representation space is not isomorphic to any of the existing simple Chen modules. The corresponding graded…

We classify all continuous tensor product systems of Hilbert spaces which are ``infinitely divisible" in the sense that they have an associated logarithmic structure. These results are applied to the theory of E_0 semigroups to deduce that…