Francesco Pavese

Orcid: 0000-0002-8763-5329

According to our database1, Francesco Pavese authored at least 47 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the geometry of a (<i>q</i> + 1)-arc of PG(3,<i>q</i>), <i>q</i> even.
Discret. Math., December, 2023

On near-MDS codes and caps.
Des. Codes Cryptogr., March, 2023

On the geometry of the Hermitian Veronese curve and its quasi-Hermitian surfaces.
Discret. Math., 2023

On 4-general sets in finite projective spaces.
CoRR, 2023

Combining subspace codes.
Adv. Math. Commun., 2023

2022
On symmetric and Hermitian rank distance codes.
J. Comb. Theory, Ser. A, 2022

The <i>m</i>-ovoids of W(5, 2) and their generalizations.
Finite Fields Their Appl., 2022

On regular systems of finite classical polar spaces.
Eur. J. Comb., 2022

A clique-free pseudorandom subgraph of the pseudo polarity graph.
Discret. Math., 2022

Orbit codes from forms on vector spaces over a finite field.
Adv. Math. Commun., 2022

2021
Graphs cospectral with NU(<i>n</i> + 1, <i>q</i><sup>2</sup>), <i>n</i> ≠ 3.
Discret. Math., 2021

2020
On the $\mathrm{PSU}(4, 2)$-Invariant Vertex-Transitive Strongly Regular (216, 40, 4, 8) Graph.
Graphs Comb., 2020

On multiple blocking sets and blocking semiovals in finite non-Desarguesian planes.
Finite Fields Their Appl., 2020

On non-singular Hermitian varieties of PG(4, q2).
Discret. Math., 2020

On cutting blocking sets and their codes.
CoRR, 2020

On q-Covering Designs.
Electron. J. Comb., 2020

2019
On the independence number of graphs related to a polarity.
J. Graph Theory, 2019

Cameron-Liebler line classes of PG(3, <i>q</i>) admitting PGL(2, <i>q</i>).
J. Comb. Theory, Ser. A, 2019

Relative m-ovoids of elliptic quadrics.
Discret. Math., 2019

The covering radius of PGL(3, q).
Discret. Math., 2019

On line covers of finite projective and polar spaces.
Des. Codes Cryptogr., 2019

Subspace code constructions.
CoRR, 2019

Optimal subspace codes in $ {{\rm{PG}}}(4, q) $.
Adv. Math. Commun., 2019

2018
Blocking semiovals in PG(2, <i>q</i><sup>2</sup>), <i>q</i> odd, admitting PGL(2, <i>q</i>) as an automorphism group.
Finite Fields Their Appl., 2018

Triangle-free induced subgraphs of the unitary polarity graph.
Eur. J. Comb., 2018

Ovoids of H(3, q2), q odd, admitting a group of order (q+1)32.
Discret. Math., 2018

On intriguing sets of finite symplectic spaces.
Des. Codes Cryptogr., 2018

Optimal subspace codes in PG(4, q).
CoRR, 2018

2017
On maximal cliques of polar graphs.
Finite Fields Their Appl., 2017

Strongly regular graphs from classical generalized quadrangles.
Des. Codes Cryptogr., 2017

Maximal Partial Spreads of Polar Spaces.
Electron. J. Comb., 2017

Subspace Codes in PG(2N - 1, Q).
Comb., 2017

2016
Hemisystems of Q(6, q), q odd.
J. Comb. Theory, Ser. A, 2016

Veronese subspace codes.
Des. Codes Cryptogr., 2016

On subspace codes.
Des. Codes Cryptogr., 2016

Non-linear maximum rank distance codes.
Des. Codes Cryptogr., 2016

A note on equidistant subspace codes.
Discret. Appl. Math., 2016

2015
On the geometry of unitary involutions.
Finite Fields Their Appl., 2015

Geometric constructions of two-character sets.
Discret. Math., 2015

Blocking sets of Hermitian generalized quadrangles.
Discret. Math., 2015

Sets of even type on H(5, q<sup>2</sup>), q even.
Discret. Appl. Math., 2015

2014
Intriguing sets of W(5, q), q even.
J. Comb. Theory, Ser. A, 2014

On (0, α)-sets of generalized quadrangles.
Finite Fields Their Appl., 2014

Hyperoval constructions on the Hermitian surface.
Finite Fields Their Appl., 2014

New infinite families of hyperovals on $$\mathcal H (3, q^2), q$$ H ( 3 , q 2 ) , q odd.
Des. Codes Cryptogr., 2014

2013
New infinite families of hyperovals on H(3, q<sup>2</sup>), q odd.
Electron. Notes Discret. Math., 2013

Hyperovals on <i>H</i>(3, <i>q</i><sup>2</sup>)H(3, q2) left invariant by a group of order 6(<i>q</i>+1)<sup>3</sup>6(q+1)3.
Discret. Math., 2013


  Loading...