相关论文: Gauss Integers and Diophantine Figures
A Diophantine figure is a set of points on the integer grid $\mathbb{Z}^{2}$ where all mutual Euclidean distances are integers. We also speak of Diophantine graphs. In this language a Diophantine figure is a complete Diophantine graph. Due…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
The goal of the work is to take on and study one of the fundamental tasks studying Bidiophantine polygons (let us call a polygon Diophantine, if the distance between each two vertex of those is expressed by a natural number and we say that…
This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…
We develop an algebraic method of studying of Diophantine quadratic equations in three variables over the ring of Gaussian integers.
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…
This survey article is an introduction to Diophantine Geometry at a basic undergraduate level. It focuses on Diophantine Equations and the qualitative description of their solutions rather than detailed proofs.
The goal of the work is to take on and study one of the fundamental tasks studying Diophantine n-gons (the author of the paper considers an integral n-gon is Diophantine as far as determination of combinatorial properties of each of them…
Over the last two hundred years different transformation formulas for Gauss' hypergeometric function ${}_2F_1$ were discovered. The goal of the present article is to study their arithmetic analogue for the underlying hypergeometric motive.…
This survey paper is not a complete reference guide to number-theoretical applications of ergodic theory. Instead, it considers an approach to a class of problems involving Diophantine properties of $n$-tuples of real numbers, namely,…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
Finite frame theory has become a powerful tool for many applications of mathematics. In this paper we introduce a new area of research in frame theory: Integer frames. These are frames having all integer coordinates with respect to a fixed…
In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously $\psi$-approximable points on a curve, surface, etc., given as a graph of integer valued polynomials. We obtain complete answers to these questions for…
Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to…
A remark about the role of Galois theory in Diophantine geometry as reflected in the work of Serge Lang. An entry in `The mathematical contributions of Serge Lang.'
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…
Several measures for the density of sets of integers have been proposed, such as the asymptotic density, the Schnirelmann density, and the Dirichlet density. There has been some work in the literature on extending some of these concepts of…