SearcharxivSearch

arXiv subjects

Stefano Della Fiore

Publications and source records attributed to Stefano Della Fiore.

At least 19 recordsLinked to original sources

Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture

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-modulus counterpart. Nevertheless, together with known small- and large-set results, it proves that, for every fixed $t\geq2$ such that $\mathbb{Z}_t$ is strongly sequenceable and every sufficiently large prime $p$, every subset of $\mathbb{Z}_{tp}\setminus\{0\}$ has a valid ordering, thus establishing the analogue of Graham's rearrangement conjecture for this family of composite cyclic groups. We then identify the structural source of this loss. An inverse theorem shows that failure of the stabilizer-free growth underlying prime-type anticoncentration forces almost all of the set into a proper subgroup or one of its cosets. We exploit this structure by reverse absorption. Iterating the resulting dichotomy between non-periodic anticoncentration and structured concentration proves that every subset of \[ \mathbb{Z}_k\setminus\{0\}, \qquad k=\prod_{i=1}^{s}p_i^{e_i}, \qquad \sum_{i=1}^{s}e_i\leq L, \qquad p_1<\cdots<p_s\leq\gamma p_1, \] admits a valid ordering whenever $L$ and $\gamma$ are fixed and the primes $p_i$ are sufficiently large.

math.CO

A note on vector trifferent codes over the Sphere

Let $S^2\subset \mathbb 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 $x_i,y_i,z_i$ are mutually orthogonal. Bhandari and Khetan recently introduced this vectorial analogue of trifferent codes and proved the upper bound $|C|\le (\sqrt 2+o(1))(3/2)^n$. We improve the bound to: \[ |C|\le (1+o(1))\left(\frac32\right)^n . \] The new ingredient in the proof is a local packing inequality obtained by two-coloring, around each codeword, the circles of vectors orthogonal to the corresponding coordinates. This replaces a global tensor-space bound by a centered estimate and gives exactly the missing factor in the leading constant.

cs.DM

Slice and Partition Rank Criteria for Polynomial Zero-Avoidance

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 dual certificate yields an explicit entropy gap whenever the coefficient support admits no probability distribution with uniform marginals. For the quadratic elementary symmetric polynomial over fields of characteristic three, the ternary structure of the coefficient support gives a certificate with optimal normalized margin and a uniform analytic bound for the corresponding higher-degree Erd\H{o}s--Ginzburg--Ziv constant, avoiding a separate optimization for each field. We then use partition rank to handle solutions in pairwise distinct variables. Equality profiles are encoded by contracted local tensors, reducing the global problem to finitely many slice-rank estimates. Applying this reduction on the multiplicative torus gives restricted-alphabet zero-sum bounds with exponential base below the alphabet size. Coordinatewise inversion and support stratification then yield, to the best of our knowledge, the first nontrivial exponential bound for the higher-degree Erd\H{o}s--Ginzburg--Ziv problem over $\mathbb{F}_5^n$ associated with the fourth elementary symmetric polynomial.

math.CO

Pareto-type finite-block optimality for source codes: a constrained Markov example

We study a Pareto-type notion of finite-block optimality for injective source codes, where two codes are compared through the full sequence of expected block lengths. As a concrete and fully analyzable test case, we revisit the four-symbol constrained Markov source introduced by Dalai and Leonardi in their "meaningful example'' on constrained-source decodability. For each admissible nonempty string $u=x_1^m \in \mathscr{A} \subset \mathscr{X}^+$, let $$ K(u):=-\log_2 \mathbb{P}(X_1^m=u) $$ denote its information cost. We construct a canonical injective binary mapping $C:\mathscr{A} \to \{0,1\}^+$ by ordering admissible strings by increasing $K(u)$, then by length and lexicographic order, and assigning binary strings in shortlex order. For the length-$n$ block $X_1^n$ we prove $$ \mathbb{E}[|C(X_1)|]=\tfrac32, \qquad \mathbb{E}[|C(X_1^n)|]<\tfrac32\,n\quad (n\ge 2). $$ Moreover, for every fixed $$ 0<c<\frac{\sqrt2}{18\sqrt\pi} $$ we have $$ \mathbb{E}[|C(X_1^n)|]\le \tfrac32\,n-\frac{c}{\sqrt n} $$ for all sufficiently large $n$. Thus, for this source, the reversible Dalai-Leonardi code is not Pareto-optimal with respect to finite-block average length. The proof is based on an exact enumeration of admissible strings by information cost and on a shortlex gap identity implying that each cost class splits evenly between lengths $K(u)-1$ and $K(u)$. The example is simple, but it already exhibits the kind of finite-block Pareto comparison that seems natural for injective source coding under source constraints.

