Related papers: Restricted linear congruences
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Let $T_o(k)$ denote the number of solutions of $\sum_{i=1}^k\frac 1{x_i}=1$ in odd numbers $1<x_1<x_2<...<x_k$. It is clear that $T_o(2k)=0$. For distinct primes $p_1, p_2,..., p_t$, let $S(p_1, p_2,...,…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
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,…
We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…
It is known that, for any positive non-square integer multiplier $k$, there is an infinity of multiples of triangular numbers which are triangular numbers. We analyze the congruence properties of the indices $\xi$ of triangular numbers that…
For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…
The Maximum Flow Problem with Conflict Constraints is a generalization that adds conflict constraints to a classical optimization problem on networks used to model several real-world applications. In the last few years several approaches,…
By writing the complete set of $3 + 1$ (ADM) equations for linearized waves, we are able to demonstrate the properties of the initial data and of the evolution of a wave problem set by Alcubierre and Schutz. We show that the gauge modes and…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
In 2016, Chandrasekaran, V\'egh, and Vempala published a method to solve the minimum-cost perfect matching problem on an arbitrary graph by solving a strictly polynomial number of linear programs. However, their method requires a strong…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…
We determine the explicit formulas for the sum of products of homogeneous multiple harmonic sums $\sum_{k=1}^n \prod_{j=1}^r H_k(\{1\}^{\lambda_j})$ when $\sum_{j=1}^r \lambda_j\leq 5$. We apply these identities to the study of two…
Preconditioned iterative methods for numerical solution of large matrix eigenvalue problems are increasingly gaining importance in various application areas, ranging from material sciences to data mining. Some of them, e.g., those using…
We develop a new discrete mathematical model which includes the classical Sudoku puzzle, Latin Squares and gerechte designs. This problem is described by integer equations and a special type of inequality constraint. We consider solutions…
Starting with Ramanujan's famous taxicab problem, we can study the solvability of the equations $p^n+q^n=r^n+s^n$ and, more generally, $p_1^{k_1}+\dots+p_m^{k_m}=0$ among polynomials.
We study congruences involving truncated hypergeometric series of the form_rF_{r-1}(1/2,...,1/2;1,...,1;\lambda)_{(mp^s-1)/2} = \sum_{k=0}^{(mp^s-1)/2} ((1/2)_k/k!)^r \lambda^k where p is a prime and m, s, r are positive integers. These…
Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…
To each i, j belonging to some set of integers, attach the integer a(i,j). Are there integers x(i) such that x(j)-x(i) is congruent to a(i,j) mod (i,j)? A necessary condition is that a(i,j)+a(j,k) be congruent to a(i,k) mod (i,j,k). This…