Cutting Corners

by   Ville Salo, et al.

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main results are that for such an SFT, a locally legal pattern of convex shape is globally legal, and there is a measure that samples uniformly on all convex sets. Under suitable computability assumptions, this measure can be sampled, and legal configurations counted and enumerated, effectively and efficiently. Our approach to convexity is axiomatic, and only requires an abstract convex geometry that is "midpointed with respect to the shape". We construct such convex geometries on several groups, in particular all strongly polycyclic groups and free groups. We also show some other methods for sampling finite patterns, one based on orderings and one based on contructing new "independent sets" from old. We also show a link to conjectures of Gottshalk and Kaplansky.


Strongly Convex Divergences

We consider a sub-class of the f-divergences satisfying a stronger conve...

Convex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes

Decomposition of shapes into (approximate) convex parts is essential for...

Low-Complexity Tilings of the Plane

A two-dimensional configuration is a coloring of the infinite grid Z^2 w...

Conditional Logic is Complete for Convexity in the Plane

We prove completeness of preferential conditional logic with respect to ...

Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups

We study the periodicity of subshifts of finite type (SFT) on Baumslag-S...

Equality before the Law: Legal Judgment Consistency Analysis for Fairness

In a legal system, judgment consistency is regarded as one of the most i...

Compensated Convexity on Bounded Domains, Mixed Moreau Envelopes and Computational Methods

We introduce local compensated convex transforms for functions defined i...

Code Repositories


Launched in 2018 Actively developed and supported. Supports tkinter, Qt, WxPython, Remi (in browser). Create custom layout GUI's simply. Python 2.7 & 3 Support. 200+ Demo programs & Cookbook for rapid start. Extensive documentation. Examples using Machine Learning(GUI, OpenCV Integration, Chatterbot), Floating Desktop Widgets, Matplotlib + Pyplot integration, add GUI to command line scripts, PDF & Image Viewer. For both beginning and advanced programmers .

view repo


Javascript to Lua translator

view repo


Lightning fast data serialization and RPC for Crystal

view repo


Lifelong Planning A* (LPA*) is a replanning method that is an incremental version of A* algorithm for single-shot grid-based 2D path finding.

view repo