arXiv 0910.45732009-10math.CO

Polyominoes with nearly convex columns: A semidirected model

Svjetlan Feretic

备注：: 26 pages, 13 figures

英文摘要：

Column-convex polyominoes are by now a well-explored model. So far, however, no attention has been given to polyominoes whose columns can have either one or two connected components. This little known kind of polyominoes seems not to be manageable as a whole. To obtain solvable models, one needs to introduce some restrictions. This paper is focused on polyominoes with hexagonal cells. The restrictions just mentioned are semidirectedness and an upper bound on the size of the gap within a column. The solvable models so obtained have rational area generating functions, as column-convex polyominoes do. However, the growth constants of the new models are 4.114908 and more, whereas the growth constant of column-convex polyominoes is 3.863131.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Polyominoes with nearly convex columns: A model with semidirected blocks

In most of today's exactly solved classes of polyominoes, either all members are convex (in some way), or all members are directed, or both. If the class is neither convex nor directed, the exact solution uses to be elusive. This paper is focused on polyominoes with hexagonal cells. Concretely, we deal with polyominoes whose columns can have either one or two connected components. Those polyominoes (unlike the well-explored column-convex polyominoes) cannot be exactly enumerated by any of the now existing methods. It is therefore appropriate to introduce additional restrictions, thus obtaining…

2009-10-25math.CO

Polyominoes with nearly convex columns: An undirected model

Column-convex polyominoes were introduced in 1950's by Temperley, a mathematical physicist working on "lattice gases". By now, column-convex polyominoes are a popular and well-understood model. There exist several generalizations of column-convex polyominoes; an example is a model called multi-directed animals. In this paper, we introduce a new sequence of supersets of column-convex polyominoes. Our model (we call it level m column-subconvex polyominoes) is defined in a simple way. We focus on the case when cells are hexagons and we compute the area generating functions for the levels one and …

2009-10-26math.CO

On column-convex and convex Carlitz polyominoes

In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{9\sqrt{2}(14+3\sqrt{3})}{2704\sqrt{πn^3}}4^n. \feq \item convex Carlitz polyominoes with perimeter $2n$ is \beq \frac{n+1}{10}\left(\frac{3+\sqrt{5}}{2}\right)^{n-2}. \feq \end{enumerate}

2021-01-31math.CO

The area generating function for simple-2-column polyominoes with hexagonal cells

Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this chapter we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2,..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely to 2-column polyominoes, is unlikely to be solvable. We therefore define a class of polyominoes which interpolates between column-convex polygons and 2-column polyominoes. We d…

2009-11-13math.CO

The area generating function for simplex-duplex polyominoes

Back in the early days of polyomino enumeration, a model called column-convex polyominoes was introduced and its area generating function was found. That generating function is rational: the numerator has degree four and the denominator has degree three. Let a column-duplex polyomino be a polyomino whose columns can have either one or two connected components. A simplex-duplex polyomino is a column-duplex polyomino in which there is no occurrence of two adjacent columns each having two connected components. Simplex-duplex polyominoes are not easy to deal with, but their area generating functio…

2009-10-26math.CO

Maximal increasing sequences in fillings of almost-moon polyominoes

It was proved by Rubey that the number of fillings with zeros and ones of a given moon polyomino that do not contain a northeast chain of size $k$ depends only on the set of columns of the polyomino, but not the shape of the polyomino. Rubey's proof is an adaption of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. In this paper we present a bijective proof for this result by considering fillings of almost-moon polyominoes, which are moon polyominoes after removing one of the rows. Explicitly, we construct a bijection which preserves the size of the largest northeast cha…

2014-03-25math.CO

更多相关论文收起更多论文

The number of directed k-convex polyominoes

We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study different families of directed convex polyominoes: symmetric polyominoes, parallelogram polyominoes. In this paper, we apply our method to determine the generating function for directed k-convex polyominoes. We show it is a rational function and we study its asymptotic behavior.

2015-01-05math.CO

加泰兰多边形中的黑色单元格容量

Black Cell Capacity in Catalan polyominoes

Israel Academic College（以色列学术学院）

本文研究了加泰兰多边形中黑色单元格容量的分布，并推导了相关生成函数。

2026-01-24math.CO

Fibonacci 多联骨牌：精细枚举与 Dyck 路径双射

Fibonacci Polyominoes: Refined Enumeration and Dyck-Path Bijections

