Related papers: Constructive representation of primitive Pythagore…
Generalized Pythagoras trees were developed for visualizing hierarchical data, producing organic, fractal-like representations. However, the drawback of the original layout algorithm is visual overlap of tree branches. To avoid such…
A generalization of the term "generalized Clifford algebras" (as appears in papers on advances in applied Clifford algebras) is introduced. This algebra is studied by means of structure theory of central simple algebras. A graph theoretical…
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…
We provide an alternative description of the group of Riordan arrays, by using two power series of the form $\sum_{n=0}^{\infty} g_n x^n$, where $g_0 \ne 0$ to build a typical element of the constructed group. We relate these elements to…
In Euclidean geometry, the Pythagorean theorem is presented as an equation involving three squares. This paper explores how analogous expressions may be identified in spherical and hyperbolic geometries.
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
In this paper, we build on recent results by Chauve et al. (2014) and Bahrani and Lumbroso (2017), which combined the split-decomposition, as exposed by Gioan and Paul, with analytic combinatorics, to produce new enumerative results on…
Ever since it was published by Neugebauer and Sachs in 1945, the Old Babylonian tablet known as Plimpton 322 has been the subject of numerous studies leading to different and often conflicting interpretations of it. Overall, the tablet is…
From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…
This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…
Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…
Let $F=x^2+y^2-z^2$, $x_0 \in \mathbb{Z}^3$ primitive with $F(x_0)=0$, and $\Gamma \leq SO_F(\mathbb{Z})$ be a finitely generated thin subgroup. We consider the resulting thin orbits of Pythagorean triples $x_0 \cdot \Gamma$ - specifically…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…