Related papers: Bounds for solution of linear diophantine equation…

We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…

A set of $m$ distinct nonzero rationals $\{a_1, a_2,\ldots, a_m\}$ such that $a_i a_j+1$ is a perfect square for all $1\le i <j \le m$, is called a rational Diophantine $m$-tuple. If in addition, $a_i^2+1$ is a perfect square for $1\le i\le…

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…

We shall study non-linear extremal problems in Bergman space $\mathcal{A}^2(\mathbb{D})$. We show the existence of the solution and that the extremal functions are bounded. Further, we shall discuss special cases for polynomials,…

The focus of the paper is on the maximal dimension of affine subspaces of nilpotent $n \times n $ matrices with fixed rank. In particular we obtain two results in the "border" cases rank equal to $n-1$ and rank equal to $1$.

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

We study the Diophantine equation of type $U_n(x)=V_m(y)$, where $(U_n)_{n\geq 0}$ and $(V_m)_{m\geq 0}$ are polynomial power sums defined over a number field $K$. By applying the finiteness criterion of Bilu and Tichy, we show under…

In this article we present several necessary and sufficient conditions for the existence of Hermitian positive definite solutions of nonlinear matrix equations of the form $X^s + A^*X^{-t}A + B^*X^{-p}B = Q$, where $ s, t, p \geq 1$, $ A,…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

In this paper, we show that the equation $\varphi(|x^{m}-y^{m}|)=|x^{n}-y^{n}|$ has no nontrivial solutions in integers $x,y,m,n$ with $xy\neq0, m>0, n>0$ except for the solutions $(x,y,m,n)=((2^{t-1}\pm1),-(2^{t-1}\mp1),2,1),…

We give examples of regular boundary data for the Dirichlet problem for the Complex Homogeneous Monge-Amp\`ere Equation over the unit disc, whose solution is completely degenerate on a non-empty open set and thus fails to have maximal rank.

The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x…

We study the matrix equation $XA-AX=X^p$ in $M_n(K)$ for $1< p <n$. It is shown that every matrix solution $X$ is nilpotent and that the generalized eigenspaces of $A$ are $X$-invariant. For $A$ being a full Jordan block we describe how to…

We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are…

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

We consider hyper- and superelliptic equations $f(x)=by^m$ with unknowns x,y from the ring of S-integers of a given number field K. Here, f is a polynomial with S-integral coefficients of degree n with non-zero discriminant and b is a…

Given three positive integers $a,b,c$, a proportionally modular Diophantine inequality is an expression of the form $ax \mod{b} \le cx$. Our aim is to give a recursive formula for the least solution to such an inequality. We then use the…