cs.IT

Sharper upper bounds for $q$-ary and constant-weight $B_2$ codes

We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric polynomial of degree at most $q-1$. This leads to a natural convex relaxation over candidate difference distributions, equivalently expressible through an infinite family of positive semidefinite Toeplitz constraints. The resulting formulation admits a simple Gram interpretation and yields certified upper bounds through truncated semidefinite programs. Combined with the prefix-suffix method, this gives improved asymptotic rate upper bounds for $q$-ary $B_2$ codes; in particular, for $q\in\{9,10,11,12,13\}$ the resulting values improve on the best bounds known in the literature. We also study binary constant-weight $B_2$ codes. Extending the distance-distribution method of Cohen, Litsyn, and Z\'emor to the constant-weight setting, and combining it with Litsyn's asymptotic linear-programming bound for constant-weight codes, we derive a new upper bound on the constant-weight $B_2$ rate.

cs.IT

Graham conjecture on small sets in abelian groups

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and Sauermann in~\cite{PM} (combined with earlier results of \cite{BBKMM}), it remains open for general abelian groups, even in the cyclic case $\mathbb{Z}_k$. In this paper, using a recursive approach, we investigate the sequenceability of subsets $A$ in generic abelian groups for small values of $|A|$. We prove that any subset $A \subseteq G\setminus\{0\}$ with $|A| \leq 20$ is sequenceable where previously it was known only for $|A|\leq 9$. This bound is improved to $|A| \leq 22$ for zero-sum subsets. Finally, regarding the related CMPP conjecture, we show that zero-sum subsets without inverse pairs are sequenceable for $|A| \leq 23$.

math.NT

New bounds for (weak) sequenceability in $\mathbb{Z}_k$

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and Sauermann in [16], it remains open for general abelian groups, even in the cyclic case $\mathbb{Z}_k$. For cyclic groups, the best known result is due to Bedert and Kravitz in [4], who proved - using a rectification and a two-step probabilistic approach - that the conjecture holds for any subset $A \subseteq \mathbb{Z}_k \setminus \{0\}$ such that $$ |A| \le \exp\!\big(c(\log p)^{1/4}\big), $$ for some constant $c>0$, where $p$ denotes the least prime divisor of $k$. In this paper, we improve their bound using a rectification argument again, followed by a one-shot probabilistic approach, showing that the conjecture holds whenever $$|A| \le \exp\!\big(c(\log p)^{1/3}\big), $$ thus improving the exponent $1/4$ from [4]. Moreover, the same one-shot approach adapts to the $t$-weak setting: by imposing all local constraints at once and applying the Lov\'asz Local Lemma, we obtain the existence of a $t$-weak sequencing whenever $$ t \le \exp\!\big(c(\log p)^{1/4}\big). $$

math.CO

Definability of some $k$-ary Relations Over Second Order kinds of Logics

We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers $n\geq 1$ and $k\leq b$, a $k$-tuple of sequences in $\{0,1,\ldots, b-1\}^n$ are said to be $k$-hashed if there is a coordinate where they all differ. A set $\mathcal{C}$ of sequences is said to be a $k$-hash code if any $k$ distinct elements are $k$-hashed. Testing whether a code is $k$-hashing and determining the largest size of $k$-hash codes is an important problem in computer science. The use of general purpose solvers for this problem leads to question what minimal logic is needed to represent the problem. In this paper, we prove that the $k$-hashing relation on $k$-tuples is not definable in Monadic Second Order Logic (MSO), highlighting its limitations for this problem. Instead, the property can be expressed in extensions of the MSO that add the equi-cardinality relation.

