2013
DOI: 10.1016/j.jnt.2013.01.010
|View full text |Cite
|
Sign up to set email alerts
|

Generalizations of Euler decomposition and their applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
22
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 18 publications
(22 citation statements)
references
References 9 publications
0
22
0
Order By: Relevance
“…The appearance of the formula is different from the one in [9]. They should agree with each other after rearrangement of terms since both formulas are based the shuffle product.…”
Section: Introductionmentioning
confidence: 84%
See 4 more Smart Citations
“…The appearance of the formula is different from the one in [9]. They should agree with each other after rearrangement of terms since both formulas are based the shuffle product.…”
Section: Introductionmentioning
confidence: 84%
“…This gives a so called decomposition formula when the product aXb on the right hand side is explicitly calculated even though a decomposition formula can also mean a formula derived from a process equivalent to the shuffle product, such as the one obtained in [9]. For example, when a = x m 0 x 1 and b = x n 0 x 1 this gives the Euler decomposition formula.…”
Section: Decomposition Formulas Of Mzvsmentioning
confidence: 99%
See 3 more Smart Citations