A Frameless 2-Coloring of the Plane Lattice

05/19/2020
by   Craig S. Kaplan, et al.
0

A picture frame in two dimensions is a rectangular array of symbols, with at least two rows and columns, where the first and last rows are identical, and the first and last columns are identical. If a coloring of the plane lattice has no picture frames, we call it frameless. In this note we show how to create a simple 2-coloring of the plane lattice that is frameless.

READ FULL TEXT

page 3

page 4

research
11/12/2020

Note on 3-Coloring of (2P_4,C_5)-Free Graphs

We show that the 3-coloring problem is polynomial-time solvable on (2P_4...
research
05/20/2020

Improved bounds for some facially constrained colorings

A facial-parity edge-coloring of a 2-edge-connected plane graph is a fac...
research
01/29/2018

Communication-Efficient Search for an Approximate Closest Lattice Point

We consider the problem of finding the closest lattice point to a vector...
research
06/02/2021

Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement

Probing is a general technique that is used to reduce the variance of th...
research
03/17/2022

Message recovery attack to NTRU using a lattice independent from the public key

In the present paper we introduce a new attack on NTRU-HPS cryptosystem ...
research
10/31/2022

Reconfiguration of colorings in triangulations of the sphere

In 1973, Fisk proved that any 4-coloring of a 3-colorable triangulation ...
research
08/09/2018

A note on partial rejection sampling for the hard disks model in the plane

In this note, we slightly improve the guarantees obtained by Guo and Jer...

Please sign up or login with your details

Forgot password? Click here to reset