Related papers: Polynomial parametrizations of length $4$ B\"uchi …

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric…

We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…

We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…

Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…

In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this…

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b…

We construct four infinite families of chiral $3$-polytopes of type $\{4, 8\}$, with $1024m^4$, $2048m^4$, $4096m^4$ and $8192m^4$ automorphisms for every positive integer $m$, respectively. The automorphism groups of these polytopes are…

In this paper we give a different proof of Kuz'min's result on the number of irreducible polynomials with the first two coefficients fixed. Our technique is to relate the question to the number of points on a curve, and to calculate the…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…

In this paper we give for any integer l > 2 a numerical criterion ensuring the existence of a chain of length l of lines through two general points of an irreducible variety X in P^N, involving the degrees and the number of homogeneous…

We generalise our earlier work on the number of squares in binary recurrence sequences, $\left\{ y_{k} \right\}_{k \geq -\infty}$. In the notation of our previous papers, here we consider the case when $N_{\alpha}$ is any negative integer…

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Let Q be a non-singular diagonal quadratic form in at least four variables. We provide upper bounds for the number of integer solutions to the equation Q=0, which lie in a box with sides of length 2B, as B tends to infinity. The estimates…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

We give an infinite family of congruent number elliptic curves, each with rank at least two, which are related to integral solutions of $m^2=n^2+nl+l^2$.

Our primary motivation is existence and uniqueness for the obstacle problem on graphs. That is, we look for unique solutions to the problem $Lu = \chi_{\{u>0\}}$, where $L$ is the Laplacian matrix associated to a graph, and $u$ is a…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

We construct two infinite families of locally toroidal chiral polytopes of type $\{4,4,4\}$, with $1024m^2$ and $2048m^2$ automorphisms for every positive integer $m$, respectively. The automorphism groups of these polytopes are solvable…