Contributed and main talks

Book of abstracts

The book of abstracts for the conference is available here.

List of talks

• Herivelto Borges The \(p\)-rank of curves of Fermat type
• Bence Csajbók Functions over finite fields and their applications
• Nicola Durante \(\sigma\)-geometries of finite projective spaces
• Michel Lavrauw Tensors in Finite Geometry
• Patric R. J. Östergård Generating Uniformly Distributed Random Steiner Triple Systems
• Tomaž Pisanski On certain compositions and decompositions of configurations
• Violet R. Syrotiuk Combinatorial Requirements for Large Scale Experimentation
• Ian M. Wanless Perfect \(1\)-factorisations and hamiltonian Latin squares
• Marién Abreu Papillon graphs: perfect matchings, Hamiltonian cycles and edge-colourings in cubic graphs
• Sam Adriaensen Stability of EKR Theorems in Circle Geometries
• Angela Aguglia On certain quasi-Hermitian varieties and related questions
• Gianira N. Alfarano \(q\)-Matroids and rank-metric codes
• Yves P. Aubry Polynomials with maximal differential uniformity and the exceptional APN conjecture
• Robert F. Bailey On strongly regular graphs with 136 vertices
• Simeon Ball The geometry of certain error-correcting codes
• Francesco Belardo On graphs whose spectral radius does not exceed \(3/\sqrt {2}\)
• Elena Berardini On the number of rational points of curves over a surface in \(\mathbb {P}^3\)
• Anurag Bishnoi The minimum degree of minimal Ramsey graphs for cliques
• Paola Bonacini Edge balanced star-hypergraph designs and vertex colorings of path designs
• Matteo Bonini Saturating systems in the rank metric
• Martino Borello Small strong blocking sets by concatenation
• Arne Botteldoorn Minimal blocking sets in small Desarguesian projective planes
• Maurizio Brunetti Toward a solution of the Hoffmann Program for signed graphs
• Marco Buratti A Spot for Strong Difference Families
• Lorenzo Campioni Maximal Unrefinable Partitions into Distinct Parts
• Stefano Capparelli Combinatorial identities of the Rogers-Ramanujan type
• Chiara Cappello Frustration-critical signed graphs
• Matteo Cavaleri A spectral theory for gain graphs
• Paolo Cavicchioli An algorithmic method to compute plat-like Markov moves for genus two \(3\)-manifolds
• Giulia Cavicchioni Linear equations for the weight distribution of codes over finite chain rings
• Michela Ceria Near--MDS codes and caps
• Nancy E. Clarke Achromatic Dominating Sets
• Charles J. Colbourn Egalitarian Popularity Labellings for Steiner Systems
• Simone Costa On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
• Paola Cristofori From Kirby diagrams to edge-colored graphs representing \(PL 4\)-manifolds
• James A Davis Partial difference sets in nonabelian groups
• Jan De Beule An Erd\H {o}s-Ko-Rado problem on flags of finite spherical buildings
• Maarten De Boeck The weight distributions of linear sets in \(\mathrm {PG}(1,q^5)\)
• Stefano Della Fiore On Sequences in Cyclic Groups with Distinct Partial Sums
• Lins Denaux Higgledy-piggledy sets in projective spaces
• Anneleen De Schepper The Segre variety \(\mathcal {S}_{2,2}(\mathbb {K})\) in a geometry of type \(\mathsf {E}_{6,1}(\mathbb {K})\)
• Jozefien D'haeseleer New examples of Cameron-Liebler sets in hyperbolic quadrics
• Alena Ernst Intersecting theorems for finite general linear groups
• Giovanni Falcone Permutations of zero-sum \(k\)-sets
• Margherita Maria Ferrari Homology of directed graphs with application to DNA recombination
• Dalibor Froncek \(\Gamma\)-supermagic labelings of \(C_m\Box C_n\)
• Mario Galici Steiner loops of affine and projective type
• Alejandro J. Giangreco Maidana Weil polynomials of abelian varieties over finite fields with many rational points
• Jan Goedgebeur Graphs with few hamiltonian cycles
• Giovanni G. Grimaldi Absolute points of correlations of \({\mathrm{PG}}(5,q^n)\)
• Harald Gropp Il mantovano Vittorio Martinetti (1859-1936) and the future of configurations
• Tamás Héger Minimal codes, strong blocking sets and higgledy-piggledy lines
• Annamaria Iezzi Finding cycles in supersingular isogeny graphs
• Paulien Jansen Substructures in long root geometries
• Dibyayoti Dhananjay Jena Linear sets without points of weight one
• Laura M Johnson Internal and External Partial Difference Families
• Suliman Khan The line graph of Lollipop and Pan graphs
• György Kiss Girth-(bi)regular graphs and finite geometries
• Annachiara Korchmaros Best match graphs and generalizations
• Gábor Korchmáros \((k,n)\)-arcs and algebraic curves
• Vedran KrčadinacPolarity transformations of semipartial geometries
• Mariusz Kwiatkowski The graph of \(4\)-ary simplex codes of dimension \(2\)
• Ivan N. Landjev Binary Non-linear Codes with Two Distances
• Stefano Lia Quasi-Hermitian varieties in \(PG(3,q^2)\)
• Giovanni Longobardi \( (d,{\mathbf{\sigma}})\)-Veronese variety and (almost) MDS codes
• Magdalena Łysakowska On the structure of cube tilings
• Edita Máčajová Berge's conjecture for cubic graphs with small colouring defect
• Jonathan Mannaert A modular equality for Cameron-Liebler line classes in \(PG(n,q)\), \(n\geq 7\) odd
• Giuseppe Marino New MRD codes from linear cutting blocking sets
• Lucia Marino On Voloshin colorings in \(3\)-hypergraph designs
• Sam Mattheus The cylinder conjecture and divisible codes
• Davide Mattiolo Highly edge-connected \(r\)-regular graphs without \(r-2\) pairwise disjoint perfect matchings
• Lorenzo Mella On the existence of globally simple relative non-zero sum Heffter arrays
• Francesca Merola On anti-Novák cycle systems
• Alessandro Montinaro Flag-transitive, point-imprimitive symmetric \(2\)-designs
• Giusy Monzillo Characterization of association schemes arising from finite geometry
• Emanuele Munarini Carlitz-like identities
• Gábor P. Nagy Simplicity conditions for binary orthogonal arrays
• Anamari Nakić Looking for additive Steiner \(2\)-designs
• Vito Napolitano On some linear sets in finite projective spaces and the associated codes
• Mohamad Nazri Husin Comparison between the eccentric connectivity index and first Zagreb index of graph
• Alessandro Neri Strong blocking sets and minimal codes from graphs
• Marko Orel Complementary prisms: their cores, automorphism groups, isoperimetric numbers, hamiltonian properties, etc.
• Silvia M.C. Pagani Ghosts arising from polynomials
• Vincenzo Pallozzi Lavorante New result on permutation binomials
• Daniel Panario Comparing balanced \({\mathbb Z_v}\)-sequences obtained from ElGamal function to random balanced sequences
• Mark Pankov The graph of non-degenerate linear codes
• Anita Pasotti On non-zero sum Heffter arrays
• Stefano Pasotti Clifford-like parallelisms and their automorphisms
• Francesco Pavese On \(m\)-ovoids of elliptic quadrics
• Marco Pavone Small configurations and some structure theorems for Steiner triple systems
• Valentina Pepe Linear sets with points of weight larger than 1
• Krzysztof Petelczyc Automorphisms of generalized Grassmann graphs
• Olga Polverino Minimum size linear sets and critical pairs
• Jonad Pulaj 4-sets in Union-Closed Families
• Tahseen Rabbani \(49,487,367,289\): On enumeration and computational construction of groups of order 1024
• Jozef Rajník Decomposition of cubic graphs with cyclic connectivity \(6\) and beyond
• Assia P. Rousseva Ternary Linear Codes and Blocking Sets in \(\mathrm {PG}(5,3)\)
• János Ruff Edge-transitive Nest graphs of twice odd order
• Paolo Santonastaso On subspace designs
• Kai-Uwe Schmidt Designs in finite general linear groups
• John Sheekey Cyclic Line Spreads and Linear Spaces
• Martin Škoviera Snarks with resistance \(n\) and flow resistance \(2n\)
• Valentino Smaldore Partial ovoids of symplectic and Hermitian polar spaces, large cocliques in the collinearity graph and applications
• Klara Stokes Rigidity and flexibility of rod configurations
• Kristijan Tabak Hamiltonian graphs in Abelian \(2\)-groups
• Gloria Tabarelli H-colorings in cubic and \(r\)-regular graphs
• Marco Timpanella A generalization of Bring's curve in any characteristic
• Tommaso Traetta Infinite graph factorizations
• Ivona Traunkar Weakly \(p\)-self-orthogonal designs and LCD codes
• Rocco Trombetti A large family of maximum scattered linear sets of \(\mathrm{PG}(1,q^n)\) and their associated MRD codes
• Heidi Van den Camp The Effect of Symmetry-preserving Operations on the \(3\)-Connectedness of Embedded Graphs
• Steven Van Overberghe Isomorphism-free enumeration of polycyclic hydrocarbons using blueprint generation
• Renata Vlahović Kruc Schematic \(4\)-designs
• Alfred Wassermann Designs in polar spaces
• Violetta Weger Density of free codes over finite chain rings
• Charlene Weiß Packings and Steiner systems in polar spaces
• Carol T. Zamfirescu Hamiltonian cycles and 1-factors in 5-regular graphs
• Jean Paul Zerafa Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
• Ferdinando Zullo Linear sets defined by few points
• Mariusz Żynel Ortho-Grassmann graphs of finite-rank self-adjoint operators