math.LO

Bounds on $k$-hash distances and rates of linear codes

In this paper, we bound the rate of linear codes in $\mathbb{F}_q^n$ with the property that any $k\leq q$ codewords are all simultaneously distinct in at least $d_k$ coordinates. For the case of particular interest $q=k=3$ we recover, with a simpler proof, state of the art results in the case $d_3=1$ and new bounds for $d_3>1$. We finally discuss some related open problems on the list-decoding zero-error capacity of discrete memoryless channels.

cs.IT

End-to-End Semantic Preservation in Text-Aware Image Compression Systems

Traditional image compression methods aim to reconstruct images for human perception, prioritizing visual fidelity over task relevance. In contrast, Coding for Machines focuses on preserving information essential for automated understanding. Building on this principle, we present an end-to-end compression framework that retains text-specific features for Optical Character Recognition (OCR). The encoder operates at roughly half the computational cost of the OCR module, making it suitable for resource-limited devices. When on-device OCR is infeasible, images can be efficiently compressed and later decoded to recover textual content. Experiments show significant improvements in text extraction accuracy at low bitrates, even outperforming OCR on uncompressed images. We further extend this study to general-purpose encoders, exploring their capacity to preserve hidden semantics under extreme compression. Instead of optimizing for visual fidelity, we examine whether compact, visually degraded representations can retain recoverable meaning through learned enhancement and recognition modules. Results demonstrate that semantic information can persist despite severe compression, bridging text-oriented compression and general-purpose semantic preservation in machine-centered image coding.

eess.IV

Graham's rearrangement for a class of semidirect products

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log p)^{1/4}}$. In this paper, we will use a similar procedure to obtain an upper bound of the same type in the case of semidirect products $\mathbb{Z}_p \rtimes_{\varphi} H$ where $\varphi: H \to Aut(\mathbb{Z}_p)$ satisfies $\varphi(h) \in \{id, -id\}$ for each $h \in H$ and where $H$ is abelian and each subset of $H$ can be ordered such that all of its partial products are distinct.

math.CO

An Efficient Algorithm for Group Testing with Runlength Constraints

In this paper, we provide an efficient algorithm to construct almost optimal $(k,n,d)$-superimposed codes with runlength constraints. A $(k,n,d)$-superimposed code of length $t$ is a $t \times n$ binary matrix such that any two 1's in each column are separated by a run of at least $d$ 0's, and such that for any column $\mathbf{c}$ and any other $k-1$ columns, there exists a row where $\mathbf{c}$ has $1$ and all the remaining $k-1$ columns have $0$. These combinatorial structures were introduced by Agarwal et al. [1], in the context of Non-Adaptive Group Testing algorithms with runlength constraints. By using Moser and Tardos' constructive version of the Lovász Local Lemma, we provide an efficient randomized Las Vegas algorithm of complexity $Θ(t n^2)$ for the construction of $(k,n,d)$-superimposed codes of length $t=O(dk\log n +k^2\log n)$. We also show that the length of our codes is shorter, for $n$ sufficiently large, than that of the codes whose existence was proved in [1].

cs.IT

Weak Freiman isomorphisms and sequencings of small sets

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 cyclic groups, as a first application, we prove that any subset of size $k$ of the dihedral group $D_{2m}$ (and, more in general, of a class of semidirect products) is sequenceable, provided that the prime factors of $m$ are larger than $k!$. Also, a refined bound of $k!/2$ for the size of the prime factors of $m$ can be obtained for cyclic groups $\mathbb{Z}_m$, slightly improving the result of [14]. Then, applying again the concept of weak Freiman isomorphism, we show that any subset of size $k$ of the dicyclic group $\mathrm{Dic}_{m}$ is sequenceable, provided that the prime factors of $m$ are larger than $k^k$.

math.CO

LiDAR Depth Map Guided Image Compression Model

