相关论文: Comment concerning Leonardo's rule

The branching annihilating random walk is studied on a random graph whose sites have uniform number of neighbors (z). The Monte Carlo simulations in agreement with the generalized mean-field analysis indicate that the concentration decreses…

This note derives asymptotic upper and lower bounds for the number of planted plane trees on $n$ nodes assigned labels from the set $\{1,2,\ldots, k\}$ with the restriction that on any path from the root to a leaf, the labels must strictly…

The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…

Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet,…

In this note we follow the historical development of the ideas that led to the formulation of String Theory. We start from the inspired guess of Veneziano and its extension to the scattering of $N$ scalar particles, then we describe how the…

The trunk of a knot in $S^3$, defined by Makoto Ozawa, is a measure of geometric complexity similar to the bridge number or width of a knot. We prove that for any two knots $K_1$ and $K_2$, we have $tr(K_1 \# K_2) =…

The reptation Monte Carlo algorithm is a simple, physically motivated and efficient method for equilibrating semi-dilute solutions of linear polymers. Here we propose two simple generalizations for the analogue {\it Amoeba} algorithm for…

Grothendieck proposed a theory of regular polyhedra over finite fields in Section 4 of \textit{Esquisse d'un Programme}. He isolates certain key parameters from the automorphism groups of regular polyhedra, which can be extended to any…

To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava's factorials to a natural combinatorial setting suitable for studying questions around…

We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.

For a tree $T$, let $lp(T)$ be the number of different lengths of leaf to leaf paths in $T$. For a degree sequence $s$ of a tree, let ${\rm rad}(s)$ be the minimum radius of a tree with degree sequence $s$. Recently, Di Braccio,…

We give a combinatorial description for when the Specht module of an arbitrary diagram admits a (complete) branching rule. This description, given in terms of the maximal rectangles of the diagram, generalizes all previously known branching…

A narrow system is a combinatorial object introduced by Magidor and Shelah in connection with work on the tree property at successors of singular cardinals. In analogy to the tree property, a cardinal $\kappa$ satisfies the \emph{narrow…

Using Monte Carlo simulations we have studied the transition from an "active" steady state to an absorbing "inactive" state for two versions of the branching annihilating random walks with parity conservation on a square lattice. In the…

Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching rules. We demonstrate that splint properties implementation drastically…

In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered at each node along any path from the root reflects the…

We carefully review the hierarchical construction by Bouch [Bouch2015] of trees on the square lattice that can be grown from its root in $L!/C^L$ distinct ways, where $L$ denotes the number of bonds constituting the tree, and $C>1$ is a…

Consider the Aldous Markov chain on the space of rooted binary trees with $n$ labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix $1\le k < n$ and project the leaf…

The trial and condemnation of Giordano Bruno was mainly based on arguments of philosophical and theological nature, and therefore different from Galilei's. Such elements contribute to unfairly devalue the scientific contribution of Bruno…

We study the temporal evolution of the structure of the world's largest subway networks in an exploratory manner. We show that, remarkably, all these networks converge to {a shape which shares similar generic features} despite their…