Skip to Content
  • 61 days
    Submission to First Decision
  • 7 days
    Acceptance to Publication

Geometry

Geometry is an international, peer-reviewed, open access journal which provides an advanced forum for studies related to geometry, and is published quarterly online by MDPI.

Get Alerted

Add your email address to receive forthcoming issues of this journal.

All Articles (48)

  • Article
  • Open Access

A reconstruction from finite descriptions must coordinate refinement, observable equivalence, admissible transformations, exclusion rules, and statistical weights. We study when these operations remain consistent in one filtered system. The additional results concern exclusion and repair. An exact conditioning identity separates leakage into excluded coarse states from distortion among retained states. For punctured residue vector spaces at squarefree moduli, we classify all probability repairs invariant under invertible linear transformations under reduction to a proper divisor: the repair set is an explicit product of simplexes, while full support compatibility is impossible. The corresponding discrepancy has a finite orbit mass formula, and separately feasible divisor repairs can be jointly incompatible. These results use standard conditional probability, Chinese remainder decomposition, and orbit theory; the elementary identities are not claimed as new general principles. The established inverse limit, ultrametric, and invariant measure results provide the supporting framework and involve direct comparisons to symbolic dynamics, projective gauge constructions, and hierarchical probability. The worked models give quantitative limiting weights, and two published physical constructions illustrate the distinction between a geometric capacity response and a compatible probability read-out. The framework certifies conditional consistency and identifies incompatible interpretations without selecting application-specific assumptions.

Geometry

12 November 2026

The finite-stage reconstruction architecture. Congruence makes the upper square commute. Finite congruent quotients commute with inverse limit without representative lifting; lifting is a stronger local condition. Compatible exclusion produces a surjective exposed subsystem whose inverse limit supports stable read-out. Blue boxes denote completion, quotient, and read-out objects; green boxes denote retained states and stable threads.
  • Article
  • Open Access

The problem of finding the maximum symmetric rank in dimension three—which, to our knowledge, is known only for degrees up to five—aims at a deeper understanding of tensor rank, especially in view of its computational complexity applications. We test a conjectural answer by pursuing a strategy that has led to the best known upper bound to date. As a first outcome, our main result reveals a connection between Waring decompositions and certain spectral data. We then highlight some examples of quartics that exhibit a special behavior. Finally, our findings indicate that a different conjectural answer, presented here for the first time, may be more plausible.

Geometry

20 October 2026

  • Article
  • Open Access

The Minkowski measurability of self-similar sets is closely linked to the lattice or non-lattice nature of the contraction ratios of the underlying iterated function system. A long-standing conjecture of Lapidus asserts that under certain conditions a self-similar fractal set is not Minkowski measurable if and only if it is of lattice-type. While the conjecture has been confirmed for self-similar subsets of R, the lattice case remains open in general in higher dimensions. This paper establishes non-Minkowski measurability for a class of regular n-flake dusts in R2. The proof uses hole points to show that the parallel volume fails to be twice differentiable at a critical radius, ruling out constancy of the associated log-periodic normalized volume. These results provide further support for the Lapidus conjecture.

Geometry

12 October 2026

  • Article
  • Open Access

Amicable Lattice Rhombuses Are Equable

  • Bohdan Biekietov,
  • Iwan Praton and
  • Weiran Zeng

A polygon is equable if its area is equal to its perimeter. A pair of polygons is an amicable pair if the area of the first is equal to the perimeter of the second, and vice versa. A polygon is a lattice polygon if its vertices lie on the integer lattice. We show that amicable lattice rhombuses are actually equable.

Geometry

15 September 2026

Highly Accessed Articles

News & Conferences

Latest Issues

Open for Submission

Journal Sections

XFacebookLinkedIn
Geometry - ISSN 3042-402X