The Exact Minimum Order for Unique Multiset Sums in Finite Abelian Groups

This project presents a proof of the exact minimum order for unique multiset sums in finite abelian groups, resolving an open problem posed by J. A. R. Fonollosa. It establishes the sharp bound 2^{n-1}, classifies all equality cases, and derives a consequence for finite-abelian character schemes used in permanent evaluation.

Authors

Publication Details

Journal
Open Science Framework
Published
2026-07-24
DOI
https://doi.org/10.17605/osf.io/c58q9
Primary Topic
graph theory and CDMA systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

The Exact Minimum Order for Unique Multiset Sums in Finite Abelian Groups

Michael Behzat Ali Inal
Open Science Framework
graph theory and CDMA systems
preprint

The Exact Minimum Order for Unique Multiset Sums in Finite Abelian Groups

Michael Behzat Ali Inal
preprint en

Abstract

This project presents a proof of the exact minimum order for unique multiset sums in finite abelian groups, resolving an open problem posed by J. A. R. Fonollosa. It establishes the sharp bound 2^{n-1}, classifies all equality cases, and derives a consequence for finite-abelian character schemes used in permanent evaluation.

Open Science Framework
Reduced inequalities
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.