Results 61 to 70 of about 2,994 (170)
Complexity of Interlocking Polyominoes [PDF]
, 2011 Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is already known
Abel, Zachary, Dhawan, Sidharth
core
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
, 2019 We analyze the computational complexity of the many types of pencil-and-paper-style puzzles featured in the 2016 puzzle video game The Witness. In all puzzles, the goal is to draw a simple path in a rectangular grid graph from a start vertex to a ...
Abel, Zachary +9 more
core +1 more source
ZAGREB CONNECTION INDICES ON POLYOMINO CHAINS AND RANDOM POLYOMINO CHAINS
Open MathematicsIn this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article thoroughly examines precise formulas and investigates extreme values.
Sayle Sigarreta Ricardo +1 more
openaire +3 more sources
Signed polyomino tilings by n-in-line polyominoes and Gröbner bases
Publications de l'Institut Mathematique, 2016 Conway and Lagarias observed that a triangular region T(m) in a hexagonal lattice admits a signed tiling by three-in-line polyominoes (tribones) if and only if m 2 {9d?1, 9d}d2N. We apply the theory of Gr?bner bases over integers to show that T(m) admits a signed tiling by n-in-line polyominoes (n-bones) if and only if m 2 {dn2 ? 1, dn2}d2N.
Dizdarevic M. +2 more
openaire +5 more sources
The combinatorics of the leading root of the partial theta function [PDF]
, 2012 Recently Alan Sokal studied the leading root $x_0(q)$ of the partial theta function $\Theta_0(x,q)=\sum\limits_{n=0}^\infty x^nq^{\binom n2}$, considered as a formal power series.
Prellberg, Thomas
core
Partially directed snake polyominoes
Discrete Applied Mathematics, 2018 18 pages, 15 ...
Goupil, Alain +2 more
openaire +2 more sources
Connected Reconfiguration of Polyominoes Amid Obstacles using RRT* [PDF]
, 2022 J. García +4 more
openalex +1 more source
Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry
, 2011 We describe computer algorithms that produce the complete set of isohedral tilings by n-omino or n-iamond tiles in which the tiles are fundamental domains and the tilings have 3-, 4-, or 6-fold rotational symmetry. The symmetry groups of such tilings are
Fukuda, Hiroshi +4 more
core +2 more sources
A polyominoes-permutations injection and tree-like convex polyominoes
Journal of Combinatorial Theory, Series A, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandrowicz, Gadi +2 more
openaire +2 more sources
Rank Bounded Hibi Subrings for Planar Distributive Lattices [PDF]
, 2019 Let $L$ be a distributive lattice and $R[L]$ the associated Hibi ring. We show that if $L$ is planar, then any bounded Hibi subring of $R[L]$ has a quadratic Gr\"obner basis.
Irfan, Rida, Shoukat, Nadia
core +2 more sources