activity
20152026
most citedMerging Combinatorial Design and Optimization: the Oberwolfach Problem

7 citations · 26 across the 20 of their papers we have counts for

collaborators

25 papers

math.CO2026

A note on near alternating sign matrices with prescribed row and column weights

Tommaso Traetta

We study near alternating sign matrices with prescribed row and column weights. After recalling the basic definitions and the necessary conditions coming from the Gale--Ryser theor…

math.CO2026

Characterizing pyramidal Hadamard designs with the largest number of fixed points

Tommaso Traetta

A symmetric -design is said to be -pyramidal, with , under the action of a group if acts as an automorphism group fixing points and acting sharply tr…

math.CO2025

On circular external difference families

A. Burgess, F. Merola, T. Traetta

Circular external difference families (CEDFs) are a recently-introduced variation of external difference families (EDFs) with applications to non-malleable threshold schemes: a $(v…

math.CO2025★ 1 cited

The existence of pyramidal Steiner triple systems over abelian groups

Yanxun Chang, Tommaso Traetta, Junling Zhou

A Steiner triple system STS is called -pyramidal if it has an automorphism group fixing points and acting sharply transitively on the remaining points. In this pa…

math.CO2024

Towards a solution of Archdeacon's conjecture on integer Heffter arrays

Marco Antonio Pellegrini, Tommaso Traetta

In this paper, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays whenever the necessary conditions hol…

math.CO2024★ 1 cited

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

M. Abreu, J. B. Gauci, D. Mattiolo +4

A proper total colouring of a graph is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…