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

Let $F$ be a totally real field in which $p$ is unramified. We prove that, if a cuspidal overconvergent Hilbert cuspidal form has small slopes under $U_p$-operators, then it is classical. Our method follows the original cohomological…

We extend the theorems of [G1] on $L^p$ to $L^p_s$ Sobolev improvement for translation invariant Radon and fractional singular Radon transforms over hypersurfaces, proving $L^p$ to $L^q_s$ boundedness results for such operators. Here $q…

We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…

I define a morphism on $\mathbb{C}_p$ called a lift of $p$-th power if its natural restriction to the residue field of $\mathbb{C}_p$ is a $p$-th power of some morphism. This definition generalizes from the lift of Frobenius. In this paper…

We prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…

A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…

We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…

We introduce and study "path odd-covers", a weakening of Gallai's path decomposition problem and a strengthening of the linear arboricity problem. The "path odd-cover number" $p_2(G)$ of a graph $G$ is the minimum cardinality of a…

We develop a method for proving sup-norm and H\"older estimates for $\overline{\partial}$ on wide class of finite type pseudoconvex domains in $\mathbb{C}^n$. A fundamental obstruction to proving sup-norm estimates is the possibility of…

In this paper we analyse the selection problem for weak solutions of the transport equation with rough vector field. We answer in the negative the question whether solutions of the equation with a regularized vector field converge to a…

In this paper we establish several invariant boundary versions of the (infinitesimal) Schwarz-Pick lemma for conformal pseudometrics on the unit disk and for holomorphic selfmaps of strongly convex domains in $\mathbb C^N$ in the spirit of…

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

This paper investigates the complexity of finding secluded paths in graphs. We focus on the \textsc{Short Secluded Path} problem and a natural new variant we introduce, \textsc{Shortest Secluded Path}. Formally, given an undirected graph…

To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…

We consider random walks and L\'evy processes in a homogeneous group $G$. For all $p > 0$, we completely characterise (almost) all $G$-valued L\'evy processes whose sample paths have finite $p$-variation, and give sufficient conditions…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We study rough differential equations driven by controlled rough paths in the level-$2$ regime $1/3<\alpha\le 1/2$. Given a reference rough path $\mathbf X=(1,X,\mathbb X)$ and an $\mathbf X$-controlled driver $\mathbf Z=(Z,Z')$, we first…

In the first part of the paper we introduce some geometric tools needed to describe slow-fast Hamiltonian systems on smooth manifolds. We start with a smooth Poisson bundle $p: M\to B$ of a regular (i.e. of constant rank) Poisson manifold…

We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…