REVIEW 1 cited by
The independence number of a subset of an abelian group
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not necessarily distinct) elements of $A$ unless $h=k$ and the two sums contain the same terms in some order. A {\it weakly $t$-independent} set satisfies this property for sums of distinct terms. We give some exact values and asymptotic bounds for the size of a largest $t$-independent set and weakly $t$-independent set in abelian groups, particularly in the cyclic group ${\mathbb Z}_n$.
Forward citations
Cited by 1 Pith paper
-
Active Learning on Adversarially Corrupted Graphs
A poly-time active learning algorithm approximately recovers adversarially corrupted vertices with query complexity polynomial in the adversary's neighborhood budget and the clean graph's vertex expansion.
Discussion (0). Sign in to comment.