Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Hypercomplex number
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Further reading == {{refbegin}} * {{citation |first=Daniel |last=Alfsmann |chapter=On families of 2^N dimensional hypercomplex algebras suitable for digital signal processing |chapter-url=http://www.eurasip.org/proceedings/eusipco/eusipco2006/papers/1568981962.pdf |title=14th European Signal Processing Conference, Florence, Italy |year=2006 |pages=1–4 |url=https://ieeexplore.ieee.org/xpl/conhome/7065145/proceeding }} * {{citation |author-link=Emil Artin |first=Emil |last=Artin |orig-year=1928 |chapter=Zur Theorie der hyperkomplexen Zahlen; Zur Arithmetik hyperkomplexer Zahlen |title=The Collected Papers of Emil Artin |publisher=[[Addison-Wesley]] |year=1965 |pages=301–345 |editor-link=Serge Lang |editor-first=Serge |editor-last=Lang |editor2-link=John T. Tate |editor2-first=John T. |editor2-last=Tate}} * {{Citation | last1=Baez | first1=John | author1-link=John Baez | title=The Octonions | url=http://math.ucr.edu/home/baez/octonions/octonions.html | year=2002 | journal=[[Bulletin of the American Mathematical Society]] | issn=0002-9904 | volume=39 | issue=2 | pages=145–205 | doi=10.1090/S0273-0979-01-00934-X | arxiv=math/0105155 | s2cid=586512 }} * {{citation |author-link=Élie Cartan |first=Élie |last=Cartan |chapter=Les systèmes de nombres complex et les groupes de transformations |title=Encyclopédie des sciences mathématiques pures et appliquées |volume=I 1 |year=1908 }}. and ''Ouvres Completes'' T.2 pt. 1, pp 107–246. * {{citation |author-link=Max Herzberger |first=Max |last=Herzberger |year=1923 |url=https://www.deutsche-digitale-bibliothek.de/item/4V6F5ID5PHYD7UJ4F4ZDWHD2SBEXGCGQ |title=Ueber Systeme hyperkomplexer Grössen |work=Doctoral Dissertation |publisher=[[Humboldt University of Berlin|Friedrich Wilhelm University]] |access-date=2015-09-20 |archive-date=2021-01-30 |archive-url=https://web.archive.org/web/20210130183638/https://www.deutsche-digitale-bibliothek.de/item/4V6F5ID5PHYD7UJ4F4ZDWHD2SBEXGCGQ |url-status=dead }} * {{citation |first=Jeanne |last=La Duke |chapter=The study of linear associative algebras in the United States, 1870–1927 |pages=147–159 |editor-first=B. |editor-last=Srinivasan |editor2-first=J. |editor2-last=Sally |title=Emmy Noether in Bryn Mawr: Proceedings of a Symposium Sponsored by the Association for Women in Mathematics in Honor of Emmy Noether's 100th Birthday |url=https://books.google.com/books?id=b7NYvQEACAAJ |date=1983 |publisher=Springer |isbn=978-0-387-90838-0 }} * {{citation |first=Silviu |last=Olariu |title=Complex Numbers in N Dimensions |publisher=[[Elsevier]] |year=2002 |isbn=0-444-51123-7 |series=North-Holland Mathematics Studies |volume=190}} * {{citation |editor-first=Irene |editor-last=Sabadini|editor-link=Irene Sabadini |editor2-first=Michael |editor2-last=Shapiro |editor3-first=Frank |editor3-last=Sommen |title=Hypercomplex Analysis and Applications |publisher=Birkhauser |year=2009 |isbn=978-3-7643-9892-7 }} * {{citation |author-link=Henry Taber |first=Henry |last=Taber |title=On Hypercomplex Number Systems |journal=[[Transactions of the American Mathematical Society]] |volume=5 |issue=4 |pages=509–548 |year=1904 |jstor=1986280|doi=10.2307/1986280}} * {{citation |author-link=Joseph Wedderburn |first=J.H. |last=MacLagan Wedderburn |title=On Hypercomplex Numbers |journal=Proceedings of the London Mathematical Society |volume=s2-6 |issue=1 |pages=77–118 |year=1908 |doi=10.1112/plms/s2-6.1.77 |url=https://zenodo.org/record/1447798 }} {{refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)