SearcharxivSearch

arXiv · math/0502377

The planar Chain Rule and the Differential Equation for the planar Logarithms

Abstract

A planar monomial is by definition an isomorphism class of a finite, planar, reduced rooted tree. If $x$ denotes the tree with a single vertex, any planar monomial is a non-associative product in $x$ relative to $m-$array grafting. A planar power series $f(x)$ over a field $K$ in $x$ is an infinite sum of $K-$multiples of planar monomials including the unit monomial represented by the empty tree. For every planar power series $f(x)$ there is a universal differential $d f(x)$ which is a planar power series in $x$ and a planar polynomial in a variable $y$ which is the differential $d x$ of $x$. We state a planar chain rule and apply it to prove that the derivative $\frac{d}{dx}(Exp_k(x))$ is the $k-$ary planar exponential series. A special case of the planar chain rule is proved and it derived that the planar universe series $Log_k (1+x)$ of $Exp_k(x)$ satisfies the differential equation $\biggl((1+x) \frac{d}{dx}\biggl)(Log_k(1+x)) = 1$ where $(1+x) \frac {d}{dx}$ is the derivative which when applied to $x$ results in $1 + x.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lothar Gerritzen. 2005-02-17. The planar Chain Rule and the Differential Equation for the planar Logarithms. https://arxiv.org/abs/math/0502377

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

KEEP EXPLORING

Related papers

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

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

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