Results 51 to 60 of about 446 (186)
Diophantine equations in semiprimes
Diophantine equations in semiprimes, Discrete Analysis 2019:17, 21 pp. This paper considers the problem of finding integer solutions to integral polynomial equations of the form $$f(x_1,\dots,x_n)=0\qquad\qquad (*)$$ with the condition that each ...
Shuntaro Yamagishi
doaj +1 more source
Random Diophantine equations in the primes II
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley +1 more source
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Diophantine equations and identities
The general diophantine equations of the second and third degree are far from being totally solved. The equations considered in this paper are i) x2−my2=±1 ii) x3+my3+m2z3−3mxyz=1iii) Some fifth degree diopantine ...
Malvina Baica
doaj +1 more source
Integral geometry on discrete matrices
In this note, we study the Radon transform and its dual on the discrete matrices by defining hyperplanes as being infinite sets of solutions of linear Diophantine equations. We then give an inversion formula and a support theorem.
Attioui Abdelbaki
doaj +1 more source
Separable Diophantine equations [PDF]
Theoretically, as noted by Skolem [3, p. 21(1), the general problem of algebraic diophantine analysis is reducible to the case in which occur only equations and inequalities of degree not higher than the second. For the extensive class of separable systems defined in ?6, this reduction can be performed effectively, eventuating in the complete integer ...
openaire +2 more sources
Solving the n $n$‐Player Tullock Contest
ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley +1 more source
GCD inequalities arising from codimension‐2 blowups
Abstract Assuming a deep Diophantine geometry conjecture by Vojta, Silverman proved an inequality giving an upper bound for the greatest common divisor (GCD). In this paper, we unconditionally prove a weaker version of this inequality. The main ingredient is the Ru–Vojta theory, which provides an efficient method of using Schmidt subspace theorem.
Yu Yasufuku
wiley +1 more source
Formulae are given furnishing all non-trivial integer solutions of the equation \[ (x^2-t^2)(y^2-t^2)=\biggl(\biggl({y-x\over 2}\biggr)^2-t^2\biggr)^2 \] considered for \(t=1\) by the reviewer and \textit{W. Sierpiński} [Elem. Math. 18, 132--133 (1963; Zbl 0126.07301)].
openaire +2 more sources
A Repulsion Motif in Diophantine Equations [PDF]
Problems related to the existence of integral and rational points on cubic curves date back at least to Diophantus. A significant step in the modern theory of these equations was made by Siegel, who proved that a non-singular plane cubic equation has only finitely many integral solutions.
Everest, G, Ward, T
openaire +5 more sources

