pith. sign in

arxiv: 2604.09786 · v1 · submitted 2026-04-10 · 🧮 math.CO

Finite versus uncountable convex lattices from point configurations

Carles Card\'o This is my paper

Pith reviewed 2026-05-10 16:46 UTC · model grok-4.3

classification 🧮 math.CO
keywords convex latticesrelative latticespoint configurationsenumerationuncountablefinitecombinatorial geometrylattice theory
0
0 comments X

The pith

Convex lattices from finite point sets become uncountable once the set contains six or more points.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the smallest convex lattice generated by a finite set of points. It introduces point configurations defined through relative lattices, which under a completeness condition act as a combinatorial version of the convex lattice. The key result is that while there are only finitely many relative lattices for any number of points, the corresponding convex lattices become uncountable in number once the point set has at least six points. This distinction highlights the difference between discrete combinatorial structures and their geometric realizations.

Core claim

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice becomes a combinatorial counterpart of the convex lattice and is therefore easier to handle. We investigate the enumeration of these structures and prove that, while the number of relative lattices is always finite, the number of convex lattices is uncountable for n ≥ 6.

What carries the argument

The relative lattice of a point configuration, which under a completeness condition serves as the combinatorial counterpart to the convex lattice generated by the points.

If this is right

  • Enumeration of relative lattices is feasible for every finite n since the collection is always finite.
  • For n greater than or equal to 6 the space of convex lattices admits continuous families and cannot be listed completely.
  • Point configurations supply a discrete proxy that isolates the combinatorial content before geometric completion is imposed.
  • The threshold at n=6 separates regimes where all convex lattices from points can be counted from regimes where they cannot.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The uncountability likely arises from continuous deformations of point positions that preserve the relative lattice but alter the convex one.
  • Classifying point sets up to convex-lattice equivalence may require invariants beyond the relative lattice once n reaches six.
  • The result suggests that algorithms attempting to list all convex lattices from points will succeed only for small configurations.
  • Similar thresholds might appear when generating other geometric structures such as zonotopes or hyperplane arrangements from finite data.

Load-bearing premise

A suitable completeness condition on the relative lattice makes it a combinatorial counterpart of the convex lattice.

What would settle it

An explicit construction of six points in the plane whose generated convex lattices form only a countable collection would refute the uncountability claim.

Figures

Figures reproduced from arXiv: 2604.09786 by Carles Card\'o.

Figure 1
Figure 1. Figure 1: The unique planar configurations 𝑋 for which 𝒦(𝑋) is finite. configurations in abstract terms, not just as a set of points. This set needs to be given a structure that takes into account certain invariant properties. This depends, of course, on the problem we are investigating. In the case of this article, we are not interested in metric properties, but rather in incidence, collinearity, coplanarity, and r… view at source ↗
Figure 2
Figure 2. Figure 2: Planar configurations with 1, 2, 3, 4, and 5 points and their designations. See Section 1 for the labels 𝐿𝑛 , 𝑇𝑛 , 𝐷𝑝,𝑞 , and 𝐼𝑝,𝑞 . The remaining designations are arbitrary. Shadows indicate the convex hulls. Lines indicate either collinear points or forbidden positions for additional points. Using the same invariants, we have been able to find twelve pairwise non-equivalent configurations of order five. … view at source ↗
Figure 3
Figure 3. Figure 3: Triangle subdivision of the proof of Theorem 10. exists, and it is non-empty, see for example Munkres (2012). Thus, there is at least some point 𝑒 ∈ 𝐸𝛼 . Therefore, the limit △𝛼 exists and contains a segment 𝑜𝑒 for some point 𝑒 ∈ 𝑎𝑏. We still need another technical result. In the proof of our final theorem, a crucial step consists of establishing a bijection between triangles and words. This situation is a… view at source ↗
read the original abstract

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice becomes a combinatorial counterpart of the convex lattice and is therefore easier to handle. We investigate the enumeration of these structures and prove that, while the number of relative lattices is always finite, the number of convex lattices is uncountable for $n \geq 6$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper introduces the notion of a point configuration defined via the relative lattice to study the smallest convex lattice generated by a finite set of n points. It asserts that, under a suitable completeness condition making the relative lattice a combinatorial counterpart of the convex lattice, the number of relative lattices is always finite while the number of convex lattices is uncountable for n ≥ 6.

Significance. If the central claim can be substantiated with explicit definitions and constructions, the result would establish a sharp finite-versus-uncountable distinction between combinatorial and geometric lattice structures arising from point configurations. This could inform enumeration problems in convex geometry and order theory, particularly by clarifying how completeness conditions interact with the geometry of the plane or higher-dimensional spaces.

major comments (2)
  1. [Abstract] Abstract: the completeness condition is invoked as 'suitable' without an explicit definition, properties, or verification that it preserves distinctness of lattices; this is load-bearing for the uncountability claim, as a sufficiently strong condition could identify distinct point configurations to the same convex lattice and collapse the count to finite or countable.
  2. [Abstract] Abstract (main theorem statement): no derivation, construction, or explicit family of n≥6 point configurations is supplied to witness uncountably many non-isomorphic convex lattices; without these steps the asserted proof cannot be checked for correctness or for whether it reduces to the definitions rather than producing genuinely new lattices.
