The exact complexity of a Robinson tiling

01/03/2022
by   Ilya Galanov, et al.
0

We find the exact formula for the number of distinct n × n square patterns which appear in a Robinson tiling made of one infinite order supertile.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/02/2019

Exact and Fast Inversion of the Approximate Discrete Radon Transform

We give an exact inversion formula for the approximate discrete Radon tr...
research
10/20/2019

The exact complexity of the Tutte polynomial

This is a survey on the exact complexity of computing the Tutte polynomi...
research
05/10/2019

Low-Complexity Tilings of the Plane

A two-dimensional configuration is a coloring of the infinite grid Z^2 w...
research
10/11/2020

A range characterization of the single-quadrant ADRT

This work characterizes the range of the single-quadrant approximate dis...
research
03/10/2019

State complexity of the multiples of the Thue-Morse set

The Thue-Morse set is the set of those nonnegative integers whose binary...
research
03/11/2018

Exact uniform sampling over catalan structures

We present a new framework for creating elegant algorithms for exact uni...
research
09/19/2019

A note on the quasiconvex Jensen divergences and the quasiconvex Bregman divergences derived thereof

We first introduce the class of quasiconvex and quasiconcave Jensen dive...

Please sign up or login with your details

Forgot password? Click here to reset