相关论文: On Diophantine exponents of lattices
We study modular ortholattices in the variety generated by the finite dimensional ones from an equational and geometric point of view. We relate this to coordinatization results.
The work is dedicated to the theoretic analysis of wire media, i.e. lattices of perfectly conducting wires comprised of two or three doubly periodic arrays of parallel wires which are orthogonal to one another. An analytical method based on…
We show that the model of discrete spaces that we have proposed in previous contributions gives a comprehensive and detailed interpretation of the properties of the standard model of particles. Moreover the model also suggests the possible…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
In a recent paper S. Friedland and the author presented a formal expression for lambda_d(p) of the monomer-dimer problem on a d-dimensional rectangular lattice, which involved a power series in p. Herein, we find simlar expressions for…
By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.
In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
Schmidt generalized in 1967 the theory of classical Diophantine approximation to subspaces of $\R^n$. We consider Diophantine exponents for linear subspaces of $\R^n$ which generalize the irrationality measure for real numbers. Using…
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…
The propagator of the discrete Schr\"odinger equation is computed and its properties are revealed through a Feynman path summation in discrete space. Initial data problems such as diffraction in discrete space and continuous time are…
We develop embedding formulae for all possible diffraction problems with Dirichlet scatterers on square lattices using the Wiener--Hopf perspective. The embedding formula expresses solutions for arbitrary plane-wave incidence in terms of a…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
Coincidence site lattices of oblique planar lattices are algebraically characterized using as basic tool the Cartan-Dieudonn\'e theorem, that is, the decomposition of an orthogonal transformation as a product of reflections. The case of…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
The subject matter of this work are the linear, three variable diophantine equation ax+by+cz=d (1), and the diophantine system ax+by+cz=d (2) ex+fy+gz=h with the coefficients a,b,c,d,e,f,g,h being integers. Introductory number theory books,…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
In this paper we study counting functions representing the number of solutions of systems of linear inequalities which arise in the theory of Diophantine approximation. We develop a method that allows us to explain the random-like behavior…