Related papers: A geometric approach to the diophantine Frobenius …
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,…
The nonlinear equation which is connected with the main term of the Hardy-Littlewood formula for $\zeta^2(1/2+it)$ is studied. In this direction I obtain the fine results which cannot be reached by published methods of Balasubramanian,…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…
We study the max-algebraic analogue of equations involving Z-matrices and M-matrices, with an outlook to a more general algebraic setting. We show that these equations can be solved using the Frobenius trace down method in a way similar to…
This article is devoted to the study of solutions of non-homogenous linear differential equations having entire coefficients. We get all non-trivial solutions of infinite order of equation $f^{(n)}+a_{n-1}(z)f^{(n-1)}+\ldots…
The paper is concerned with three types of cubic splines over a triangulation that are characterized by three degrees of freedom associated with each vertex of the triangulation. The splines differ in computational complexity, polynomial…
We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.
The Frobenius Coin Problem is a classic question in mathematics: given coins of specified denominations, what is the largest amount that cannot be formed using only those coins? This brief work covers a variation of such question, posing a…
In this paper, we completely solve the Diophantine equations $F_{n_1} + F_{n_2} = 2^{a_1} + 2^{a_2} + 2^{a_3}$ and $ F_{m_1} + F_{m_2} + F_{m_3} =2^{t_1} + 2^{t_2} $, where $F_k$ denotes the $k$-th Fibonacci number. In particular, we prove…
We use the Brauer-Manin obstruction to strong approximation on a punctured affine cone to explain a curious property of coprime integer solutions to a homogeneous Diophantine equation.
We compute the sequence of best Diophantine approximations for some pairs of cubic Pisot numbers which do not satisfy the Property (F).
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…
The usual language of algebraic geometry is not appropriate for Arithmetical geometry: addition is singular at the real prime. We developed two languages that overcome this problem: one replace rings by the collection of "vectors" or by…
This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…
The behavior of the images of a fixed element of order p in irreducible representations of a classical algebraic group in odd characteristic p with highest weights large enough with respect to p and this element is investigated. Lower…
In this paper, we develop a method to obtain the algebraic classification of noncommutative Jordan algebras from the classification of Jordan algebras of the same dimension. We use this method to obtain the algebraic classification of…
Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…
Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…