Related papers: H\"older-continuous rough paths by Fourier normal …
This paper presents strong worst-case iteration and operation complexity guarantees for Riemannian adaptive regularized Newton methods, a unified framework encompassing both Riemannian adaptive regularization (RAR) methods and Riemannian…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…
This article is devoted to the existence and uniqueness of pathwise solutions to stochastic evolution equations, driven by a H\"older continuous function with H\"older exponent in $(1/2,1)$, and with nontrivial multiplicative noise. As a…
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…
A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…
The search of high-order periodic orbits has been typically restricted to problems with symmetries that help to reduce the dimension of the search space. Well-known examples include reversible maps with symmetry lines. The present work…
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
We obtain an asymptotic H\"older estimate for functions satisfying a dynamic programming principle arising from a so-called ellipsoid process. By the ellipsoid process we mean a generalization of the random walk where the next step in the…
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…
In this article, we illustrate the flexibility of the algebraic integration formalism introduced by M. Gubinelli (2004), by establishing an existence and uniqueness result for delay equations driven by rough paths. We then apply our results…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…
By means of a Fourier optimization framework, we improve the current asymptotic bounds under GRH for two classical problems in number theory: the problem of estimating the least quadratic non-residue modulo a prime, and the problem of…
These notes are devoted to fluctuations of one-dimensional random walks. We discuss various approaches to first-passage times and to the corresponding conditional distributions. After discussion of some classical methods, such as reflection…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
We demonstrate that the conventional path integral formulations generate inconsistent results exemplified by the geometric Brownian motion under the general stochastic interpretation. We thus develop a novel path integral formulation for…
A braided Frobenius algebra is a Frobenius algebra with braiding that commutes with the operations, that are related to diagrams of compact surfaces with boundary expressed as ribbon graphs. A heap is a ternary operation exemplified by a…
For a fractional Brownian motion $B^H$ with Hurst parameter $H\in]{1/4},{1/2}[\cup]{1/2},1[$, multiple indefinite integrals on a simplex are constructed and the regularity of their sample paths are studied. Then, it is proved that the…