Related papers: A robust implementation for solving the $S$-unit e…

Let A be a commutative domain containing Z which is finitely generated as a Z-algebra, and let a,b,c be non-zero elements of A. It follows from work of Siegel, Mahler, Parry and Lang that the equation (*) ax+by=c has only finitely many…

The new method of solving quantum mechanical problems is proposed. The finite, i.e. cut off, Hilbert space is algebraically implemented in the computer code with states represented by lists of variable length. Complete numerical solution of…

We present a new open source implementation in the SageMath computer algebra system of algorithms for the numerical solution of linear ODEs with polynomial coefficients. Our code supports regular singular connection problems and provides…

In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra and number theory.

We show how to effectively solve 5-term $S$-unit equations when the set of primes $S$ has cardinality at most 3, and use this to provide an explicit answer to an old question of D.J. Newman on representations of integers as sums of…

In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra, geometry and number theory

Let F be a totally real number field of odd degree. We prove several purely local criteria for the asymptotic Fermat's Last Theorem to hold over F, and also for the non-existence of solutions to the unit equation over F. For example, if 2…

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

In [Kim05], Kim gave a new proof of Siegel's Theorem that there are only finitely many $S$-integral points on $\mathbb P^1_{\mathbb Z}\setminus\{0,1,\infty\}$. One advantage of Kim's method is that it in principle allows one to actually…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. Let $\mathcal{N}_K$ be the set of positive integers $n$ such that there exist units $\varepsilon, \delta \in \mathcal{O}_K^\times$ satisfying $\varepsilon + \delta = n$. We…

Making use of a newly developed package in the computer mathematics system SageMath, we show how to perform a full asymptotic analysis of certain types of sums that occur frequently in combinatorics, including explicit error bounds. We…

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

Let K be a number field and let S be a finite set of places of K which contains all the Archimedean places. For any f(z) in K(z) of degree d at least 2 which is not a d-th power in \bar{K}(z), Siegel's theorem implies that the image set…

Recent attempts at studying the Fermat equation over number fields have uncovered an unexpected and powerful connection with $S$-unit equations. In this expository paper we explain this connection and its implications for the asymptotic…

We develop an effective version of the Chabauty--Kim method which gives explicit upper bounds on the number of $S$-integral points on a hyperbolic curve in terms of dimensions of certain Bloch--Kato Selmer groups. Using this, we give a new…

A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…

Finite unions of convex sets are a central object of study in discrete and computational geometry. In this paper we initiate a systematic study of complements of such unions -- i.e., sets of the form $S=\mathbb{R}^d \setminus (\cup_{i=1}^n…

We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…

Among other results, we prove that if $I$ is a monomial ideal of $S=K[x_1,\ldots,x_n]$, where $K$ is a field, and $a\geq b-1\geq0$ are integers such that $a+b\leq\mathrm{proj~dim}(S/I)$, then $$t_{a+b}\leq…