activity
20212026
most citedThe maximum cardinality of trifferent codes with lengths 5 and 6

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

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2026

New bounds for (weak) sequenceability in

Simone Costa, Stefano Della Fiore

A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Although this conjecture was r…

math.CO2025

Graham's rearrangement for a class of semidirect products

Simone Costa, Stefano Della Fiore, Eva R. Engel

A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that…

math.CO2022

Existence of -Fold Non-zero sum Heffter arrays through local considerations

Simone Costa, Stefano Della Fiore

In [12] was introduced, for cyclic groups, the class of partially filled arrays of the non-zero sum Heffter array that are, as the Heffter arrays, related to difference families, g…

math.CO2022

On Sequences in Cyclic Groups with Distinct Partial Sums

Simone Costa, Stefano Della Fiore, M. A. Ollis +1

A subset of an abelian group is {\em sequenceable} if there is an ordering of its elements such that the partial sums , given by $y_0…

math.CO2022★ 7 cited

The maximum cardinality of trifferent codes with lengths 5 and 6

Stefano Della Fiore, Alessandro Gnutti, Sven Polak

A code is said to be trifferent with length when for any three distinct elements of there exists a coordinate in which they…

math.CO2021

A note on -separable codes and codes

Stefano Della Fiore, Marco Dalai

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of -ary -separable codes that improves recent results…