Related papers: Coloured Polymers
A $\textit{ladder}$ is a set $S \subseteq \mathbb Z^+$ such that any finite coloring of $\mathbb Z$ contains arbitrarily long monochromatic progressions with common difference in $S$. Van der Waerden's theorem famously asserts that $\mathbb…
Suppose that we have a finite colouring of the reals. What sumset-type structures can we hope to find in some colour class? One of our aims is to show that there is such a colouring for which no uncountable set has all of its pairwise sums…
We show that incompressible polar active fluids can exhibit an ordered, coherently moving phase even in the presence of quenched disorder in two dimensions. Unlike such active fluids with annealed (i.e., time-dependent) disorder only, which…
We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force. In this paper the force is applied normal to the surface at the last vertex of the walk. We prove that…
In this paper, we consider directed polymers in random environment with discrete space and time. For transverse dimension at least equal to 3, we prove that diffusivity holds for the path in the full weak disorder region, i.e., where the…
In this paper, we study random walks evolving with a directional bias in a two-dimensional random environment with correlations that vanish polynomially. Using renormalization methods first employed for one-dimensional dynamic environments…
We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We…
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights…
Quantum walks with long-range steps $R^{-\gamma}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $\gamma\geq2$. This is in contrast to classical random walks, which for $\gamma >3$ belong to a…
We examine the question of whether a collection of random walks on a graph can be coupled so that they never collide. In particular, we show that on the complete graph on n vertices, with or without loops, there is a Markovian coupling…
We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…
In the context of the coloured stochastic vertex model in a quadrant, we identify a family of observables whose averages are given by explicit contour integrals. The observables are certain linear combinations of $q$-moments of the coloured…
Given a quandle, we can construct a symmetric quandle called the symmetric double of the quandle. We show that the (co)homology groups of a given quandle are isomorphic to those of its symmetric double. Moreover, quandle coloring numbers…
We prove Gaussian concentration inequalities for maximal displacement of compactly supported random walks on a compactly generated locally compact group with polynomial growth. Concentration inequalities with different exponents hold for…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…
In this paper we study a two-dimensional directed self-avoiding walk model of a random copolymer in a random emulsion.
Self-propelled particles with anti-aligning interactions generally do not form a polar order. However, in this Letter, we show that when multiple types of such particles coexist and interact through aligning interactions between different…