Université Bourgogne Europe（勃艮第欧洲大学）；Universidad Nacional de Colombia（哥伦比亚国立大学）

本文研究 Fibonacci 多联骨牌的按面积和半周长枚举，通过生成函数得到含 Catalan 数的精细公式，并建立与带标签 Dyck 路径的双射，将统计量转化为峰与返回，还研究等高连续列并得到 Motzkin 数控制的精细化。

2026-09-25math.CO

Hecke增长图，以及堆叠多联骨牌填充中的最大递增和递减序列

Hecke growth diagrams, and maximal increasing and decreasing sequences in fillings of stack polyominoes

本文通过建立堆叠多联骨牌$01$-填充与拐角标记的双射，推广了增长图技术，为最长递增递减链对称分布定理提供了新证明与视角。

2024-08-29math.CO

The perimeter generating function for nondirected diagonally convex polyominoes

A polyomino is a finite, edge-connected set of cells in the plane. At the present time, an enumeration of all polyominoes is nowhere in sight. On the other hand, there are several subsets of polyominoes for which generating functions are known. For example, there exists extensive knowledge about column-convex polyominoes, a model introduced by Temperley in 1956. While studying column-convex polyominoes, researchers also gave a look at diagonally convex polyominoes (DCPs), but noticed an awkward feature: when the last diagonal of a DCP is deleted, the remaining object is not always a polyomino.…

2019-07-12math.CO

Convex polyominoes revisited: Enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees

The main contribution of this paper is a new column-by-column method for the decomposition of generating functions of convex polyominoes suitable for enumeration with respect to various statistics including but not limited to interior vertices, boundary vertices of certain degrees, and outer site perimeter. Using this decomposition, among other things, we show that A) the average number of interior vertices over all convex polyominoes of perimeter $2n$ is asymptotic to $\frac{n^2}{12}+\frac{n\sqrt{n}}{3\sqrtπ} -\frac{(21π-16)n}{12π}.$ B) the average number of boundary vertices with degree two …

2020-08-16math.CO

反演关系、互反性与多联骨牌

Inversion relations, reciprocity and polyominoes

本文推导多联骨牌生成函数的自互反性质，并建立组合互反结果与统计力学反演关系的联系，从而完全确定若干凸多边形的各向异性周长生成函数。

1999-08-23math.CO

Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes

We prove that the number of 01-fillings of a given stack polyomino (a polyomino with justified rows whose lengths form a unimodal sequence) with at most one 1 per column which do not contain a fixed-size northeast chain and a fixed-size southeast chain, depends only on the set of row lengths of the polyomino. The proof is via a bijection between fillings of stack polyominoes which differ only in the position of one row and uses the Hecke insertion algorithm by Buch, Kresch, Shimozono, Tamvakis, and Yong and the jeu de taquin for increasing tableaux of Thomas and Yong. Moreover, our bijection g…

2019-11-18math.CO

由避免 $(\geq,\geq)$ 的 Catalan 字决定的 polyomino 上的枚举

Enumeration on polyominoes determined by Catalan words avoiding $(\geq,\geq)$

本文研究了避免 $(\geq,\geq)$ 模式的 Catalan 字关联的 Motzkin polyomino，推导了基于长度、面积、半周长等参数的生成函数及闭式表达式，并将结果表示为三项式系数的线性组合。

2025-04-07math.CO

Optimal Partial Tiling of Manhattan Polyominoes

Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we give an algorithm linear in the number of columns. Some techniques are borrowed from traditional graph optimisation problems.

2009-11-14cs.DMcs.DSmath.CO

Motzkin 多联骨牌的组合数学

The Combinatorics of Motzkin Polyominoes

该研究探讨Motzkin多联骨牌的组合性质，建立其与Motzkin路径、受限Catalan字等的双射关系，推导多参数生成函数、渐近式与闭式表达，并证明相关三项式关系。

2024-06-22cs.DMmath.CO

蜂窝格上凸多项式对称类的Enumeration

Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice

Hiscononal polyominoes是蜂巢晶格上的polyominoes。我们列举了凸六角多项式的对称类。这里，凸性被理解为沿着三个主要列方向的凸性。我们推导出生成系列的自由（即反射和旋转）和非对称凸六角多项式，根据面积和半周长。我们给出了生成级数的显式公式或隐式函数方程，这便于计算机代数。

2004-03-10math-phmath.COmath.MP