arXiv (All)
open access
Fibonacci Polyominoes: Refined Enumeration and Dyck-Path Bijections
We study Fibonacci polyominoes, a class of column-convex polyominoes whose lower boundary is a staircase path made of unit horizontal and vertical steps. We derive generating functions that enumerate these polyominoes by area and semiperimeter. The resulting formulas give refinements of the classica
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quadri-Figures in Cayley-Klein Planes II: The Miquel-Steiner Theorem#1129208
- Non-convex unit-edge polytopes on kissing configurations in dimensions 5-7#1070126
- The First 1001 Fibonacci Numbers#28070
- Counting Truchet Tile Balls#1013638
- Time-optimal Convexified Reeds-Shepp Paths on a Sphere#149245
Record · ID 1078168
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive