相关论文: Ramification of rough paths

Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough…

We extend the new approach introduced in arXiv:1912.02064v2 [math.PR] and arXiv:2102.10119v1 [math.PR] for dealing with stochastic Volterra equations using the ideas of Rough Path theory and prove global existence and uniqueness results.…

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…

We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…

Rooted tree maps assign to an element of the Connes-Kreimer Hopf algebra of rooted trees a linear map on the noncommutative polynomial algebra in two letters. Evaluated at any admissible word these maps induce linear relations between…

We define motivic iterated integrals on the affine line, and give a simple proof of the formula for the coproduct in the Hopf algebra of they make. We show that it encodes the group law in the automorphism group of certain non-commutative…

We introduce notions of unramified and totally ramified maps in great generality - for commutative rings, schemes, ring spectra, or derived schemes. We prove that the definition is equivalent to the classical definition in the case of rings…

We prove an extension to the classical continuity theorem in rough paths. We show that two $p$-rough paths are close in all levels of iterated integrals provided the first $\lfl p \rfl$ terms are close in a uniform sense. Applications…

The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We…

Higher order automorphic forms have recently been introduced to study important questions in number theory and mathematical physics. We investigate the connection between these functions and Chen's iterated integrals. Then using Chen's…

Let $G$ be a directed graph on finitely many vertices and edges, and assign a positive weight to each edge on $G$. Fix vertices $u$ and $v$ and consider the set of paths that start at $u$ and end at $v$, self-intersecting in any number of…

The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural…

In previous papers, the author showed that in many cases of interest there exists an isomorphism between certain path algebras related to the structure of the subregular J-rings of Coxeter systems and matrix rings over a free product of…

We exhibit an explicit natural isomorphism between spaces of branched and geometric rough paths. This provides a multi-level generalisation of the isomorphism of Lejay-Victoir (2006) as well as a canonical version of the It\^o-Stratonovich…

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

We introduce the ramified partition algebra, which is a physically motivated and natural generalization of the partition algebra. We investigate its representation theory and demonstrate quasi--heredity under certain conditions. Under these…

In this paper, we prove that the self-dual morphological hierarchical structure computed on a n-D gray-level wellcomposed image u by the algorithm of G{\'e}raud et al. [1] is exactly the mathematical structure defined to be the tree of…

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…

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…

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…