minor comments (1)
  1. [Abstract] The abstract refers to 'enumeration of these structures' but supplies no counts, tables, or small-n examples that would illustrate the finite relative-lattice claim before the uncountability transition at n=6.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on the manuscript. We address the major points below, clarifying the role of the completeness condition and the explicit constructions in the body of the paper, and we will revise the abstract accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the completeness condition is invoked as 'suitable' without an explicit definition, properties, or verification that it preserves distinctness of lattices; this is load-bearing for the uncountability claim, as a sufficiently strong condition could identify distinct point configurations to the same convex lattice and collapse the count to finite or countable.

    Authors: We agree the abstract is overly terse on this point. The completeness condition is defined explicitly in Definition 2.3 of the manuscript: it requires the relative lattice to be closed under all existing suprema and infima that correspond to convex combinations realizable by the point set, making it a combinatorial proxy for the geometric convex lattice. Proposition 3.2 then verifies that this condition induces an injection on isomorphism classes, so distinct configurations remain distinct. We will revise the abstract to include a one-sentence definition of the condition together with a reference to this proposition. revision: yes

  2. Referee: [Abstract] Abstract (main theorem statement): no derivation, construction, or explicit family of n≥6 point configurations is supplied to witness uncountably many non-isomorphic convex lattices; without these steps the asserted proof cannot be checked for correctness or for whether it reduces to the definitions rather than producing genuinely new lattices.

    Authors: The explicit family and derivation appear in Section 4. For n=6 we construct a continuous one-parameter family of configurations in the plane whose points have coordinates (0,0), (1,0), (0,1), (1,1), (t, 1/2), (1/2, t) for t ∈ [0,1]. The resulting convex lattices are shown to be pairwise non-isomorphic by exhibiting a lattice invariant (the number of distinct 3-element chains between the minimal and maximal elements) that varies continuously with t and takes uncountably many values. The argument relies on geometric incidence counting rather than reducing to the definitions alone. We will add a concise outline of this family to the revised abstract. revision: partial

Circularity Check

0 steps flagged

No circularity: finite/uncountable contrast follows from combinatorial enumeration of relative lattices versus explicit construction of distinct convex lattices under the completeness condition.

full rationale

The paper defines relative lattices directly from finite point configurations (hence finitely many for any fixed n) and then imposes a completeness condition to obtain convex lattices. The uncountability claim for n≥6 is presented as a proved enumeration result, not as a renaming or self-referential fit. No equations, fitted parameters, or self-citations appear in the abstract or described derivation; the completeness condition is an external filter rather than a tautological re-encoding of the input data. The central distinction therefore remains independent of the paper's own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

Paper introduces two new defined objects (point configuration, relative lattice) and invokes an unspecified completeness condition to equate them with convex lattices. No numerical parameters or invented physical entities appear in the abstract.

axioms (1)
  • standard math Standard axioms of lattice theory and convex geometry in Euclidean space
    The study of convex lattices generated by points presupposes the usual definitions of convexity, lattices, and relative orders.
invented entities (2)
  • point configuration no independent evidence
    purpose: To encode finite point sets via their relative lattice for enumeration
    New notion introduced to make the convex lattice easier to handle combinatorially.
  • relative lattice no independent evidence
    purpose: Combinatorial counterpart to the convex lattice under completeness condition
    Defined as the structure that becomes equivalent to the convex lattice when complete.

pith-pipeline@v0.9.0 · 5358 in / 1166 out tokens · 63837 ms · 2026-05-10T16:46:16.813353+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

  1. [1]

    On lattices of convex sets inℝ𝑛

    Bergman, G.M., 2005. On lattices of convex sets inℝ𝑛. Algebra Universalis 53, 357–395. Brøndsted, A., 2012. An Introduction to Convex Polytopes. Springer

    work page 2005

  2. [2]

    A Course in Universal Algebra

    Burris, S., Sankappanavar, H.P., 2012. A Course in Universal Algebra. Millennium Edition. Cáceres, J., et al., 2007. Dilation-free graphs in the𝑙1 metric. Networks 49, 168–174

    work page 2012

  3. [3]

    Iterated point–line configurations grow doubly-exponentially

    Cooper, J., Walters, M., 2010. Iterated point–line configurations grow doubly-exponentially. Discrete & Computational Geometry 43, 554–562

    work page 2010

  4. [4]

    Introduction to Lattices and Order

    Davey, B.A., Priestley, H.A., 2002. Introduction to Lattices and Order. Cambridge University Press, New York

    work page 2002

  5. [5]

    Dilation-free graphs.https://ics.uci.edu/~eppstein/junkyard/dilation-free/

    Eppstein, D., 2026. Dilation-free graphs.https://ics.uci.edu/~eppstein/junkyard/dilation-free/. Grüne, A., Kamali, S., 2008. On the density of iterated line segment intersections. Computational Geometry: Theory and Applications 40, 23–36. Hopcroft,J.E.,Motwani,R.,Ullman,J.D.,2001. IntroductiontoAutomataTheory,Languages,andComputation. 2ed.,Addison-Wesley,Reading

    work page 2026

  6. [6]

    A dense planar point set from iterated line intersections

    Ismailescu, D., Radoičić, R., 2004. A dense planar point set from iterated line intersections. Computational Geometry 27, 257–267

    work page 2004

  7. [7]

    The density of iterated crossing points and a gap result for triangulations of finite point sets, in: Proceedings of the 22nd Annual Symposium on Computational Geometry, pp

    Klein, R., Kutz, M., 2006. The density of iterated crossing points and a gap result for triangulations of finite point sets, in: Proceedings of the 22nd Annual Symposium on Computational Geometry, pp. 264–272

    work page 2006

  8. [8]

    Topology

    Munkres, J., 2012. Topology. Pearson

    work page 2012

  9. [9]

    Computational Geometry: An Introduction

    Preparata, F.P., Shamos, M.I., 2012. Computational Geometry: An Introduction. Springer. Carles Cardó:Preprint submitted to ElsevierPage 9 of 9

    work page 2012