Search arXivSearch

arXiv · 2507.16464

Hilbert basis in the face-centered cubic grid -- mathematical proofs

Abstract

The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set of a pointed, polyhedral cone which contains only non-negative integer vectors. The Hilbert basis of a grid gives the structure of the basic cycles in the grid. It is shown in this paper that the basic cycles of the FCC grid belong to 11 types. It is also discussed that how many elements are contained in the individual types. The proofs of the paper use geometric, combinatorial, algebraic, and operations research methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bela Vizvari, Gergely Kovacs, Benedek Nagy, Necet Deniz Turgay. 2025-07-22. Hilbert basis in the face-centered cubic grid -- mathematical proofs. https://arxiv.org/abs/2507.16464

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