相关论文: Gauss Integers and Diophantine Figures
It is not commonly realized that the algebra of complex numbers can be used in an elegant way to represent the images of ordinary 3-dimensional figures, orthographically projected to the plane. We describe these ideas here, both using…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
The elliptic coordinates are used to build a new families of 2D coordinate systems which are orthogonal and admits the separation of variables. The charts of characteristic curves are constructed for these systems and compared with…
Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.
Let $\gamma\in(0;\frac{1}{2}),\tau\geq 1$ and define the "$\gamma,\tau$ Diophantine set" as: $$D_{\gamma, \tau}:=\{\alpha\in (0;1): ||q\alpha||\geq\frac{\gamma}{q^{\tau}}\quad\forall q\in\Bbb{N}\},\qquad ||x||:=\inf_{p\in\Bbb{Z}}|x-p|.$$ We…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We study the geometry of algebraic numbers in the complex plane, and their Diophantine approximation, aided by extensive computer visualization. Motivated by these images, called algebraic starscapes, we describe the geometry of the map…
If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjacency matrix of a mixed graph are \emph{Gaussian integers},…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
In discrete differential geometry, it is widely believed that the discrete Gaussian curvature of a polyhedral vertex star equals the algebraic area of its Gauss image. However, no complete proof has yet been described. We present an…
A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…
A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…
Let $\gamma\in(0;\frac{1}{2}),\tau\geq 1$ and define the "$\gamma,\tau$ Diophantine set" as: $$D_{\gamma,\tau}:=\{\alpha\in (0;1): ||q\alpha||\geq\frac{\gamma}{q^{\tau}}\quad\forall q\in\Bbb{N}\},\qquad||x||:=\inf_{p\in\Bbb{Z}}|x-p|. $$ In…
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of the inner diameter and inner radius of a digraph and study…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
The inhomogeneous Groshev type theory for dual Diophantine approximation on manifolds is developed. In particular, the notion of nice manifolds is introduced and the divergence part of the theory is established for all such manifolds. Our…