Utvidet returrett til 31. januar 2025

Tree successor algebra

Om Tree successor algebra

Tree successor algebra: A new branch in mathematics is a book about a formal theory of tree generation with an axiomatic basis for a new object called collection space. The elements of this space, in other words collections, have a clear connection to rooted trees and are treated as variables in sum form equations, the application area of tree successor algebra. With connections to different branches of mathematics such as number theory, linear algebra and algebra, tree successor algebra shows a fundamental link between rooted tree generation and partition generation, establishing a well-defined order in which rooted trees are generated. This in turn makes it possible to define a successor operator, the unit of least action in tree generation, and generalize it in order to create a concept of tree sequences. Due to this, the concept of the infinite sequence of all rooted trees can be formed, and the notion of a rooted tree line, and thus the need for tools to solve sum form equations rises. The axiomatic system answers to this need.

Vis mer
  • Språk:
  • Engelsk
  • ISBN:
  • 9789523395787
  • Bindende:
  • Paperback
  • Sider:
  • 578
  • Utgitt:
  • 29. juni 2023
  • Dimensjoner:
  • 170x36x220 mm.
  • Vekt:
  • 995 g.
  • BLACK NOVEMBER
  Gratis frakt
Leveringstid: 2-4 uker
Forventet levering: 19. desember 2024

Beskrivelse av Tree successor algebra

Tree successor algebra: A new branch in mathematics is a book about a formal theory of tree generation with an axiomatic basis for a new object called collection space. The elements of this space, in other words collections, have a clear connection to rooted trees and are treated as variables in sum form equations, the application area of tree successor algebra. With connections to different branches of mathematics such as number theory, linear algebra and algebra, tree successor algebra shows a fundamental link between rooted tree generation and partition generation, establishing a well-defined order in which rooted trees are generated. This in turn makes it possible to define a successor operator, the unit of least action in tree generation, and generalize it in order to create a concept of tree sequences. Due to this, the concept of the infinite sequence of all rooted trees can be formed, and the notion of a rooted tree line, and thus the need for tools to solve sum form equations rises. The axiomatic system answers to this need.

Brukervurderinger av Tree successor algebra



Finn lignende bøker
Boken Tree successor algebra finnes i følgende kategorier:

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.