Related papers: Integration of branched rough paths
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition…
A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…
We show how the robustness of gamma hedging can be understood without using rough-path theory. Instead, we use the concepts of $p^{th}$ variation along a partition sequence and Taylor's theorem directly, rather than defining an integral and…
In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context…
Path integrals are a ubiquitous tool in theoretical physics. However, their use is sometimes hindered by the lack of control on various manipulations -- such as performing a change of the integration path -- one would like to carry out in…
Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$, every graph of sufficiently large rank-depth contains a pivot-minor isomorphic to a path on $t$…
We present a few techniques for proving $L^p$ estimates for martingales. Basic applications to It\^o integration and rough paths are included.
We explore several problems related to ruled polygons. Given a ruling of a polygon $P$, we consider the Reeb graph of $P$ induced by the ruling. We define the Reeb complexity of $P$, which roughly equates to the minimum number of points…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
We provide a sharp lower bound on the $p$-norm of a sum of independent uniform random variables in terms of its variance when $0 < p < 1$. We address an analogous question for $p$-R\'enyi entropy for $p$ in the same range.
We establish a Sewing lemma in the regime $\gamma \in \left( 0, 1 \right]$, constructing a Sewing map which is neither unique nor canonical, but which is nonetheless continuous with respect to the standard norms. Two immediate corollaries…
We discuss $p$-variation regularity of real-valued functions defined on $[0,T]^2$, based on rectangular increments. When $p>1$, there are two slightly different notions of $p$-variation; both of which are useful in the context of Gaussian…
This paper establishes a constructive link between the first slope of Artin-Schreier curves X_f: y^p-y=f(x) and the p-adic weight of the support of f(x). If the maximal p-adic weight element v in Supp(f) is unique, we show that the first…
We introduce a new variant of Hochschild's two-sided bar construction for the setting of curved differential graded algebras. One can geometrically think of the classical bar complex as elements from the algebra positioned along different…
For positive $p$-harmonic functions on Riemannian manifolds, we derive a gradient estimate and Harnack inequality with constants depending only on the lower bound of the Ricci curvature, the dimension $n$, $p$ and the radius of the ball on…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
Assume that $p\in[1,\infty]$ and $u=P_{h}[\phi]$, where $\phi\in L^{p}(\mathbb{S}^{n-1},\mathbb{R}^n)$ and $u(0) = 0$. Then we obtain the sharp inequality $|u(x)|\le G_p(|x|)\|\phi\|_{L^{p}}$ for some smooth function $G_p$ vanishing at $0$.…
A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the…
Based on an isomorphism between Grossman Larson Hopf algebra and Tensor Hopf algebra, we apply a sub-Riemannian geometry technique to branched rough differential equations and obtain the explicit Lipschitz continuity of the solution with…