Percolation is Odd

09/03/2019
by   Stephan Mertens, et al.
0

We discuss the number of spanning configurations in site percolation. We show that for a large class of lattices, the number of spanning configrations is odd for all lattice sizes. This class includes site percolation on the square lattice and on the hypercubic lattice in any dimension.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

Construction of s-extremal optimal unimodular lattices in dimension 52

An s-extremal optimal unimodular lattice in dimension 52 is constructed ...
research
10/09/2019

Deciding whether a Lattice has an Orthonormal Basis is in co-NP

We show that the problem of deciding whether a given Euclidean lattice L...
research
03/22/2023

Provenance for Lattice QCD workflows

We present a provenance model for the generic workflow of numerical Latt...
research
12/17/2019

Substitutes for the non-existent square lattice designs for 36 varieties

Square lattice designs are often used in trials of new varieties of vari...
research
05/14/2022

Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture

We consider minimal-perimeter lattice animals, providing a set of condit...
research
10/26/2020

A note on optimal degree-three spanners of the square lattice

In this short note, we prove that the degree-three dilation of the squar...
research
03/25/2019

Computing a Minimal Set of t-Spanning Motion Primitives for Lattice Planners

In this paper we consider the problem of computing an optimal set of mot...

Please sign up or login with your details

Forgot password? Click here to reset