Skip to main content

Combinatorial Etudes and Number Theory

  • Chapter
  • First Online:
Recent Advances in Computational Optimization (WCO 2021)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 1044))

Included in the following conference series:

  • 128 Accesses

Abstract

The goal of the paper is to consider a special class of combinatorial problems, the solution of which is realized by constructing finite sequences of \(\pm 1\). For example, for fixed \(p\in {\mathbb N}\), is well known the existence of \(n_p\in {\mathbb N}\) with the property: any set of \(n_p\) consecutive natural numbers can be divided into 2 sets, with equal sums of its pth-powers. The considered property remains valid also for sets of finite arithmetic progressions of integers, real or complex numbers. The main observation here is the generalization of the results for arithmetic progressions with elements of complex field \({\mathbb C}\) to elements of arbitrary associative, commutative algebra.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Similar solutions and generalizations of the Prouhet–Tarry–Escot problem are considered in Borwein and Ingalls (1994), Borwein (2002), Dorwart and Brown (1937), Hardy and Wright (1979), Wakhare and Vignat (2022).

  2. 2.

    This paper is continuation of Stoenchev and Todorov (2022), and contains complete proofs of the formulated propositions.

References

  • Allouche, J.-P., Shallit, J.O.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.), Sequences and Their Applications, Proceedings of SETA ’98, pp. 1–16, Springer (1999)

    Google Scholar 

  • Borwein, P., Ingalls, C.: The Prouhet-Tarry-Escott Problem revisited. Enseign. Math. 40, 3–27, MR 95d:11038 (1994)

    Google Scholar 

  • Borwein, P.: Computational Excursions in Analysis and Number Theory. Springer, New York (2002)

    Google Scholar 

  • Byszewski, J., Ulas, M.: Some identitites involving the Prouhet-Thue-Morse sequence and its relatives. Acta Math. Hungar. 127–2, 438–456 (2015)

    Article  Google Scholar 

  • Dorwart, H.L., Brown, O.E.: The Tarry-Escott Problem. M.A.A. Monthly 44, 613–626 (1937)

    Google Scholar 

  • Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press, New York (1979)

    Google Scholar 

  • Stoenchev, M., Todorov, V.: Combinatorial etude. In: Proceedings of the \(16^{th}\) Conference on Computer Science and Intelligence Systems, pp. 231–234

    Google Scholar 

  • Wakhare, T., Vignat, C.: Settling some sum suppositions.arXiv:1805.10569 [math.NT]

Download references

Acknowledgements

Miroslav Stoenchev is supported by Bulgarian National Science Fund under Project KP-06-M32/2—17.12.2019 “Advanced Stochastic and Deterministic Approaches for Large-Scale Problems of Computational Mathematics”. Venelin Todorov is supported by the Bulgarian National Science Fund under Projects KP-06-N52/5 “Efficient methods for modeling, optimization and decision making” and by the Bilateral Project KP-06-Russia/17 “New Highly Efficient Stochastic Simulation Methods and Applications”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Venelin Todorov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Stoenchev, M., Todorov, V. (2022). Combinatorial Etudes and Number Theory. In: Fidanova, S. (eds) Recent Advances in Computational Optimization. WCO 2021. Studies in Computational Intelligence, vol 1044. Springer, Cham. https://doi.org/10.1007/978-3-031-06839-3_12

Download citation

Publish with us

Policies and ethics