Related papers: Counting linear congruence systems with a fixed nu…

It is well-known that for $p=1, 2, 3, 7, 11, 19, 43, 67, 163$, the class number of $\mathbb{Q}(\sqrt{-p})$ is one. We use this fact to determine all the solutions of $x^2+p^m=4y^n$ in non-negative integers $x, y, m$ and $n$.

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

For any prime number $p$, positive integers $m, k, n$ satisfying ${\rm gcd}(p,n)=1$ and $\lambda_0\in \mathbb{F}_{p^m}^\times$, we prove that any $\lambda_0^{p^k}$-constacyclic code of length $p^kn$ over the finite field $\mathbb{F}_{p^m}$…

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 upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums. Such algorithms are useful in statistics and combinatorics.…

We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…

In [HLS], N. Hindman, I. Leader and D. Strauss proved the abundance for a matrix with rational entries. In this paper we proved it for the ring of Gaussian integers. We showed the result when the matrix is taken with entries from…

The system of equations \[ u_1p_1^2 + \ldots + u_sp_s^2 = 0 \] \[ v_1p_1^3 + \ldots + v_sp_s^3 = 0 \] has prime solutions $(p_1, \ldots, p_s)$ for $s \geq 12$, assuming that the system has solutions modulo each prime $p$. This is proved via…

Given a polynomial $Q(x_1,\cdots, x_t)=\lambda_1 x_1^{k_1}+\cdots +\lambda_t x_t^{k_t}$, for every $c\in \mathbb{Z}$ and $n\geq 2$, we study the number of solutions $N_J(Q;c,n)$ of the congruence equation $Q(x_1,\cdots, x_t)\equiv…

In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.

When a matrix A with n columns is known to be well approximated by a linear combination of basis matrices B_1,..., B_p, we can apply A to a random vector and solve a linear system to recover this linear combination. The same technique can…

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…

Let A= (a_{ij}) be a symmetric non-negative integer 2k x 2k matrix. A is homogeneous if a_{ij} + a_{kl}=a_{il} + a_{kj} for any choice of the four indexes. Let A be a homogeneous matrix and let F be a general form in C[x_1, \dots x_n] with…