Related papers: Coloured Polymers

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 prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…

A vertex colouring of a graph is \emph{nonrepetitive on paths} if there is no path $v_1,v_2,...,v_{2t}$ such that v_i and v_{t+i} receive the same colour for all i=1,2,...,t. We determine the maximum density of a graph that admits a…

It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of…

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

There have been separate studies of the polymer collapse transition, where the collapse was induced by two different types of attraction. In each case, the configurations of the polymer were given by the same subset of random walks being…

We consider a directed walk model of a homopolymer (in two dimensions) which is self-interacting and can undergo a collapse transition, subject to an applied tensile force. We review and interpret all the results already in the literature…

An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…

Following Mansour, let $S_n^{(r)}$ be the set of all coloured permutations on the symbols $1,2,...,n$ with colours $1,2,...,r$, which is the analogous of the symmetric group when r=1, and the hyperoctahedral group when r=2. Let…

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili's theorem and provide an elementary and shorter proof…

We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the…

Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that…

Colour algebras over fields of odd characteristic are well-known noncommutative Jordan algebras. We define colour algebras more generally over a unital commutative associative ring with $\frac{1}{2}\in R$, and show that colour algebras can…

We introduce a class of absorption mechanisms and study the behavior of real-valued centered random walks with finite variance that do not get absorbed. In particular, we prove persistence and scaling limit results, which, in many cases of…

We provide a characterization for anti-concentration of inhomogeneous random walks in non-abelian groups. In application we extend the classical bounds by Erdos-Littlewood-Offord and Sarkozy-Szemeredi to non-abelian settings.

We exhibit an extension of the category of class two nilpotent groups. It has the same objects but, unlike the latter, its morphisms are closed under pointwise addition of maps. At the same time the class of its morphisms is much smaller…

We investigate the emergence of subdiffusive transport by obstruction in continuum models for molecular crowding. While the underlying percolation transition for the accessible space displays universal behavior, the dynamic properties…

We present some exact results on the behavior of Branching and Annihilating Random Walks, both in the Directed Percolation and Parity Conserving universality classes. Contrary to usual perturbation theory, we perform an expansion in the…

We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…