Related papers: Diophantine Maps
Many authors studied the problem that rational triangle pairs (triangle-parallelogram pairs) with the same area and the same perimeter. They investigated this problem by solving the rational solutions of the corresponding Diophantine…
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…
For every positive integer h, the representation function of order h associated to a subset A of the integers or, more generally, of any group or semigroup X, counts the number of ways an element of X can be written as the sum (or product,…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Fix a quadratic order over the ring of integers. An embedding of the quadratic order into a quaternionic order naturally gives an integral binary hermitian form over the quadratic order. We show that, in certain cases, this correspondence…
On non-K\"ahler manifolds the notion of harmonic maps is modified to that of Hermitian harmonic maps in order to be compatible with the complex structure. The resulting semilinear elliptic system is {\it not} in divergence form. The case of…
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…
The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step in the negative resolution of Hilbert's 10th problem. Almost three decades of work on the problem have resulted in several equally surprising results. These include the…
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…
A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…
We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.
Much recent work has addressed the solution of a family of partial differential equations by computing the inverse operator map between the input and solution space. Toward this end, we incorporate function-valued reproducing kernel Hilbert…
The Dirichlet-to-Neumann map associated to an elliptic partial differential equation becomes multivalued when the underlying Dirichlet problem is not uniquely solvable. The main objective of this paper is to present a systematic study of…
In this note, we give examples of formal power series satisfying certain conditions that cannot be realized as Hilbert series of finitely generated modules. This answers to the negative a question raised in a recent article by the second…
We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining…
Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…
In this note we recall the definition of the digital root, and apply the notion of the digital root to searching solutions of Diophantine equations. A table of arithmetic operations with digital roots is given. This method is incapable of…