Related papers: Integration of branched rough paths
The technical problem of deriving the full Green functions of the elementary pion fields of the nonlinear sigma model in terms of ancestor amplitudes involving only the flat connection and the nonlinear sigma model constraint is a very…
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…
In this paper, we get the sharp bound for $|G/O_p(G)|_p$ under the assumption that either $p^2 \nmid \chi(1)$ for all $\chi \in {\rm Irr}(G)$ or $p^2 \nmid \phi(1)$ for all $\phi \in {\rm IBr}_p(G)$. This would settle two conjectures raised…
Using limit linear series and a result controlling degeneration from separable maps to inseparable maps, we give a formula for the number of self-maps of the projective line with ramification to order e_i at general points P_i, in the case…
Lyons' Rough Path theory is currently formulated in p-variation topology. We extend his main-result, the Universal Limit Theorem, to a stronger Hoelder topology. Several approximations to Brownian Rough Paths are studied. As application of…
We study the integral representation of $\Gamma$-limits of $p$-coercive integral functionals of the calculus of variations in the spirit of \cite{dalmaso-modica86}. We use infima of local Dirichlet problems to characterize the limit…
For two-dimensional last-passage time models of weakly increasing paths, interesting scaling limits have been proved for points close the axis (the hard edge). For strictly increasing paths of Bernoulli($p$) marked sites, the relevant…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
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…
This work develops moment bounds for the controlled rough path norm of the solution of semilinear rough partial differential equations.~The novel aspects are two-fold: first we consider rough paths of low time regularity…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
We give here a covariant definition of the path integral formalism for the Lagrangian, which leaves a freedom to choose anyone of many possible quantum systems that correspond to the same classical limit without adding new potential terms…
Recently it was proved that the group of rough paths modulo tree-like equivalence is isomorphic to the corresponding signature group through the signature map S (a generalized notion of taking iterated path integrals). However, the proof of…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present…
Given $p\in[1,\infty)$ and a bounded open set $\Omega\subset\mathbb R^d$ with Lipschitz boundary, we study the $\Gamma$-convergence of the weighted fractional seminorm \[ [u]_{s,p,f}^p = \int_{\mathbb R^d} \int_{\mathbb R^d}…
Given an undirected graph $G=(V,E)$, the longest induced path problem (LIPP) consists of obtaining a maximum cardinality subset $W\subseteq V$ such that $W$ induces a simple path in $G$. In this paper, we propose two new formulations with…