Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA robust implementation for solving the $S$-unit equation and several applications
336
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $K$ be a number field, and $S$ a finite set of places in $K$ containing all infinite places. We present an implementation for solving the $S$-unit equation $x + y = 1$, $x,y inmathscr{O}_{K,S}^times$ in the computer algebra package SageMath. This paper outlines the mathematical basis for the implementation. We discuss and reference the results of extensive computations, including exponent bounds for solutions in many fields of small degree for small sets $S$. As an application, we prove an asymptotic version of Fermats Last Theorem for totally real cubic number fields with bounded discriminant where 2 is totally ramified. In addition, we use the implementation to find all solutions to some cubic Ramanujan-Nagell equations.
rate research
Read More
A new technique was recently developed to approximate the solution of the Schroedinger equation. This approximation (dubbed ERS) is shown to yield a better accuracy than the WKB-approximation. Here, we review the ERS approximation and its application to one and three-dimensional systems. In particular, we treat bound state solutions. We further focus on random potentials in a quantum wire and discuss the solution in the context of Anderson localization.
Quadratic functions have applications in cryptography. In this paper, we investigate the modular quadratic equation $$ ax^2+bx+c=0 quad (mod ,, 2^n), $$ and provide a complete analysis of it. More precisely, we determine when this equation has a solution and in the case that it has a solution, we not only determine the number of solutions, but also give the set of solutions in $O(n)$ time. One of the interesting results of our research is that, when this equation has a solution, then the number of solutions is a power of two.
We describe the completed local rings of the trianguline variety at certain points of integral weights in terms of completed local rings of algebraic varieties related to Grothendiecks simultaneous resolution of singularities. We derive several local consequences at these points for the trianguline variety: local irreducibility, description of all local companion points in the crystalline case, combinatorial description of the completed local rings of the fiber over the weight map, etc. Combined with the patched Hecke eigenvariety (under the usual Taylor-Wiles assumptions), these results in turn have several global consequences: classicality of crystalline strictly dominant points on global Hecke eigenvarieties, existence of all expected companion constituents in the completed cohomology, existence of singularities on global Hecke eigenvarieties.
We study several variants of Euler sums by using the methods of contour integration and residue theorem. These variants exhibit nice properties such as closed forms, reduction, etc., like classical Euler sums. In addition, we also define a variant of multiple zeta values of level 2, and give some identities on relations between these variants of Euler sums and the variant of multiple zeta values.
A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their non-existence is also not proved. This is an old unsolved mathematical problem. Three mathematical propositions have been recently associated with the cuboid problem. They are known as three cuboid conjectures. These three conjectures specify three special subcases in the search for perfect cuboids. The case of the second conjecture is associated with solutions of a tenth degree Diophantine equation. In the present paper a fast algorithm for searching solutions of this Diophantine equation using modulo primes seive is suggested and its implementation on 32-bit Windows platform with Intel-compatible processors is presented.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
