5 problems
- 0 votes0 replies0 views
Huang–Ye polynomial growth conjecture for maximal pattern complexity
Let be a topological dynamical system, and let be a finite open cover of . Define as the maximal, over all -element subsets…
- 0 votes0 replies0 views
Nivat's conjecture for convex shapes
Let be a finite alphabet and let be a configuration. For a non-empty set , the restriction…
- 0 votes0 replies0 views
Minimal periodic decomposition obstruction to low convex complexity
Let be a configuration with , and suppose … is a -minimal periodic decomposition. Let…
- 0 votes0 replies0 views
Sander–Tijdeman conjecture for convex pattern sets
Let be a finite convex lattice set, meaning that its convex hull is closed and … For a configurati…
- 0 votes0 replies0 views
Nivat's conjecture on low rectangular pattern complexity
Let be a configuration over a finite alphabet . For a finite domain , let denote the number of distinct -patterns in…