Related papers: Polynomial Solutions Modulo $p^s$ of Differential …
We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…
This paper develops a probabilistic numerical method for solution of partial differential equations (PDEs) and studies application of that method to PDE-constrained inverse problems. This approach enables the solution of challenging inverse…
We consider the Gauss-Manin differential equations for hypergeometric integrals associated with a family of weighted arrangements of hyperplanes moving parallelly to themselves. We reduce these equations modulo a prime integer $p$ and…
It is well-known that for each fixed $n$ and $e$, the number of subgroups of index $p^e$ in $\mathbb{Z}^n$ is a polynomial in $p$. Is this true for \emph{subrings} in $\mathbb{Z}^n$ of index $p^e$? Let $f_n(k)$ denote the number of subrings…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…
In this paper we are interested in solving the Fermat-type equations x^5+y^5=dz^p where d is a positive integer and p a prime number $\ge 7$. We describe a new method based on modularity theorems which allows us to improve all the results…
Let $p$ be an odd prime number. We show that the modular isomorphism problem has a positive answer for finite $p$-groups whose center has index $p^3$, which is a strong contrast to the analogous situation for $p = 2$.
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…
One way of constructing explicit expressions of solutions of integrable systems of Partial Differential Equations (PDEs) goes via the Darboux method. This requires the construction of Darboux matrices. Here we introduce a novel algorithm to…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…
Recently Rather et al. \cite{NT} considered the generalized derivative and the generalized polar derivative and studied the relative position of zeros of generalized derivative and generalized polar derivative with respect to the zeros of…
We compute the action of the Steenrod algebra on generators of algebras of invariants of special linear group ${SL_n=SL(n,\mathbb Z/p)}$ in the polynomial algebra with $ p$ an odd prime number.
Using non-archimedean q-integrals on Zp defined in [15, 16], we define a new Changhee q-Euler polynomials and numbers which are different from those of Kim [7] and Carlitz [2]. We define generating functions of multiple q-Euler numbers and…
An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…
Let $F_1,\ldots,F_R$ be homogeneous polynomials with integer coefficients in $n$ variables with differing degrees. Write $\boldsymbol{F}=(F_1,\ldots,F_R)$ with $D$ being the maximal degree. Suppose that $\boldsymbol{F}$ is a nonsingular…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
The existence of sufficiently many finite order meromorphic solutions of a differential equation, or difference equation, or differential-difference equation, appears to be a good indicator of integrability. In this paper, we investigate…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…