A combinatorial object consisting of two (or more) classes of elements, typically called points and blocks, together with an incidence relation I ⊆ P × B that records which points lie on which blocks; equivalently described by a bipartite graph or incidence matrix.

Principle

Incidence is an abstract relation, not geometric embedding: the structure is determined by the set-theoretic incidence pairs and any axioms imposed (regularity, balance, block sizes), enabling combinatorial counting and symmetry analysis.

Demonstration

Standard examples include finite projective planes (where any two points determine a unique block and vice versa), balanced block designs such as (v,k,λ)-designs, and configurations specified by incidence matrices or bipartite adjacency relations.

Misapplication

Treating incidence structures as if they carried metric notions or assuming geometric realizability without proof; confusing hypergraphs with block designs when multiplicities or order matter can lead to incorrect combinatorial conclusions.

Consequence

Proper use gives access to counting identities, duality (points↔blocks), automorphism groups, spectral properties of incidence matrices, and constructions used in coding theory, finite geometry, and combinatorial designs.

Reversal

The dual incidence structure swaps the roles of points and blocks; a non-incidence viewpoint focuses instead on embedding or metric relations which ignore the abstract combinatorial incidence data.

Boundary

Applies to abstract finite or infinite incidence relations; excludes implicit assumptions of Euclidean realizability, continuous geometric incidence (e.g., point-line incidence in topological senses) unless such structure is supplied.

Semantic Tension

Tension exists between incidence structures, hypergraphs, block designs and geometric configurations: they overlap but differ in allowed multiplicities, ordering, axiomatic constraints, and whether embedding in a geometric space is part of the definition.

Synthesis

An incidence structure is the abstract record of which elements meet which blocks — a relation-based combinatorial object equivalently represented by an incidence matrix or bipartite graph, foundational for finite geometry and design theory.