Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion (Q782398): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lectures on Self-Avoiding Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-avoiding walk is sub-ballistic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of self-avoiding polygons via joining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-avoiding walk in five or more dimensions. I: The critical behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hammersley-Welsh bound for self-avoiding walk revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Self-Avoiding Walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Self-Avoiding Walks. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The self-avoiding walk. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling limit of self-avoiding random walk in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Complex Analysis and Probability / rank
 
Normal rank

Latest revision as of 04:38, 23 July 2024

scientific article
Language Label Description Also known as
English
Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
scientific article

    Statements

    Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2020
    0 references
    self-avoiding walk
    0 references
    Hammersley-Welsh bound
    0 references

    Identifiers