Author:
Sultanow Eldar,Henkel Max,Aberkane Idriss J.
Abstract
AbstractWe introduced a novel method for visualizing large diophantine datasets and in particular found that mapping the known integer triplets $$\{a,b,c\}$$
{
a
,
b
,
c
}
solving either equations of the type $$a^3+b^3+c^3=d$$
a
3
+
b
3
+
c
3
=
d
or $$a^3+b^3+c^3=d^3$$
a
3
+
b
3
+
c
3
=
d
3
on certain proper subgroups of the circle group exposed a very clear breaking in their symmetry and a strongly non-ergodic distribution of the solutions of sums of three cubes that had never been described before. This method could be further applied to a larger diversity of diophantine problems, informing both number-theoretical conjectures and novel methods in computer sciences on the way, along with paving the road for specific uses of machine learning in exploring diophantine datasets with possible applications in cryptography among others.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Rassokhin, D. Diophantine-based encryption.
2. Okumura, S. A public key cryptosystem based on diophantine equations of degree increasing type (2015).
3. Engcot, M. K. C. Cryptography using linear diophantine equation (2015).
4. Booker, A. Cracking the problem with 33, 9696 (2019).
5. Matić, L. Non-existence of certain diophantine quadruples in rings of integers of pure cubic fields. Proc. Jpn. Acad. Ser. A Math. Sci. 88, 163–167 (2012).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献