The incorporation of LiDAR technology into some high-end smartphones has unlocked numerous possibilities across various applications, including photography, image restoration, augmented reality, and more. In this paper, we introduce a novel direction that harnesses LiDAR depth maps to enhance the compression of the corresponding RGB camera images. To the best of our knowledge, this represents the initial exploration in this particular research direction. Specifically, we propose a Transformer-based learned image compression system capable of achieving variable-rate compression using a single model while utilizing the LiDAR depth map as supplementary information for both the encoding and decoding processes. Experimental results demonstrate that integrating LiDAR yields an average PSNR gain of 0.83 dB and an average bitrate reduction of 16% as compared to its absence.

eess.IV

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

This paper presents new upper bounds on the rate of linear $k$-hash codes in $\mathbb{F}_q^n$, $q\geq k$, that is, codes with the property that any $k$ distinct codewords are all simultaneously distinct in at least one coordinate.

cs.IT

Alternating Parity Weak Sequencing

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq k$, satisfy $s_i \neq s_j$ whenever and $1 \leq |i-j|\leq t$. In [10] it was proved that if the order of a group is $pe$ then all sufficiently large subsets of the non-identity elements are $t$-weakly sequenceable when $p > 3$ is prime, $e \leq 3$ and $t \leq 6$. Inspired by this result, we show that, if $G$ is the semidirect product of $\mathbb{Z}_p$ and $\mathbb{Z}_2$ and the subset $S$ is balanced, then $S$ admits, regardless of its size, an alternating parity $t$-weak sequencing whenever $p > 3$ is prime and $t \leq 8$. A subset of $G$ is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups $G$ that are semidirect products of a generic (non necessarily abelian) group $N$ and $\mathbb{Z}_2$, that all sufficiently large balanced subsets of the non-identity elements admit an alternating parity $t$-weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset $S$ of a group $G$ is large enough and if $S$ does not contain $0$, then $S$ is $t$-weakly sequenceable.

math.CO

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

Let $Σ=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erdős states that $a_n>C\cdot 2^n$ for some constant $C$, while the best result known to date is of the form $a_n>C\cdot 2^n/\sqrt{n}$. In this paper, we propose a generalization of the Erdős distinct sum problem that is in the same spirit as those of the Davenport and the Erdős-Ginzburg-Ziv constants recently introduced in \cite{CGS} and in \cite{CS}. More precisely, we require that the non-zero evaluations of the $m$-th degree symmetric polynomial are all distinct over the subsequences of $Σ$ whose size is at most $λn$, for a given $λ\in (0,1]$, considering $Σ$ as a sequence in $\mathbb{Z}^k$ with each coordinate of each $a_i$ in $[0,M]$. If $\mathcal{F}_{λ,n}$ denotes the family of subsets of $[1,n]$ whose size is at most $λn$, our main result is that, for each $k,m,$ and $λ$, there exists an explicit constant $C_{k,m,λ}$ such that $$ M\geq C_{k,m,λ} \frac{(1+o(1)) |\mathcal{F}_{λ,n}|^{\frac{1}{mk}}}{n^{1 - \frac{1}{2m}}}.$$

math.CO

Bounds on the Higher Degree Erdős-Ginzburg-Ziv Constants over $\mathbb{F}_q^n$

The classical Erdős-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and Schmitt generalized this concept, using the $m$-th degree symmetric polynomial $e_m(S)$ instead of the sum of the elements of $S$ and considering subsequences of a given length $t$. In particular, they defined the higher degree Erdős-Ginzburg-Ziv constants $EGZ(t,R,m)$ of a finite commutative ring $R$ and presented several lower and upper bounds to these constants. This paper aims to provide lower and upper bounds for $EGZ(t,R,m)$ in case $R=\mathbb{F}_q^{n}$. The lower bounds here presented have been obtained, respectively, using Lovász Local Lemma and the Expurgation method and, for sufficiently large $n$, they beat the lower bound provided by Caro and Schmitt for the same kind of rings. Finally, we prove closed form upper bounds derived from the Ellenberg-Gijswijt and Sauermann results for the cap-set problem assuming that $q = p^k$, $t = p$, and $m=p-1$. Moreover, using the Slice Rank method we derive a convex optimization problem that provides the best bounds for $q = 3^k$, $t = 3$, $m=2$ and $k=2,3,4,5$.

math.CO