On modular k-free sets
From MaRDI portal
Publication:2344820
Abstract: Let and be integers. A set is -free if for all in , . We determine the maximal cardinality of such a set when and are coprime. We also study several particular cases and we propose an efficient algorithm for solving the general case. We finally give the asymptotic behaviour of the minimal size of a -free set in which is maximal for inclusion.
Summary: Let \(n\) and \(k\) be integers. A set \(A\subset\mathbb{Z}/n\mathbb{Z}\) is \(k\)-free if for all \(x\) in \(A\), \(kx\notin A\). We determine the maximal cardinality of such a set when \(k\) and \(n\) are coprime. We also study several particular cases and we propose an efficient algorithm for solving the general case. We finally give the asymptotic behaviour of the minimal size of a \(k\)-free set in \(\left[ 1,n\right]\) which is maximal for inclusion.
Recommendations
Cites work
- \(k\)-fold Sidon sets
- A complete annotated bibliography of work related to Sidon sequences
- scientific article; zbMATH DE number 5547 (Why is no real title available?)
- On hypergraphs of girth five
- On multiplicative Sidon sets
- Solving a linear equation in a set of integers I
- Theorems in the additive theory of numbers
Cited in
(2)
This page was built for publication: On modular \(k\)-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344820)