The Radon transforms of a combinatorial geometry, I

DOI10.1016/0097-3165(79)90059-1zbMath0406.05023OpenAlexW2053311956MaRDI QIDQ1257485

Joseph P. S. Kung

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90059-1

zbMATH Keywords

Combinatorial GeometryFinite Radon TransformGeometric LatticeMaximal Chain TheoremPoint-Copoint Incidence MatrixSimple Matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (13)

Transitivity on sets of independent points in geometric lattices ⋮ A projection pursuit method on the multidimensional squared contingency table ⋮ Order-matchings in the partition lattice ⋮ A Spectral Analysis Approach for Experimental Designs ⋮ The admissibility theorem for the hyperplane transform over a finite field ⋮ Dimensional linear spaces whose automorphism group is (line, hyperplane)- flag transitive ⋮ The combinatorial Radon transform modulo the symmetric group ⋮ On the incidence maps of incidence structures ⋮ Invertibility of the base Radon transform of a matroid ⋮ Matchings and Radon transforms in lattices II. Concordant sets ⋮ Intertwining automorphisms in finite incidence structures ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Matchings and Radon transforms in lattices. I: Consistent lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Whitney Number Inequalities for Geometric Lattices
• A rank inequality for finite geometric lattices
• Maximal Families of Pairwise Disjoint Maximal Proper Chains in a Geometric Lattice

This page was built for publication: The Radon transforms of a combinatorial geometry, I