Stefano Della Fiore

activity

20202026

most citedAchievable Rates and Algorithms for Group Testing with Runlength Constraints

1 citations · 1 across the 15 of their papers we have counts for

collaborators

16 papers

math.CO2026

A bandwidth refinement of the Erdős distinct subset sums bound

Simone Costa, Stefano Della Fiore

Let $f (n)$ be the least possible largest element of an $n$ -element set of positive integers with pairwise distinct subset sums. Dubroff, Fox and Xu proved the finite lower bound \[…

math.CO2026

Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture

Simone Costa, Stefano Della Fiore, Tao Feng +1

We establish a Kneser-based anticoncentration estimate for uniform subset sums in composite cyclic groups. The estimate contains a periodic loss and is weaker than its prime-modulu…

cs.DM2026

A note on vector trifferent codes over the Sphere

Stefano Della Fiore

Let $S^{2} \subset R^{3}$ be the unit sphere. A set $C \subset (S^{2})^{n}$ is called vector trifferent if for every three distinct $x, y, z \in C$ there is a coordinate $i$ for which $…

math.CO2026

Slice and Partition Rank Criteria for Polynomial Zero-Avoidance

Simone Costa, Stefano Della Fiore, Mattia Fontana

We study polynomial zero-avoidance over finite vector spaces by means of slice rank and partition rank. We first make the support-entropy method effective by showing how a finite d…

math.CO2024

Weak Freiman isomorphisms and sequencings of small sets

Simone Costa, Stefano Della Fiore

In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cycl…

math.CO2024

Variants of the Erdős distinct sums problem and variance method

Simone Costa, Stefano Della Fiore, Andrea Ferraguti

Let $Σ = {a_{1}, \dots, a_{n}}$ be a set of positive integers with $a_{1} < \dots < a_{n}$ such that all $2^{n}$ subset sums are pairwise distinct. A famous conjecture of Erdős states tha…

cs.IT2024

Upper bounds on the rate of linear $q$ -ary $k$ -hash codes

Stefano Della Fiore, Marco Dalai

This paper presents new upper bounds on the rate of linear $k$ -hash codes in $F_{q}^{n}$ , $q \geq k$ , that is, codes with the property that any $k$ distinct codewords are all s…

eess.IV2024

LiDAR Depth Map Guided Image Compression Model

Alessandro Gnutti, Stefano Della Fiore, Mattia Savardi +3

The incorporation of LiDAR technology into some high-end smartphones has unlocked numerous possibilities across various applications, including photography, image restoration, augm…

math.CO2023

Alternating Parity Weak Sequencing

Simone Costa, Stefano Della Fiore

A subset $S$ of a group $(G, +)$ is $t$ -weakly sequenceable if there is an ordering $(y_{1}, \dots, y_{k})$ of its elements such that the partial sums~ $s_{0}, s_{1}, \dots, s_{k}$ , given by…

cs.IT2023

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Marco Dalai, Stefano Della Fiore, Adele A. Rescigno +1

In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A $q$ -ary $(k, n)$ -frameproof code of l…

math.CO2023

Sequencings in Semidirect Products via the Polynomial Method

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

The partial sums of a sequence $x = x_{1}, x_{2}, \dots, x_{k}$ of distinct non-identity elements of a group $(G, \cdot)$ are $s_{0} = i d_{G}$ and $s_{j} = \prod_{i = 1}^{j} x_{i}$ for $0…

math.CO2022

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $F_{q}^{n}$

Simone Costa, Stefano Della Fiore

The classical Erdős-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $ℓ$ such that any sequence $S$ of length at least $ℓ$ contains a zero-sum subse…

cs.IT2022★ 1 cited

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Stefano Della Fiore, Marco Dalai, Ugo Vaccaro

In this paper, we study bounds on the minimum length of $(k, n, d)$ -superimposed codes introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with…

math.CO2021

Non-zero sum Heffter arrays and their applications

Simone Costa, Stefano Della Fiore, Anita Pasotti

In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum…

math.CO2021

Variations on the Erdős distinct-sums problem

Simone Costa, Marco Dalai, Stefano Della Fiore

Let ${a_{1}, ..., a_{n}}$ be a set of positive integers with $a_{1} < \dots < a_{n}$ such that all $2^{n}$ subset sums are distinct. A famous conjecture by Erdős states that $a_n>c\cdot…

math.CO2020

Improved Bounds for $(b, k)$ -hashing

Stefano Della Fiore, Simone Costa, Marco Dalai

For fixed integers $b \geq k$ , a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with $n$ , of the largest set for wh…

A bandwidth refinement of the Erdős distinct subset sums bound

Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture

A note on vector trifferent codes over the Sphere

Slice and Partition Rank Criteria for Polynomial Zero-Avoidance

Weak Freiman isomorphisms and sequencings of small sets

Variants of the Erdős distinct sums problem and variance method

Upper bounds on the rate of linear q-ary k-hash codes

LiDAR Depth Map Guided Image Compression Model

Alternating Parity Weak Sequencing

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

Sequencings in Semidirect Products via the Polynomial Method

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over Fqn​

Achievable Rates and Algorithms for Group Testing with Runlength Constraints

Non-zero sum Heffter arrays and their applications

Variations on the Erdős distinct-sums problem

Improved Bounds for (b,k)-hashing

Upper bounds on the rate of linear $q$ -ary $k$ -hash codes

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $F_{q}^{n}$

Improved Bounds for $(b, k)$ -hashing