Related papers: A binary quadratic Titchmarsh divisor problem

Unlike the Hamilton quaternion algebra, the split-quaternions contain nontrivial zero divisors. In general speaking, it is hard to find the solutions of equations in algebras containing zero divisor. In this paper, we manage to derive…

Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. The aim of this work is to drastically reduce the variables needed for…

We consider the problem -{\epsilon}^2\Delta_gu+u = |u|^{p-2}u in M, where (M,g) is a symmetric Riemannian manifold. We give a multiplicity result for antisymmetric changing sign solutions.

Let $p$ be a fixed odd prime and $Q(x,y,z)=ax^2+bxy+cy^2+dxz+eyz+fz^2$ be a fixed quadratic form in $\mathbb{Z}[x,y,z]$ which is non-degenerate in $\mathbb{F}_p[x,y,z]$ and $(a(4ac-b^2),p)=1.$ Let $(x_0,y_0,z_0)$ be a fixed point in…

In this paper, we develop a way to encode several NP-Complete problems in Abstract Argumentation to Quadratic Unconstrained Binary Optimization (QUBO) problems. In this form, a solution for a QUBO problem involves minimizing a quadratic…

In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…

We consider Sturm-Liouville equation $y^{\prime\prime}+(\lambda-q)y=0$ where $q\in L^{1}[0,a]$. We obtain various conditions on the Fourier coefficients of q such that the periodic eigenvalues having the form given by Titchmarsh are…

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We show that there is a special bijection between the indecomposable summands of the two modules which form a basic support $\tau$--tilting pair and the indecomposable summands of the two modules which form another basic support…

We consider small solutions of quadratic congruences of the form $x_1^2+\alpha_2x_2^2+\alpha_3x_3^2\equiv 0 \bmod{q}$, where $q=p^m$ is an odd prime power. Here, $\alpha_2$ is arbitrary but fixed and $\alpha_3$ is variable, and we assume…

A classification of ordinary differential equations and finite-difference equations in one variable having polynomial solutions (the generalized Bochner problem) is given. The method used is based on the spectral problem for a polynomial…

In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…

We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set…

We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}^{\lfloor n/2\rfloor}{m+k\brack k}_{q^2}{m+1\brack n-2k}_{q} q^{n-2k\choose 2} &={m+n\brack…

The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…

In this paper, we deal with the following $(p,q)$-fractional problem $$ (-\Delta)^{s_{1}}_{p}u +(-\Delta)^{s_{2}}_{q}u=\lambda P(x)|u|^{k-2}u+\theta|u|^{p_{s_{1}}^{*}-2}u \, \mbox{ in }\, \Omega,\qquad u=0\, \mbox{ in }\, \mathbb{R}^{N}…

Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We prove bilinear inequalities for differential operators in $\mathbb{R}^2$. Such type inequalities turned out to be useful for anisotropic embedding theorems for overdetermined systems and the limiting order summation exponent. However,…