DOIAbstract
A search bound for the smallest solution of a quadratic diophantine equation over number fields in at least three variables is established
A search bound for the smallest solution of a quadratic diophantine equation over number fields in at least three variables is established
Diophantine Equations named after ancient Greek mathematician Diophantus, plays a vital role not onl...
To solve many Diophantine equations it often requires good lower bounds for linear forms in the loga...
Fields are number systems in which every linear equation has a solution, such as the set of all rati...
The goal of Hilbert's tenth problem is to find an algorithm for deciding whether an arbitrary multiv...
Title: Solving diophantine equations by factorization in number fields Author: Bc. Maroš Hrnčiar Dep...
AbstractWe present a complete characterization of the set of minimal solutions of a single linear Di...
Let K be any quadratic field with O-K its ring of integers. We study the solutions of cubic equation...
A Diophantine problem over Q is concerned with the solutions either in Q or in Z of a finite system ...
The main goal of the work is to summarize and generalize a method for solving quadratic Diophantine ...
This monograph treats the classical theory of quadratic Diophantine equations and guides the reader ...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
We develop an algorithm for solving a linear diophantine equation with lower and upper bounds on the...
A Diophantine problem means to find all solutions of an equation or system of equations in integers,...
Let α be an algebraic number of degree d ≥ 3 and let K be the algebraic number field Q(α). When ε is...
AbstractWe present an algorithm which computes a minimal length solution of a system of two linear d...
Diophantine Equations named after ancient Greek mathematician Diophantus, plays a vital role not onl...
To solve many Diophantine equations it often requires good lower bounds for linear forms in the loga...
Fields are number systems in which every linear equation has a solution, such as the set of all rati...
The goal of Hilbert's tenth problem is to find an algorithm for deciding whether an arbitrary multiv...
Title: Solving diophantine equations by factorization in number fields Author: Bc. Maroš Hrnčiar Dep...
AbstractWe present a complete characterization of the set of minimal solutions of a single linear Di...
Let K be any quadratic field with O-K its ring of integers. We study the solutions of cubic equation...
A Diophantine problem over Q is concerned with the solutions either in Q or in Z of a finite system ...
The main goal of the work is to summarize and generalize a method for solving quadratic Diophantine ...
This monograph treats the classical theory of quadratic Diophantine equations and guides the reader ...
We define a computable function f from positive integers to positive integers. We formulate a hypoth...
We develop an algorithm for solving a linear diophantine equation with lower and upper bounds on the...
A Diophantine problem means to find all solutions of an equation or system of equations in integers,...
Let α be an algebraic number of degree d ≥ 3 and let K be the algebraic number field Q(α). When ε is...
AbstractWe present an algorithm which computes a minimal length solution of a system of two linear d...
Diophantine Equations named after ancient Greek mathematician Diophantus, plays a vital role not onl...
To solve many Diophantine equations it often requires good lower bounds for linear forms in the loga...
Fields are number systems in which every linear equation has a solution, such as the set of all rati...
Add to ORKG