Related papers: A robust implementation for solving the $S$-unit e…
We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the…
Given a field $K$ equipped with a set of discrete valuations $V$, we develop a general theory to relate reduction properties of skew-hermitian forms over a quaternion $K$-algebra $Q$ to quadratic forms over the function field $K(Q)$…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
We prove that for every Scott set $S$ there are $S$-saturated real closed fields and models of Presburger arithmetic.
In this article, we use Pad\'{e} approximations constructed for binomial functions, to give a new upper bound for the number of the solutions of the $S$-unit equation. Combining explicit formulae of these Pad\'{e} approximants with a simple…
We show that there exist arbitrarily large sets $S$ of $s$ prime numbers such that the equation $a+b=c$ has more than $\exp(s^{2-\sqrt{2}-\epsilon})$ solutions in coprime integers $a$, $b$, $c$ all of whose prime factors lie in the set $S$.…
In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…
We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…
In this work we explore the construction of abelian extensions of number fields with exactly one complex place using multivariate analytic functions in the spirit of Hilbert's 12th problem. To this end we study the special values of the…
We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…
This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally…
The numerical analysis for the small amplitude motion of an elastic beam with internal damping is investigated in domain with moving ends. An efficient numerical method is constructed to solve this moving boundary problem. The stability and…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
Let K be an arithmetic function field, that is, a field of finite type over the rational number field. In this note, as an application of the height theory due to Chen-Moriwaki, we would like to show that the solutions of Fermat's curve X^N…
This research focuses on the Numerical approach for Fermat's Last theorem. We can induce an Alternative form of Fermat's last theorem by using particular geometric mapping $\mathcal{M}$ on a Cartesian plane to a Torus. It transforms the…
We prove existence and uniqueness results for solutions to a class of optimal transportation problems with infinitely many marginals, supported on the real line. We also provide a characterization of the solution with an explicit formula.…
We study Kummer's approach towards proving the Fermat's last Theorem for regular primes. Some basic algebraic prerequisites are also discussed in this report, and also a brief history of the problem is mentioned. We review among other…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
To allow for Division By Zero, we develop a new algebraic structure containing addition and multiplication called an S-Extension of a Field. This unique structure extends a Field so that the equation $0\cdot s=x$ has exactly one solution…