DeepAI AI Chat
Log In Sign Up

Clubs and their applications

by   Vito Napolitano, et al.
Università degli Studi della Campania "Luigi Vanvitelli"

Clubs of rank k are well-celebrated objects in finite geometries introduced by Fancsali and Sziklai in 2006. After the connection with a special type of arcs known as KM-arcs, they renewed their interest. This paper aims to study clubs of rank n in PG(1,q^n). We provide a classification result for (n-2)-clubs of rank n, we analyze the Γ L(2,q^n)-equivalence of the known subspaces defining clubs, for some of them the problem is then translated in determining whether or not certain scattered spaces are equivalent. Then we find a polynomial description of the known families of clubs via some linearized polynomials. Then we apply our results to the theory of blocking sets, KM-arcs, polynomials and rank metric codes, obtaining new constructions and classification results.


page 1

page 2

page 3

page 4


Extending two families of maximum rank distance codes

In this paper we provide a large family of rank-metric codes, which cont...

Linear maximum rank distance codes of exceptional type

Scattered polynomials of a given index over finite fields are intriguing...

Higher-degree symmetric rank-metric codes

Over fields of characteristic unequal to 2, we can identify symmetric ma...

New MRD codes from linear cutting blocking sets

Minimal rank-metric codes or, equivalently, linear cutting blocking sets...

Maximum Sum-Rank Distance Codes over Finite Chain Rings

In this work, maximum sum-rank distance (MSRD) codes and linearized Reed...

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory

Polynomial functors are a categorical generalization of the usual notion...

A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications

Several more and more efficient component–by–component (CBC) constructio...