Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices

DOI10.1137/20M1382635WikidataQ114074125 ScholiaQ114074125MaRDI QIDQ5073709

Alberto Ravagnani

Publication date: 3 May 2022

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.10249

zbMATH Keywords

combinatorial geometrycoding theoryWhitney numberhigher-weight dowling lattice

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Asymptotic enumeration (05A16) Semimodular lattices, geometric lattices (06C10)

Related Items

Common Complements of Linear Subspaces and the Sparseness of MRD Codes, Rank-Metric Codes, Semifields, and the Average Critical Problem, Rank-metric lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring the characteristic polynomial of a lattice
• Modular elements of higher-weight Dowling lattices
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Automorphism groups of higher-weight Dowling geometries
• Generalized exponents of a free arrangement of hyperplanes and Shepherd- Todd-Brieskorn formula
• Several identities for the characteristic polynomial of a combinatorial geometry
• Signed graph coloring
• Möbius functions of lattices
• Subspace arrangements over finite fields: Cohomological and enumerative aspects
• Characteristic and Ehrhart polynomials
• The packing problem for projective geometries over GF(3) with dimension greater than five
• Möbius inversion in lattices
• Modular elements of geometric lattices
• A class of geometric lattices based on finite groups
• Supersolvable lattices
• Characteristic polynomials of subspace arrangements and finite fields
• Extensions of the critical theorem
• Some Remarks on the Critical Problem
• Modular Constructions for Combinatorial Geometries
• Weight Enumeration and the Geometry of Linear Codes
• Why the characteristic polynomial factors
• Code Enumerators and Tutte Polynomials
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Maximum distance<tex>q</tex>-nary codes