Related papers: Critical exponents of plane meanders
The model of self-organizing Eulerian walkers is numerically investigated on the square lattice. The critical exponents for the distribution of a number of steps ($\tau_l$) and visited sites ($\tau_s$) characterizing the process of…
Two dimensional condensed matter is realised in increasingly diverse forms that are accessible to experiment and of potential technological value. The properties of these systems are influenced by many length scales and reflect both generic…
We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
To date the most precise estimations of the critical exponent for the Anderson transition have been made using the transfer matrix method. This method involves the simulation of extremely long quasi one-dimensional systems. The method is…
We use extensive Monte Carlo transfer matrix calculations on infinite strips of widths $L$ up to 30 lattice spacing and a finite-size scaling analysis to obtain critical exponents and conformal anomaly number $c$ for the two-dimensional…
In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
The relation between critical exponents, characterizing a continuous phase transition, and the fractal structure of physical lines, proliferating at the critical point, is established by considering the two-dimensional O($N$) spin model for…
We study the thermodynamics of an exactly solvable model of a self-interacting partially directed self-avoiding walk (DSAW) in two dimensions, when a force is applied on one end of the chain. The critical force for the unfolding is…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
Crossing symmetry asserts that particles are indistinguishable from anti-particles traveling back in time. In quantum field theory, this statement translates to the long-standing conjecture that probabilities for observing the two scenarios…
The eigenvalue equation of a band or a block tridiagonal matrix, the tight binding model for a crystal, a molecule, or a particle in a lattice with random potential or hopping amplitudes: these and other problems lead to three-term…
We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…
Some iterative calculations can be carried out by parallel communicating processors, and yield the same results whether or not the processors are synchronized. We show that this is the case if and only if the iteration is a contraction that…