G. P. Nagy

activity

20232026

collaborators

3 papers

math.GR2026

Enumeration of Nilpotent Loops by Orbit Counting

Fariha Iftikhar, Gábor P. Nagy

We study central extensions of nilpotent loops by elementary abelian $p$ -groups using normalized cocycles. By introducing an affine automorphism group acting on the full cocycle sp…

math.AG2025

Evaluation codes arising from symmetric polynomials

Barbara Gatti, Gábor Korchmáros, Gábor P. Nagy +2

Datta and Johnsen (Des. Codes and Cryptogr., {\bf{91}} (2023), 747-761) introduced a new family of evalutation codes in an affine space of dimension $\geq 2$ over a finite field $\m…

math.CO2023

Algebraic approach to the completeness problem for $(k, n)$ -arcs in planes over finite fields

Gábor Korchmáros, Gábor Péter Nagy, Tamás Szőnyi

In a projective plane over a finite field, complete $(k, n)$ -arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory…

Enumeration of Nilpotent Loops by Orbit Counting

Evaluation codes arising from symmetric polynomials

Algebraic approach to the completeness problem for (k,n)-arcs in planes over finite fields

Algebraic approach to the completeness problem for $(k, n)$ -arcs in planes over finite fields