English
Related papers

Related papers: Generating B\'ezout trees for Pythagorean pairs

200 papers

In a recent preprint, Gullerud and Walker [2] proved a theorem and made a conjecture about the correctness of efficiently generating B\'ezout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, confirm that…

Number Theory · Mathematics 2018-04-03 Cherng-tiao Perng , Maila Brucal-Hallare

We present a transformation, based on the B\'ezout's identity, which maps the set of pairs of relatively prime numbers $(p,q)$ with fixed $p$ and $0<q<p$, to pairs of relatively prime numbers in the $p\times p$ square in $\mathbb R^2$, in…

Number Theory · Mathematics 2020-09-01 Benjamín A. Itzá-Ortiz , Roberto López-Hernández , Pedro Miramontes

Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…

Populations and Evolution · Quantitative Biology 2021-09-08 C. Jarne , F A. Gómez Albarracín , M. Caruso

It is shown that Pythagorean triples can be used to generate matrices that have integer eigenvalues for all permutations of their coefficients, via simple formulas. For example, each and every permutation of the $2\times2$ matrix…

History and Overview · Mathematics 2026-02-24 Michael J. W. Hall

We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…

Combinatorics · Mathematics 2024-02-06 Anwar Al Ghabra , K. Gopala Krishna , Patrick Labelle , Vasilisa Shramchenko

We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations and experimentally verify its performance on tessellations.

Formal Languages and Automata Theory · Computer Science 2022-03-18 Dorota Celińska-Kopczyńska , Eryk Kopczyński

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Combinatorics · Mathematics 2025-03-05 David Serena , William J Buchanan

Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if…

Machine Learning · Computer Science 2019-08-14 Oktay Gunluk , Jayant Kalagnanam , Minhan Li , Matt Menickelly , Katya Scheinberg

This paper is a preliminary expository paper that outlines the relationship between solutions to the Erd\H{o}s-Straus conjecture for a given prime $p$ and their corresponding Pythagorean triples. This paper also uses B\'{e}zout Coefficients…

Number Theory · Mathematics 2021-07-13 Kyle Bradford

We consider simply generated trees and study multiplicative functions on rooted plane trees. We show that the associated generating functions satisfy differential equations or difference equations. Our approach considers B-series from…

Combinatorics · Mathematics 2007-05-23 Christian Mazza

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

Artificial Intelligence · Computer Science 2014-01-16 Neil C. A. Moore , Patrick Prosser

The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…

Probability · Mathematics 2007-05-23 D. Blömker , M. Romito , R. Tribe

Phylogenetic networks are used to represent the evolutionary history of species. Recently, the new class of orchard networks was introduced, which were later shown to be interpretable as trees with additional horizontal arcs. This makes the…

Combinatorics · Mathematics 2023-05-09 Leo van Iersel , Mark Jones , Esther Julien , Yukihiro Murakami

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

Combinatorics · Mathematics 2024-03-05 Ricardo Gómez Aíza

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

Number Theory · Mathematics 2025-08-12 Soumya Bhattacharya , Habibur Rahaman

Treemaps have been widely applied to the visualization of hierarchical data. A treemap takes a weighted tree and visualizes its leaves in a nested planar geometric shape, with sub-regions partitioned such that each sub-region has an area…

Graphics · Computer Science 2023-09-01 Mehdi Behroozi , Reyhaneh Mohammadi , Cody Dunne

In 1934 B. Berggren first discovered the surprising result that every Pythagorean triplet is the pre product of the triplet (3, 4, 5) presented as a column by a product of three matrices, that every triplet is obtained in this manner…

Number Theory · Mathematics 2021-10-19 Noam Zimhoni

In proper hyperbolic geodetic spaces we construct rooted $\mathbb R$-trees with the following properties. On the one hand, every ray starting at the root is quasi-geodetic; so these $\mathbb R$-trees represent the space itself well. At the…

Metric Geometry · Mathematics 2011-05-20 Matthias Hamann

A Pythagorean triple is a triple of positive integers $(x,y,z)$ such that $x^2+y^2=z^2$. If $x,y$ are coprime and $x$ is odd, then it is called a primitive Pythagorean triple. Berggren showed that every primitive Pythagorean triple can be…

Number Theory · Mathematics 2023-04-12 Lucia Janičková , Evelin Csókási

We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…

Combinatorics · Mathematics 2007-08-01 Sergi Elizalde
‹ Prev 1 2 3 10 Next ›