Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1911.08766

From iterated integrals and chronological calculus to Hopf and Rota-Baxter algebras

Kurusch Ebrahimi-Fard·Frederic Patras
View original source ↗Read source document ↗Export metadata ↓

Abstract

Gian-Carlo Rota mentioned in one of his last articles the problem of developing a theory around the notion of integration algebras, which should be dual to the one of differential algebras. This idea has been developed historically along three lines: using properties of iterated integrals and generalisations thereof, as in the theory of rough paths; using the algebraic structures underlying chronological calculus such as shuffle and pre-Lie products, as they appear in theoretical physics and control theory; and, more generally, using a particular operator identity which came to be known as Rota-Baxter relation. The recent developments along each of these lines of research and their various application domains are not always known to other communities in mathematics and related fields. The general aim of this survey is therefore to present a modern and unified perspective on these approaches, featuring among others non-commutative Rota-Baxter algebras and related Hopf and Lie algebraic structures such as descent algebras, algebras of simplices as well as shuffle, pre- and post-Lie algebras and their enveloping algebras. Accordingly, two viewpoints are proposed. A geometric one, that can be derived using combinatorial properties of Euclidean simplices and the duality between integrands and integration domains in iterated integrals. An algebraic one, provided by the axiomatisation of integral calculus in terms of Rota-Baxter algebra.

Explore related subjects

math.RAmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kurusch Ebrahimi-Fard, Frederic Patras. 2019-11-20. From iterated integrals and chronological calculus to Hopf and Rota-Baxter algebras. https://doi.org/10.1002/9781119880912.ch2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