Related papers: A Note on the Notion of Geometric Rough Paths

We study character varieties arising as moduli of representations of an orientable surface group into a reductive group $G$. We first show that if $G/Z$ acts freely on the representation variety, then both the representation variety and the…

Fourier normal ordering \cite{Unt09bis} is a new algorithm to construct explicit rough paths over arbitrary H\"older-continuous multidimensional paths. We apply in this article the Fourier normal ordering ordering algorithm to the…

Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…

Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic dynamical systems provide many examples of subriemannian geometries defined by non-smooth (namely, H\"older continuous) distributions.…

Let (E,D,P) be a flat vector bundle with a parabolic structure over a punctured Riemann surface, (M,g). We consider a deformation of the harmonic metric equation which we call the Poisson metric equation. This equation arises naturally as…

We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by…

We construct a pathwise integration theory, associated with a change of variable formula, for smooth functionals of continuous paths with arbitrary regularity defined in terms of the notion of $p$-th variation along a sequence of time…

Finding a shortest path in a graph is one of the most classic problems in algorithmic and graph theory. While we dispose of quite efficient algorithms for this ordinary problem (like the Dijkstra or Bellman-Ford algorithms), some slight…

Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…

We prove explicit upper and lower bounds for the torsional rigidity of extrinsic domains of submanifolds P^m with controlled radial mean curvature in ambient Riemannian manifolds N^n with a pole p and with sectional curvatures bounded from…

Let P(x) be a one-variable Laurent polynomial of degree (d_1,d_2) over a finite field of characteristic p. For any fixed positive integer s not divisible by p, we prove that the (normalized) p-adic Newton polygon of the L-functions of…

We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erd{\H{o}}s-Szekeres concerning the longest monotone subsequence of a given sequence of numbers. A path P in a graph G is said to be a degree…

In this article we consider rough differential equations (RDEs) driven by non-geometric rough paths, using the concept of branched rough paths introduced in Gubinelli (2004). We first show that branched rough paths can equivalently be…

In this talk, I report on three theorems concerning algebraic varieties over a field of characteristic $p>0$. a) over a finite field of cardinal $q$, two proper smooth varieties which are geometrically birational have the same number of…

We establish an It\^o-type formula for finite $p$-variation paths with jumps for arbitrary $p\geq 1$. The formula is stated in a fully pathwise form and separates the reduced rough integral from explicit left- and right-jump correction…

We prove that the Riemannian geometry of almost K\"ahler manifolds can be expressed in terms of the Poisson algebra of smooth functions on the manifold. Subsequently, K\"ahler-Poisson algebras are introduced, and it is shown that a…

We provide a decomposition of the trace of the Brownian motion into a simple path and an independent Brownian soup of loops that intersect the simple path. More precisely, we prove that any subsequential scaling limit of the loop erased…

We characterize geodesic paths in the $n$-dimensional unit sphere under sup norm. A geodesic path between two points is a shortest curve joining the two points.

We study Weil-Petersson (WP) geodesics with narrow end invariant and develop techniques to control length-functions and twist parameters along them and prescribe their itinerary in the moduli space of Riemann surfaces. This class of…

We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…