English
Related papers

Related papers: Coloured Polymers

200 papers

After the introduction of sandpile model a number of different variants have been studied. In most of these models sand particles are indistinguishable. Here we have painted the sand particles using a few distinct colors, and restrict them…

Statistical Mechanics · Physics 2025-08-15 S. S. Manna

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their…

Combinatorics · Mathematics 2016-08-26 Erica Flapan , Sarah Rundell , Madeline Wyse

We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such…

Discrete Mathematics · Computer Science 2023-06-22 Christopher Duffy , Sonja Linghui Shan

This is a rather personal review of the problem of self-avoiding walks and polygons. After defining the problem, and outlining what is known rigorously and what is merely conjectured, I highlight the major outstanding problems. I then give…

Mathematical Physics · Physics 2012-12-17 Anthony J. Guttmann

We study a natural construction of a general class of inhomogeneous quantum walks (namely walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on…

Quantum Physics · Physics 2013-05-29 Noah Linden , James Sharam

We prove that every random walk in a uniformly elliptic random environment satisfying the cone mixing condition and a non-effective polynomial ballisticity condition with high enough degree has an asymptotic direction.

Probability · Mathematics 2019-08-27 Enrique Guerra , Alejandro F. Ramírez

We obtain the solution of models of self-avoiding walks with attractive interactions on Husimi lattices built with squares. Two attractive interactions are considered: between monomers on first-neighbor sites and not consecutive along a…

Statistical Mechanics · Physics 2009-11-10 Pablo Serra , Juergen F. Stilck , Welchy L. Cavalcanti , Kleber D. Machado

We study the behavior of self avoiding polymers in a background of vertically aligned rods that are either frozen into random positions or free to move horizontally. We find that in both cases the polymer chains are highly elongated, with…

Soft Condensed Matter · Physics 2009-11-10 J. M. Deutsch , M. Warkentin

We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…

Probability · Mathematics 2018-03-13 Svante Janson

We introduce and investigate oriented dichromatic singular links. We also introduce oriented disingquandles and use them to define counting invariants for oriented dichromatic singular links. We provide some examples to show that these…

Geometric Topology · Mathematics 2024-01-12 Mohd Ibrahim Sheikh , Mohamed Elhamdadi , Danish Ali

We extend our previous work from arXiv:1903.06863 on biquandle module invariants of oriented surface-links to the case of unoriented surface-links using bikei modules. The resulting infinite family of enhanced invariants proves be effective…

Geometric Topology · Mathematics 2022-04-07 Yewon Joung , Sam Nelson

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

Probability · Mathematics 2018-01-09 Antar Bandyopadhyay , Debleena Thacker

We classify compact quantum groups associated to noncrossing partitions coloured with two elements $x$ and $y$ which are their own inverses. Together with the work of P. Tarrago and M. Weber, this completes the classification of all…

Quantum Algebra · Mathematics 2018-06-12 Amaury Freslon

We consider two independent branching random walks that start next to each other on the $d$-dimensional hypercubic lattice and that carry two different colors. Vertices of the lattice are colored according to the color of the walker cloud…

Probability · Mathematics 2025-12-11 Partha Pratim Ghosh , Benedikt Jahnel

We find that 2-dimensional (2-D) critical branched polymers with no impurities conclusively belong to the same universality class as 2-D random percolation clusters, although pure critical 3-D branched polymers do not belong to the 3-D…

Statistical Mechanics · Physics 2007-05-23 H. H. Aragao-Rego , J. E. de Freitas , Liacir S. Lucena , G. M. Viswanathan

We give two extensions of the recent theorem of the first author that the odd distance graph has unbounded chromatic number. The first is that for any non-constant polynomial $f$ with integer coefficients and positive leading coefficient,…

Combinatorics · Mathematics 2024-05-24 James Davies , Rose McCarty , Michał Pilipczuk

We show that a random walk on the mapping class group of an orientable surface of finite type makes linear progress in the relative metric, which is quasi-isometric to the complex of curves.

Geometric Topology · Mathematics 2010-01-24 Joseph Maher

Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…

High Energy Physics - Lattice · Physics 2009-09-25 Carl M. Bender , Stefan Boettcher , Peter N. Meisinger

The model of directed polymer in a random environment is a fundamental model of interaction between a simple random walk and ambient disorder. This interaction gives rise to complex phenomena and transitions from a central limit theory to…

Probability · Mathematics 2024-09-13 Nikos Zygouras

We popularize the question whether, for $m$ large enough, all $m$-uniform shift-chain hypergraphs are properly $2$-colorable. On the other hand, we show that for every $m$ some $m$-uniform shift-chains are not polychromatic $3$-colorable.

Combinatorics · Mathematics 2024-05-14 Torsten Ueckerdt