Related papers: Rooted Spiral Trees on Hyper-cubical lattices

Based on the strong coupling expansion, we reinvestigate the scaling behavior of the susceptibility chi of two-dimensional O(N) sigma model on the square lattice by the use of Pade-Borel approximants. To exploit the Borel transform, we…

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. Here, we will consider the case of trees…

The IIB matrix model has been proposed as a non-perturbative definition of superstring theory. In this work, we study the Euclidean version of this model in which extra dimensions can be dynamically compactified if a scenario of…

We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3…

We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the…

Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known…

We study the extreme local structure of plane binary trees through the distribution of leaves at maximum depth. We first address two basic questions: (i) the asymptotic probability that exactly two leaves occur at the deepest level, and…

Suggested by Scullard's recent star-triangle relation for bond correlated systems, we propose a general "cell/dual-cell" transformation, which allows in principle an infinite variety of lattices with exact percolation thresholds to be…

We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…

We express the partition functions of the spanning tree on finite square lattices under five different sets of boundary conditions (free, cylindrical, toroidal, M\"obius strip, and Klein bottle) in terms of a principal partition function…

The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…

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…

We study a generalized clock model on the simple cubic lattice. The parameter of the model can be tuned such that the amplitude of the leading correction to scaling vanishes. In the main part of the study we simulate the model with $Z_8$…

We explore the phase diagram of the SU(2) Yang-Mills theory in 5 dimensions by numerical simulations. The lattice system shows a dimensionally-reduced phase where the extra dimension is small compared to the four dimensional correlation…

As a nonperturbative check on the Q-exact lattice formulation, we demonstrate that the continuum R-symmetries are recovered. We locate the critical domain of the lattice theory. Aspects of the continuum nonrenormalization theorems are found…

We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…

This work extends the universal finite-size scaling framework for continuum percolation from two-dimensional (2D) to quasi-three-dimensional (Q3D) stick systems, in which sequentially deposited wires of finite diameter stack vertically on a…

We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into…

For rooted trees, an ideal drawing is one that is planar, straight-line, strictly-upward, and order-preserving. This paper considers ideal drawings of rooted trees with the objective of keeping the width of such drawings small. It is not…

We carry out a high-precision Monte Carlo simulation of the two-dimensional $O(3)$-invariant $\sigma$-model at correlation lengths $\xi$ up to $\sim 10^5$. Our work employs a new and powerful method for extrapolating finite-volume Monte…