Related papers: Comment concerning Leonardo's rule
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
This paper is a sharp and focussed exploration of the Fibonacci substitution and the mathematical entity it gives rise to, the Fibonacci word. Our investigations are both of an algebraic and a geometric nature. Indeed, it is the combination…
Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
The purpose of this note is to explain the structure, general strategy, and main ideas of the proof in the work of Huang, McKenzie, and Yau (2024) on the Ramanujan property and edge universality of random regular graphs. The core of the…
A new general equation to explain bending of arbitrary rods (from arbitrary materials, cross sections, densities, strengthnesses, bending angles, etc) was proposed. This equation can solve several problems found in classical equations,…
Let $\mathcal{T}$ be the set of spanning trees of $G$ and let $L(T)$ be the number of leaves in a tree $T$. The leaf number $L(G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathcal{T}\}$. Let $G$ be a connected graph of order $n$ and…
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2{\pi}/d(v). We show: 1. Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and…
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect…
Pick a sequence of uniform points on the $d$-dimensional sphere. Then, link the $n$th point to its closest one that arrives in the past. This constructs a labelled tree called the nearest neighbour tree on the $d$-dimensional sphere. These…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
The LR-drawing-method is a method of drawing an ordered rooted binary tree based on drawing one root-to-leaf path on a vertical line and attaching recursively obtained drawings of the subtrees on the left and right. In this paper, we study…
There are two hypotheses on Leonardo's polyhedron based on the Pseudo-RCO and drawn for Luca Pacioli's book: Leonardo made an error, or: Leonardo draw it with intention, as it is. We give arguments, which support the Intention-hypothesis.
Giovanni Battista Benedetti (1530--1590) derived two constructions of ovals given their minor and major axes. These were published in 1585 and seem to be the first solution to this problem. Therefore, the generally accepted view that ``the…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
It seems reasonable that a toroid can be thought of approximately as a solenoid bent into a circle. The correspondence of the inductances of these two objects gives an approximation for the natural logarithm in terms of the average of two…
We give a thoroughful explanation of the general properties of different, general scales, corresponding to different (all possible) mathematical functions f(x), we mention and analyse many examples. These observations and statements might…
When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…
The visualization of any graph plays important role in various aspects, such as graph drawing software. Complex systems (like large databases or networks) that have a graph structure should be properly visualized in order to avoid…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…