Related papers: Characteristic length of random knotting for cylin…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
A crystal lattice, when confined to the surface of a cylinder, must have a periodic structure that is commensurate with the cylinder circumference. This constraint can frustrate the system, leading to oblique crystal lattices or to…
Break a stick at random at $n-1$ points to obtain $n$ pieces. We give an explicit formula for the probability that every choice of $k$ segments from this broken stick can form a $k$-gon, generalizing similar work. The method we use can be…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…
We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and pulling them uniformly from among sets of a given number of vertices $n$, as first established in recent work with…
A formula is derived for stiffness of a polymer chain in terms of the distribution function of end-to-end vectors. This relationship is applied to calculate the stiffness of Gaussian chains (neutral and carrying electric charges at the…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
Bending of worm-like polymers carries an energy penalty which results in the appearance of a persistence length l such that the polymer is straight on length scales smaller than l and bends only on length scales larger than this length.…
Inspired by how certain proteins "sense" knots and entanglements in DNA molecules, here we ask if there exist local geometric features that may be used as a read-out of the underlying topology of generic polymers. We perform molecular…
In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
The freely rotating chain is one of the classic discrete models of a polymer in dilute solution. It consists of a broken line of N straight segments of fixed length such that the angle between adjacent segments is constant and the N-1…
We give statistical definitions of the length, l, of a loose prime knot tied into a long, fluctuating ring macromolecule. Monte Carlo results for the equilibrium, good solvent regime show that < l > ~ N^t, where N is the ring length and t ~…
We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
The aim of this short article is to convey the basic idea of the original paper [3], without going into too much detail, about how to derive sharp asymptotics of the gyration radius for random walk, self-avoiding walk and oriented…
We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…