2013
DOI: 10.1063/1.4825539
|View full text |Cite
|
Sign up to set email alerts
|

About Pascal's tetrahedron with hypercomplex entries

Abstract: It is evident, that the properties of monogenic polynomials in (n + 1)−real variables significantly depend on the generators e 1 , e 2 ,. .. , e n of the underlying 2 n-dimensional Clifford algebra Cℓ 0,n over R and their interactions under multiplication. The case of n = 3 is studied through the consideration of Pascal's tetrahedron with hypercomplex entries as special case of the general Pascal simplex for arbitrary n, which represents a useful geometric arrangement of all possible products. The different la… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…As a first step, the case n = 3 and the corresponding hypercomplex Pascal polyhedron has been studied. 52 A remark on the expression of complicated formulae in representation theory and hypergeometric functions theory by polyhedral geometry can be found in Arnolds paper. 1 Due to the fact that the inner structure of all  n k is in a certain sense independent from n (only the dimension of R n , i.e.…”
Section: Table 2 Hypercomplex Coefficients Inmentioning
confidence: 99%
See 1 more Smart Citation
“…As a first step, the case n = 3 and the corresponding hypercomplex Pascal polyhedron has been studied. 52 A remark on the expression of complicated formulae in representation theory and hypergeometric functions theory by polyhedral geometry can be found in Arnolds paper. 1 Due to the fact that the inner structure of all  n k is in a certain sense independent from n (only the dimension of R n , i.e.…”
Section: Table 2 Hypercomplex Coefficients Inmentioning
confidence: 99%
“…The higher dimensional case with n ≥ 3 needs to be handled with polyhedral geometry. As a first step, the case n=3 and the corresponding hypercomplex Pascal polyhedron has been studied 52 . A remark on the expression of complicated formulae in representation theory and hypergeometric functions theory by polyhedral geometry can be found in Arnolds paper 1 …”
Section: On Different Roads: From Complex Powers To Hypercomplex Appe...mentioning
confidence: 99%
“…In the following we intensively use the embedding of the non-commutative Clifford algebra product into an n − nary symmetric product (see [4] and more detailed [5]):…”
Section: -1mentioning
confidence: 99%
“…In the following we intensively use the embedding of the non-commutative Clifford algebra product into an n − nary symmetric product (see [4] and more detailed [5]):…”
Section: Introduction and Basic Notationsmentioning
confidence: 99%
“…(2), if k is even(8) which, in turn, can be written in the form c k (2) in terms of the generalized central binomial coefficient resp. in terms of Pochhammer symbols as in(5). Obviously, (8) is the special n = 2 case of c k (n) 1)!!…”
mentioning
confidence: 99%