vix.ing · top · new · best · stats · spec

On the non-commutative Newton binomial formula

2019/02/28 by A. Hosseini, Amin Hosseini, Hosseini, A. +3 · 1 citation
Computer Science · Mathematics · #11B65 #47B47 #47B48 #Advanced Topics in Algebra #Algebraic structures and combinatorial models #F.2.1 #FOS: Mathematics #Functional Analysis (math.FA) #Matrix Theory and Algorithms #acm:11B65 #acm:47B47 #acm:47B48 #math.FA #msc:11B65 #msc:47B47 #msc:47B48

paper · pdf · doi:10.48550/arxiv.1902.10939

This paper contains 11 pages, 2 sections, 3 main results

arxiv created 2019/02/28 · openalex publication_date 2019/02/28 · arxiv updated 2019/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this article, using generalized derivations, we obtain a simple idea to prove the non-commutative Newton binomial formula in unital algebras and then, we extend that formula to non-unital algebras. Additionally, we establish the non-commutative Newton binomial formula with a negative power.

Cited by

Related