Collected Papers of K.-T. Chen 2001
DOI: 10.1007/978-1-4612-2096-1_7
|View full text |Cite
|
Sign up to set email alerts
|

Integration of Paths, Geometric Invariants and a Generalized Baker-Hausdorff Formula

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
149
0
1

Year Published

2002
2002
2018
2018

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 90 publications
(152 citation statements)
references
References 5 publications
2
149
0
1
Order By: Relevance
“…(If, for each w ∈ A * , α, w = α w and β, w = β w , then α β, w = (αβ) w given in (6).) Consider the graded commutative K-algebra K[T ] (graded by the degree of forests, or, more generally, by the weight of forests if A is a weighted alphabet), where the unity element is represented by the empty forest, and each monomial t 1 · · · t m with t 1 , .…”
Section: Remark 21mentioning
confidence: 99%
See 2 more Smart Citations
“…(If, for each w ∈ A * , α, w = α w and β, w = β w , then α β, w = (αβ) w given in (6).) Consider the graded commutative K-algebra K[T ] (graded by the degree of forests, or, more generally, by the weight of forests if A is a weighted alphabet), where the unity element is represented by the empty forest, and each monomial t 1 · · · t m with t 1 , .…”
Section: Remark 21mentioning
confidence: 99%
“…(6) In some applications, the alphabet A may be infinite, but then it typically makes sense assigning a weight (a positive integer) to each letter, and, when needed, truncating the series (4) according to the weight w of each word w ∈ A. Note that the set A * of words on the alphabet A with a prescribed weight is finite provided that the subsets A k ⊂ A of letters with weight k (k ≥ 1) are finite.…”
Section: Introduction General Setting and Examplesmentioning
confidence: 97%
See 1 more Smart Citation
“…The following results were obtained in [11]. Their proofs are based on [14,Thm. 4.2] and the results of [21].…”
Section: 3mentioning
confidence: 87%
“…We can formally write the solution to (2.3) as the Neumann series (2.6) which converges provided t 0 A(τ ) dτ < ∞. (This method of successive approximation for integral equations is also known as the Peano-Baker series, matrizant, Feynman-Dyson path ordered exponential, or Chen-Fleiss series [34,3,13,10,37]). …”
Section: Neumann and Magnus Expansionsmentioning
confidence: 99%