相关论文: Comment concerning Leonardo's rule

The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…

We give a Large Deviation Principle (LDP) with explicit rate function for the distribution of vertex degrees in plane trees, a combinatorial model of RNA secondary structures. We calculate the typical degree distributions based on nearest…

In graph theory, a tree is one of the more popular families of graphs with a wide range of applications in computer science as well as many other related fields. While there are several distance measures over the set of all trees, we…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

In this note, a new concept called {\em $SDR$-matrix} is proposed, which is an infinite lower triangular matrix obeying the generalized rule of David star. Some basic properties of $SDR$-matrices are discussed and two conjectures on…

Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the…

One of humanity's earliest mathematical inquiries might have involved the geometric patterns in plants. The arrangement of leaves on a branch, seeds in a sunflower, and spines on a cactus exhibit repeated spirals, which appear with an…

A root system is splint if it is a decomposition into a union of two root systems. Examples of such root systems arise naturally in studying embeddings of reductive Lie subalgebras into simple Lie algebras. Given a splint root system, one…

Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…

The network formed by ridges in a straightened sheet of crumpled paper is studied using a laser profilometer. Square sheets of paper were crumpled into balls, unfolded and their height profile measured. From these profiles the imposed…

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a…

This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…

The lattice dimension of a graph G is the minimal dimension of a cubic lattice in which G can be isometrically embedded. We prove that the lattice dimension of a tree with n leaves is $\lceil n/2 \rceil$.

A ``k-rule" is a sequence A=((A_n,B_n):n<omega) of pairwise disjoint sets B_n, each of cardinality at most k, where A_n is a subset of B_n. A set X of natural numbers (a ``real'') follows a rule A if for infinitely many n we have that the…

In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, the eigenvalues are realized as the roots of a family of…

Let $L(n,d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d.$ In 1975 Lesniak gave the lower bound $B(n,d)=\lceil 2(n-1)/d\rceil$ for $L(n,d).$ When $d$ is even, $B(n,d)=L(n,d).$ But when $d$ is odd,…

A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…

Inspired by the theory of classifying topoi for geometric theories, we define rounded sketches and logoi and provide the notion of classifying logos for a rounded sketch. Rounded sketches can be used to axiomatise all the known fragments of…

We discuss the babylonian method of extracting the root square of a number, from the point of view of modern mathematics. We also speculate that the babylonian mathematics was rich enough for a generalization of this method, despite the…

The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history…