arXiv (All)
open access
Pascal-like Sprugnoli arrays
In this note, we look at the structure and properties of palindromic or Pascal-like Sprugnoli arrays. We show that there are two closely related families of these arrays. We give closed form expressions for the elements of these families, and in each case, we describe the form of the inverse arrays.
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
- Construction of orthogonal arrays#356746
- Completing the Existence Problem for Integer Relative Heffter Arrays $\mathrm{H}_k(n;k)$#1050578
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
- Efficient computation of array factor and sidelobe level of linear arrays#324086
Record · ID 1062938
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