Some remarks on nmax(k) Diophantine n-gons
General Mathematics
2022-11-18 v1
Authors:
Zurab Aghdgomelashvili
Abstract
In this article one of the fundamental problems of Diophantine (integer) planar geometric figures, the Task max n(k), is considered.
Cite
@article{arxiv.2211.09734,
title = {Some remarks on nmax(k) Diophantine n-gons},
author = {Zurab Aghdgomelashvili},
journal= {arXiv preprint arXiv:2211.09734},
year = {2022}
}
Related papers
View all related →
General Mathematics · Mathematics
On a Fundamental Task of Diophantine Geometric Figures
Zurab Aghdgomelashvili
2020-03-06
General Mathematics · Mathematics
On a Fundamental Task of Bidiophantine Geometric Figures
Zurab Aghdgomelashvili
2020-03-25
Number Theory · Mathematics
Continuant Diophantine equations
Dzmitry Badziahin
2016-07-26
Combinatorics · Mathematics
Some Necessary and Sufficient Conditions for Diophantine Graphs
M. A. Seoud, A. Elsonbaty, A. Nasr, M. Anwar
2025-10-27
Number Theory · Mathematics
Diophantus Equations and Partially Ordered Sets
Addea Gupta
2021-05-25
Number Theory · Mathematics
A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions
Apoloniusz Tyszka
2015-10-14
Number Theory · Mathematics
Diophantine approximation in small degree
Damien Roy
2007-05-23
Data Structures and Algorithms · Computer Science
Planar Disjoint-Paths Completion
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2015-11-18
Logic · Mathematics
Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the number (heights) of integer solutions, if these solutions form a finite set?
Apoloniusz Tyszka
2014-10-21
Number Theory · Mathematics
A hypothetical upper bound on the heights of the solutions of a Diophantine equation with a finite number of solutions
Apoloniusz Tyszka
2018-08-20
Logic · Mathematics
Small systems of Diophantine equations which have only very large integer solutions
Apoloniusz Tyszka
2014-10-21
Number Theory · Mathematics
On a nonlinear Diophantine equation with powers of three consecutive $k$--Lucas Numbers
Herbert Batte, Florian Luca
2024-12-18
Number Theory · Mathematics
A hypothetical upper bound for the solutions of a Diophantine equation with a finite number of solutions
Apoloniusz Tyszka
2014-10-21
Number Theory · Mathematics
Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite?
Apoloniusz Tyszka
2014-03-25
Combinatorics · Mathematics
Turan problems for $k$-geodetic digraphs
James Tuite, Grahame Erskine, Nika Salia
2022-03-29
Number Theory · Mathematics
Counting the number of solutions to certain infinite Diophantine equations
Nian Hong Zhou, Yalin Sun
2021-04-06
Number Theory · Mathematics
Diophantine approximation with nonsingular integral transformations
S. G. Dani, Arnaldo Nogueira
2019-03-12
Number Theory · Mathematics
Equal values of certain partition functions via Diophantine equations
Szabolcs Tengely, Maciej Ulas
2021-09-27
Metric Geometry · Mathematics
The plank problem for symmetric bodies
Keith Ball
2009-10-22
Number Theory · Mathematics
Open Diophantine Problems
Michel Waldschmidt
2007-05-23
Combinatorics · Mathematics
Counting Problems for Orthogonal Sets and Sublattices in Function Fields
Noy Soffer Aranov, Angelot Behajaina
2026-02-24
Dynamical Systems · Mathematics
Diophantine properties of groups of toral automorphisms
Vladimir Finkelshtein
2016-07-21
Number Theory · Mathematics
On the Diophantine equations f (x) = g(y)
S. Subburam, J. Tanti
2019-02-12
Number Theory · Mathematics
Gauss Integers and Diophantine Figures
Stancho Dimiev, Krassimir Markov
2007-05-23
Logic · Mathematics
A subset of Z^n whose non-computability leads to the existence of a Diophantine equation whose solvability is logically undecidable
Apoloniusz Tyszka
2012-04-09