283 The Combinatorial Axiom Foundation of Discrete Order Geometry (DOG)
527
0
·
2026/05/20
·
6 mins read
☕
WriterShelf™ is a unique multiple pen name blogging and forum platform. Protect relationships and your privacy. Take your writing in new directions. ** Join WriterShelf**
WriterShelf™ is an open writing platform. The views, information and opinions in this article are those of the author.
Article info
This article is part of:
Categories:
⟩
⟩
Date:
Published: 2026/05/20 - Updated: 2026/09/29
Total: 1469 words
Like
or Dislike
About the Author
I love science as much as art, logic as deeply as emotion.
I write the softest human stories beneath the hardest sci-fi.
May words bridge us to kindred spirits across the world.
More from this author
More to explore

The Combinatorial Axiomatic Basis of Discrete Order Geometry (DOG)
— A Preliminary Exploration of a Combinatorial Generative Framework for Geometric Configurations
Author: Zhang Suhang
(Luoyang, Henan)
---
Abstract
Classical geometry and modern differential geometry systems take continuous manifolds, smooth metrics, and differential structures as their core foundations, constructing a self-consistent and complete framework for spatial description, and have achieved mature theoretical results in Euclidean geometry, Riemannian geometry, algebraic geometry, and gauge field geometry. On this basis, this paper discusses a geometric construction framework based on discrete primitives and combinatorial order: Discrete Order Geometry (DOG).
The basic thesis of this paper is: continuous smooth space can be regarded as the limit case of discrete primitives after highly ordered and densely arranged distribution; several geometric forms, topological structures, and spatial orders can be generated from basic geometric units through permutation, combination, adjacency, and ordered reconstruction.
DOG provides a preliminary discrete constructive perspective for continuous geometry, discussing differential description, manifold structure, and connection transformations within a more general combinatorial order framework. This paper discusses its positioning as a combinatorial construction framework.
Keywords: Discrete Order Geometry; DOG; combinatorial construction; geometric primitives; topological configuration; discrete space
---
1 Introduction
Since the establishment of modern geometric systems, mathematics' description of space has long relied on the continuous smooth paradigm. Euclidean geometry established the metric rules of flat continuous space, Riemannian geometry generalized the curvature structure of curved continuous manifolds, and fiber bundle geometry characterized gauge field structures through continuous base manifolds and smooth connections. This continuous analytic system is highly self-consistent and fruitful, and constitutes the main body of geometric language in modern mathematics and physics.
Continuous geometry relies on preconditions such as smoothness, differentiability, and continuity, and has boundaries of applicability when describing discrete structures, non-smooth topology, and lattice order systems.
Based on a re-examination of the logic of geometric construction, this paper discusses the following perspective: the constructive logic of geometry can be understood as the ordered combination of finite simple units; continuity is a limit representation after combinatorial order becomes highly densified.
Accordingly, this paper discusses several basic settings of Discrete Order Geometry (DOG):
Taking discrete primitives as the basic carrier of space and permutation-combination order as the construction law, and discussing its compatibility with classical continuous geometric structures.
The idea of generating geometric structures through the combination of discrete units already has mature research in directions such as combinatorial topology, simplicial complexes, CW complexes, and discrete differential geometry. The work of this paper is not to propose this idea, but to discuss one mode of expression under the DOG framework, and to clarify its relationship with existing theories.
---
2 The Constructive Perspective of DOG: Complex Configurations Are Generated by the Ordered Combination of Simple Units
Under the DOG framework, this paper discusses the following constructive principles:
Several complex geometric configurations can be generated level by level from basic geometric units through fixed order, adjacency rules, and combinatorial arrangement.
This paper discusses three types of primordial primitives as candidate minimal units for geometric construction:
1. Point primitive: spatial position and topological node;
2. Link primitive: adjacency, association, and transmission relations among nodes;
3. Cell primitive: closed structures forming two-dimensional, three-dimensional, and higher-dimensional units.
Several surfaces, closed structures, multiply connected topologies, and higher-dimensional forms can be understood as macroscopic geometric forms formed by ordered stacking, oriented combination, and hierarchical nesting of primitives.
The relation of this perspective to traditional continuous geometry is:
· Traditional geometry: starts from macroscopic continuous representation, using differentiation, metrics, and manifolds to describe spatial properties;
· DOG: starts from microscopic discrete construction, using combinatorial order to discuss how space is generated and formed.
The idea of taking points, lines, surfaces, and cells as basic construction units has formal similarities with existing theories such as simplicial complexes and CW complexes. The focus of DOG's discussion lies in the expression of hierarchical order and combinatorial rules, rather than the primitives themselves.
---
3 The Order Perspective of DOG: Correspondence Between Geometric Structure and Combinatorial Order
The core discussion of DOG can be summarized as: there is a correspondence between geometric order and combinatorial order.
Several DOG spatial structures can correspond to the following combinatorial logic:
1. Lattice arrangement ↔ positional permutation
The density, distribution, symmetry, and array structure of spatial nodes can be understood as the arrangement of basic units in dimensional space.
2. Unit adjacency relations ↔ combinatorial pairing
The connection modes between nodes and links, cells and cells, connected topology, and boundary structures can be understood as combinatorial pairing rules of multiple units.
3. Dimensional extension and topological configuration ↔ ordered combination rules
Low-dimensional primitives extend, nest, and close loops through fixed combinatorial order, and can form higher-dimensional topological structures and closed geometric forms.
4. Spatial deformation and structural evolution ↔ primitive rearrangement
Changes in geometric form, distortion of structure, and evolution of field form can be realized by reorganization and rearrangement of discrete units, not necessarily relying on continuous differential deformation.
Accordingly, this paper discusses the following proposition:
The properties of several DOG geometric spaces can be understood as macroscopic manifestations of underlying combinatorial rules.
---
4 Three-Layer Architecture: The Combinatorial Hierarchy of DOG
This paper discusses a three-layer geometric generation system as a framework description of DOG:
4.1 Basic Unit Layer
Taking regular simple geometric units as candidate primitive components, constituting the basic layer of the geometric system.
4.2 Combinatorial Rule Layer
Using order rules such as permutation, combination, adjacency, nesting, stacking, and closed loops to define the coupling modes of units and the logic of spatial construction.
This layer is the core operational layer discussed in DOG, attempting to supplement differentiation with combinatorial rules as a construction language.
4.3 Macroscopic Geometric Layer
The underlying combinatorial rules generate macroscopic properties such as spatial metrics, topological connectivity, curvature structure, field distribution forms, and dimensional structure.
Traditional Euclidean geometry, Riemannian geometry, manifold geometry, and fiber bundle geometry may be regarded as continuous smooth subsets of the macroscopic geometric layer.
---
5 Compatibility Relations Between DOG and Traditional Geometric Systems
This paper discusses the following compatibility positioning for existing mainstream geometric systems:
5.1 Euclidean Geometry and Riemannian Geometry
Continuous differential geometric systems may correspond to the continuous limit form of DOG under conditions where space is sufficiently smooth and primitives are arranged sufficiently densely.
Differential operations, curvature integrals, and metric tensors may be understood as equivalent calculational tools of discrete combinatorial order under densification conditions.
5.2 Fiber Bundle Geometry and Gauge Field Geometry
The base manifold, fiber structure, connection parallel transport, and curvature field strength of fiber bundles may find discrete corresponding structures within the DOG framework:
· Base manifold corresponds to a discrete lattice base network;
· Fiber field quantities correspond to algebraic structures carried by nodes;
· Connection corresponds to ordered transmission combinations between links;
· Curvature corresponds to the deviation order of local cell combination closed loops.
5.3 The Framework Value of DOG
Traditional geometry is good at describing already-formed continuous space;
DOG attempts to discuss how space is constructed, how topology is generated, and how structure originates.
The two have different research levels and different foundational perspectives, and can be discussed in parallel.
---
6 Framework Definition of DOG Discrete Order Geometry
This paper gives the following definition of DOG:
Discrete Order Geometry (DOG) is a geometric framework that takes discrete primitives and combinatorial order as its underlying construction assumptions. It discusses how the ordered aggregation, nesting, and rearrangement of finite simple units generate spatial topology and geometric form; continuous smooth manifold geometry may be regarded as the limit case of the DOG framework under dense combinatorial order. The relationship between DOG and classical differential geometry and fiber bundle geometry is one of the focuses of this paper.
---
7 Relations with Existing Theories
DOG has formal similarities with the following existing directions; this paper provides a preliminary explanation of their relations:
Existing Direction Relation to DOG
Simplicial complex Similar idea of primitive combination; DOG focuses on hierarchical order expression
CW complex Similar idea of cell gluing; DOG focuses on the combinatorial rule layer
Combinatorial topology Combinatorics describes topology; DOG attempts to connect geometric construction
Discrete differential geometry Discrete curvature and connections; DOG discusses their combinatorial pre-structure
Finite element method Discrete units approximate continua; DOG discusses the construction perspective
---
8 Conclusion and Outlook
This paper discusses the combinatorial axiomatic basis of DOG Discrete Order Geometry, taking permutation and combination as an underlying discussion perspective for geometric construction.
DOG maintains a compatible attitude toward traditional geometric systems, attempting to understand continuous differential geometry, manifold topology, and fiber bundle geometry as smooth limit branches of discrete combinatorial geometry.
In the future, within this framework, further discussion can be conducted on discrete dimension theory, discrete curvature systems, discrete connection constructions, and other directions, providing a possible geometric language for non-smooth spaces and discrete topological systems.
References
Omitted