Skip to main content
Log in

Maximal k-Sum-Free Collections in an Abelian Group

  • PART I “MATHEMATICAL LOGIC AND PATTERN RECOGNITION”
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

Let \(G\) be an Abelian group of order n, let \(k \geqslant 2\) be an integer, and \({{A}_{1}}, \ldots ,{{A}_{k}}\) be nonempty subsets of \(G\). The collection \(\left( {{{A}_{1}}, \ldots ,{{A}_{k}}} \right)\) is called \(k\)-sum-free (abbreviated \(k\)-SFC) if the equation \({{x}_{1}} + \ldots + {{x}_{k}} = 0\) has no solutions in the collection \(\left( {{{A}_{1}}, \ldots ,{{A}_{k}}} \right),\) where \({{x}_{1}} \in {{A}_{1}}\), …, \({{x}_{k}} \in {{A}_{k}}\). The family of \(k\)-SFC in \(G\) will be denoted by \(SF{{C}_{k}}\left( G \right)\). The collection \(\left( {{{A}_{1}}, \ldots ,{{A}_{k}}} \right) \in SF{{C}_{k}}\left( G \right)\) is called maximal by capacity if it is maximal by the sum of \(\left| {{{A}_{1}}} \right| + \ldots + \left| {{{A}_{k}}} \right|\), and maximal by inclusion if for any \(i \in \left\{ {1,...,k} \right\}\) and \(x \in G{\kern 1pt} {{\backslash }}{\kern 1pt} {{A}_{i}},\) the collection \(\left( {{{A}_{1}},...,{{A}_{{i - 1}}},{{A}_{i}} \cup \left\{ x \right\},{{A}_{{i + 1}}},...,{{A}_{k}}} \right)\) \( \notin \) \(SF{{C}_{k}}\left( G \right).\) Suppose \({{\varrho }_{k}}\left( G \right) = \left| {{{A}_{1}}} \right| + \ldots + \left| {{{A}_{k}}} \right|.\) In this work, we study the problem of the maximal value of \({{\varrho }_{k}}\left( G \right)\). In particular, the maximal value of \({{\varrho }_{k}}\left( {{{Z}_{d}}} \right)\) for the cyclic group \({{Z}_{d}}\) is determined. Upper and lower bounds for \({{\varrho }_{k}}\left( G \right)\) are obtained for the Abelian group \(G.\) The structure of the maximal k-sum-free collection by capacity (by inclusion) is described for an arbitrary cyclic group.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

REFERENCES

  1. A. L. Cauchy, “Recherches sur les nombres,” J. Ecole Polytech. 9, 99–123 (1813). https://doi.org/10.1163/9789004460409_mor2-b29495520

    Article  Google Scholar 

  2. H. Davenport, “On the addition of residue classes,” J. London Math. Soc. s1-10, 30–32 (1935). https://doi.org/10.1112/jlms/s1-10.37.30

  3. H. Davenport, “A historical note,” J. London Math. Soc. s1-22, 100–101 (1947). https://doi.org/10.1112/jlms/s1-22.2.100

  4. Y. O. Hamidoune and A. Plagne, “A new critical pair theorem applied to sum-free sets in Abelian groups,” Comment. Mathematici Helv. 79, 183–207 (2004).

    Article  MathSciNet  Google Scholar 

  5. M. Kneser, “Abschätzung der asymptotischen Dichte von Summenmengen,” Math. Z. 58, 459–484 (1953). https://doi.org/10.1007/bf01174162

    Article  MathSciNet  Google Scholar 

  6. M. B. Nathanson, Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Graduate Texts in Mathematics, Vol. 165 (Springer, Berlin, 1996).

  7. P. Samuel, Theorie Algebrique des Nombres (Hermann, Paris, 1967).

    Google Scholar 

  8. V. Sargsyan, “Asymptotics for the logarithm of the number of k-solution-free collections in Abelian groups,” AIP Conf. Proc. 2757, 040006 (2023). https://doi.org/10.1063/5.0135804

  9. A. G. Vosper, “The critical pairs of subsets of a group of prime order,” J. London Math. Soc. s1-31, 200–205 (1956). https://doi.org/10.1112/jlms/s1-31.2.200

  10. A. G. Vosper, “Addendum to ‘The critical pairs of subsets of a group of prime order,’” J. London Math. Soc. s1-31, 280–282 (1956). https://doi.org/10.1112/jlms/s1-31.3.280

Download references

Funding

The Science Committee of the Ministry of Education, Science, Culture and Sports of the Republic of Armenia, grant no. 21T-1B314, supported the work.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vahe Sargsyan.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Vahe Sargsyan Date of birth: June 11, 1983.

Scientific works: More than 30 scientific articles.

Education: Postdoctoral researcher in Mathematics; 2016–2019 Moscow State University, Faculty of Computational Mathematics and Cybernetics, Master’s degree of Informatics and Applied Mathematics; 2015–2017 Moscow Institute of Physics and Technology, Faculty of Innovation and High Technology, PhD in Mathematics; 2009–2012 Moscow State University, Faculty of Computational Mathematics and Cybernetics, Master’s degree of Informatics and Applied Mathematics; 2003–2005 Yerevan State University, Faculty of Informatics and Applied Mathematics, Bachelor’s degree of Mathematics in the field of Informatics and Applied Mathematics; 1999–2003 Yerevan State University, Faculty of Informatics and Applied Mathematics.

Work experience:

Lead data scientist at Boo Vision Technologies LLC – Yerevan, November 2018 to present.

Lead scientist at Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia, November 2019 to present.

Lead data scientist at Yerevan Telecommunication Research Institute JSC, July 2016 to September 2017.

Data scientist at “ADCOM SYSTEMS,” Abu-Dhabi, UAE, February 2015 to November 2018.

Chief scientist at “NTC Faza” CJSC, Moscow, Russia, December 2014 to November 2018.

Junior scientist at Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia, March 2014 to November 2014.

C++/Qt developer at “POLIVID” OJSC, Moscow, Russia, November 2013 to November 2014.

Junior developer at “Instigate” CJSC, Yerevan, Armenia, April 2008 to November 2008.

Junior scientist at Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia, February 2008–September 2009.

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sargsyan, V. Maximal k-Sum-Free Collections in an Abelian Group. Pattern Recognit. Image Anal. 34, 40–48 (2024). https://doi.org/10.1134/S1054661824010188

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661824010188

Keywords:

Navigation