相关论文: Scaling prediction for self-avoiding polygons revi…

Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…

Above the upper critical dimension, the breakdown of hyperscaling is associated with dangerous irrelevant variables in the renormalization group formalism at least for systems with periodic boundary conditions. While these have been…

We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…

Various examples of folding curves in $R^{2}$ have been considered: dragons and other square curves, terdragons and other triangular curves, Peano-Gosper curves based on hexagons. They are self-avoiding. They form coverings of $R^{2}$, by…

We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic way. We obtain a deterministic limit shape in the scaling…

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…

We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius $r$. We show numerically that the characteristic length of random knotting is roughly…

The "Perpendicular Bisectors Construction" is a natural way to seek a replacement for the circumcenter of a noncyclic quadrilateral in the plane. In this paper, we generalize this iterative construction to a construction on polytopes with…

The density crossover scaling of various thermodynamic properties of solutions and melts of self-avoiding and highly flexible polymer chains without chain intersections confined to strictly two dimensions is investigated by means of…

The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…

Recently the scaling function of the dilute non-contractible self-avoiding 2D polymer loop on a cylinder was related to the Painleve III transcendent. Using the perturbation theory, the thermidynamic Bethe ansatz and numerical calculations…

In this paper, we analyze the stochastic properties of some large size (area) polyominoe's perimeter such that the directed column-convex polyomino, the column-convex polyomino, the directed diagonally-convex polyomino, the staircase (or…

We calculate universal finite-size scaling functions for systems with an n-component order parameter and algebraically decaying interactions. Just as previously has been found for short-range interactions, this leads to a singular…

We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…

In this work we develop some automatic procedures for computing high order polynomial expansions of local (un)stable manifolds for equilibria of differential equations. Our method incorporates validated truncation error bounds, and…

We consider the singular value statistics of products of independent random matrices. In particular we compute the corresponding averages of products of characteristic polynomials. To this aim we apply the projection formula recently…

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…

We study by computer simulation a recently introduced generalised model of self-interacting self-avoiding trails on the square lattice that distinguishes two topologically different types of self-interaction: namely crossings where the…