Search arXivSearch

arXiv · 1601.00572

Signed tilings by ribbon L n-ominoes, n even, via Groebner bases

Abstract

Let $\mathcal{T}_n$ be the set of ribbon $L$-shaped $n$-ominoes for some $n\ge 4$ even, and let $\mathcal{T}_n^+$ be $\mathcal{T}_n$ with an extra $2\times 2$ square. We investigate signed tilings of rectangles by $\mathcal{T}_n$ and $\mathcal{T}_n^+$. We show that a rectangle has a signed tiling by $\mathcal{T}_n$ if and only if both sides of the rectangle are even and one of them is divisible by $n$, or if one of the sides is odd and the other side is divisible by $n\left (\frac{n}{2}-2\right ).$ We also show that a rectangle has a signed tiling by $\mathcal{T}_n^+, n\ge 6$ even, if and only if both sides of the rectangle are even, or if one of the sides is odd and the other side is divisible by $n\left (\frac{n}{2}-2\right ).$ Our proofs are based on the exhibition of explicit Gröbner bases for the ideals generated by polynomials associated to the tiling sets. In particular, we show that some of the regular tiling results in \emph{ V.~Nitica, Every tiling of the first quadrant by ribbon $L$ $n$-ominoes follows the rectangular pattern. Open Journal of Discrete Mathematics, {\em 5}, (2015) 11--25,} cannot be obtained from coloring invariants.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kenneth Gill, Viorel Nitica. 2016-02-29. Signed tilings by ribbon L n-ominoes, n even, via Groebner bases. https://arxiv.org/abs/1601.00572

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO