Related papers: Linear complexity problems of level sequences of E…

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…

The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…

Let $\Delta= \sum_{m=0}^\infty q^{(2m+1)^2} \in \mathbb{F}_2[[q]]$ be the reduction mod 2 of the $\Delta$ series. A modular form $f$ modulo $2$ of level 1 is a polynomial in $\Delta$. If $p$ is an odd prime, then the Hecke operator $T_p$…

Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…

We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given by Grigoriev [10] for Riccatti…

For all positive powers of primes $p\geq 5$, we prove the existence of infinitely many linear congruences between the exponents of twisted Borcherds products arising from a suitable scalar-valued weight $1/2$ weakly holomorphic modular form…

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

We study variants of the Erd\H os distance problem and dot products problem in the setting of the integers modulo $q$, where $q = p^{\ell}$ is a power of an odd prime.

Let $p$ be a prime number. We study the slopes of $U_p$-eigenvalues on the subspace of modular forms that can be transferred to a definite quaternion algebra. We give a sharp lower bound of the corresponding Newton polygon. The computation…

Let $p$ be an odd prime and let $a,m$ be integers with $a>0$ and $m \not\equiv0\pmod p$. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ mod $p^2$ for $d=0,1$; for example,…

We introduce a method for solving Calder\'on type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain…

Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…

The boundary value problem is examined for the system of elliptic equations of from $-\Delta u + A(x)u = 0 \quad\text{in} \Omega,$ where $A(x)$ is positive semidefinite matrix on $\mathbb{R}^{{k}\times{k}},$ and $\frac{\partial u}{\partial…

Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $\max\{c^\top x \colon A x = b,\, x \in \mathbb{Z}^n_{\geq 0}\}$, where all the entries of $A,b,c$ are integer, parameterized by the…

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

We present some regularity results on the gradient of the weak or entropic-renormalized solution $u$ to the homogeneous Dirichlet problem for the quasilinear equations of the form \begin{equation*}\label{p-laplacian_eq} -{\rm div~}(|\nabla…

We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…

We examine canonical bases for weakly holomorphic modular forms of weight $0$ and level $p = 2, 3, 5, 7, 13$ with poles only at the cusp at $\infty$. We show that many of the Fourier coefficients for elements of these canonical bases are…

This article studies the inverse problem of recovering a nonlinearity in an elliptic equation $\Delta u + a(x,u) = 0$ from boundary measurements of solutions. Previous results based on first order linearization achieve this under a sign…