相关论文: Gauss Integers and Diophantine Figures
This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…
The "Diophantine" property of the zeros of certain polynomials in the Askey scheme, recently discovered by Calogero and his collaborators, is explained, with suitably chosen parameter values, in terms of the summation theorem of…
Given a planar graph derived from a spherical, euclidean or hyperbolic tessellation, one can define a discrete curvature by combinatorial properties, which after embedding the graph in a compact 2d-manifold, becomes the Gaussian curvature.
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
The paper is mostly a survey on recent results in Diophantine approximation, with emphasis on properties of exponents measuring various notions of Diophantine <approximation.
Based on Broise-Alamichel and Paulin's work on the Gauss map corresponding to the principal convergents, we continue the study of the Gauss map via Farey maps to contain all the intermediate convergents. We define the geometric Farey map,…
The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
Hecke studies the distribution of fractional parts of quadratic irrationals with Fourier expansion of Dirichlet series. This method is generalized by Behnke and Ash-Friedberg, to study the distribution of the number of totally positive…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
Graph theory provides powerful tools for modeling concepts in number theory, leading to the introduction of graphs derived from arithmetic properties. One such structure is the divisor prime graph, $G_{Dp(n)}$. For any positive integer $n$,…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
Let $d \geq 1$ be an integer. From a set of $d$-dimensional vectors, we obtain a $d$-\dpg\ by letting each vector $\va^u$ correspond to a vertex $u$ and by adding an edge between two vertices $u$ and $v$ if and only if their dot product…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
We propose Graph Generating Dependencies (GGDs), a new class of dependencies for property graphs. Extending the expressivity of state of the art constraint languages, GGDs can express both tuple- and equality-generating dependencies on…
This note provides an insight to the diophantine properties of abelian surfaces with quaternionic multiplication over number fields. We study the fields of definition of the endomorphisms on these abelian varieties and the images of the…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
We place the theory of metric Diophantine approximation on manifolds into a broader context of studying Diophantine properties of points generic with respect to certain measures on $\Bbb R^n$. The correspondence between multidimensional…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
In this article we study algebraic structures of function spaces defined by graphs and state spaces equipped with Gibbs measures by associating evolution algebras. We give a constructive description of associating evolution algebras to the…