Related papers: Bounds on multiple self-avoiding polygons
Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…
We study real linear spaces in projective space that avoid the real points of a non-degenerate projective variety. For a variety $X \subset \mathbb{P}^{n-1}$ with a real smooth point, we define the avoidance locus $\mathcal{A}_k(X)$ as the…
Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
The Meeting problem for $k\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each…
This paper establishes a novel upper bound-termed the arithmetic Singleton bound-on the Hamming distance of any simple-root constacyclic code over a finite field. The key technical ingredient is the notion of multiple equal-difference (MED)…
We study the effective radius of weakly self-avoiding star polymers in one, two, and three dimensions. Our model includes $N$ Brownian motions up to time $T$, started at the origin and subject to exponential penalization based on the amount…
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property…
We introduce several bilocal algorithms for lattice self-avoiding walks that provide reasonable models for the physical kinetics of polymers in the absence of hydrodynamic effects. We discuss their ergodicity in different confined…
We perform a numerical study of a new microcanonical polymer model on the three dimensional cubic lattice, consisting of ideal chains whose range and number of nearest-neighbor contacts are fixed to given values. Our simulations suggest an…
A variational framework is developed to examine the equilibrium states of a semi-flexible polymer that is constrained to lie on a fixed surface. As an application the confinement of a closed polymer loop of fixed length $2\pi R$ within a…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
In 1959, Erd\H{o}s and Moser asked for the maximum number of unit distances that may be formed among the vertices of a convex $n$-gon; until now, the best known upper bound has been $2\pi n \log_2 n + O(n)$, achieved by F\"uredi in 1990. In…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…
We solve a model of self-avoiding walks with up to two monomers per site on the Bethe lattice. This model, inspired on the Domb-Joyce model, was recently proposed to describe the collapse transition observed in interacting polymers [J.…
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).
We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…