English
Related papers

Related papers: Hilbert's tenth problem for systems of diagonal qu…

200 papers

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Symbolic Computation · Computer Science 2024-10-08 Sergei Abramov , Gleb Pogudin

We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable is allowed, and (ii) first-order variables do not occur. We…

Logic in Computer Science · Computer Science 2026-04-15 David M. Cerna , Julian Parsert

We prove that Hilbert's Tenth Problem for a ring of integers in a number field K has a negative answer if K satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one…

Number Theory · Mathematics 2007-05-23 Gunther Cornelissen , Thanases Pheidas , Karim Zahidi

We consider the following variant of the Mortality Problem: given $k\times k$ matrices $A_1, A_2, \dots,A_{t}$, does there exist nonnegative integers $m_1, m_2, \dots,m_t$ such that the product $A_1^{m_1} A_2^{m_2} \cdots A_{t}^{m_{t}}$ is…

Discrete Mathematics · Computer Science 2019-06-28 Paul C. Bell , Igor Potapov , Pavel Semukhin

We say that a system of differential equations d^2x(t)/dt^2=Adx(t)/dt+Bx(t)+Cu(t), in which A and B are m-by-m complex matrices and C is an m-by-n complex matrix, is rigid if it can be reduced by substitutions x(t)=Sy(t),…

Representation Theory · Mathematics 2007-10-04 M. Isabel Garcia-Planas , M. Dolors Magret , Vladimir V. Sergeichuk , Nadya A. Zharko

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Number Theory · Mathematics 2026-02-13 Eteri Samsonadze

For linear differential equations of the form $u'(t)=[A + B(t)] u(t)$, $t\geq0$, with a possibly unbounded operator $A$, we construct and deduce error bounds for two families of second-order exponential splittings. The role of quadratures…

Numerical Analysis · Mathematics 2024-05-08 Karolina Kropielnicka , Juan Carlos del Valle

The asymptotic behavior (such as convergence to an equilibrium, convergence to a 2-cycle, and divergence to infinity) of solutions of the following multi-parameter, rational, second order difference equation x_{n+1} =(ax_{n}^3+…

Dynamical Systems · Mathematics 2010-11-17 M. Shojaei

In this paper, we mainly consider the existence of infinitely many homoclinic solutions for a class of subquadratic second-order Hamiltonian systems $\ddot{u}-L(t)u+W_u(t,u)=0$, where $L(t)$ is not necessarily positive definite and the…

Dynamical Systems · Mathematics 2016-10-04 Xiang Lv

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

Logic in Computer Science · Computer Science 2018-05-07 Alexis Bès , Christian Choffrut

In this work we develop some fifth-order integrable coupled systems of weight $0$ and $1$ which possess seventh-order symmetry. We establish four new systems, where in some cases, related recursion operator and bi-Hamiltonian formulations…

Exactly Solvable and Integrable Systems · Physics 2016-08-19 Daryoush Talati , Abdul-Majid Wazwaz

For a second-order elliptic equation in divergence form we investigate conditions on the coefficients which imply that all solutions are Lipschitz continuous or differentiable at a given point. We assume the coefficients have modulus of…

Analysis of PDEs · Mathematics 2010-07-13 Vladimir Maz'ya , Robert McOwen

Using the technique of formative processes, I solve the decidability problem of MLS with unordered cartesian product in the positive. Moreover I give a pure combinatorial description of the satisfiable MLS with unordered cartesian…

Combinatorics · Mathematics 2019-02-28 Pietro Ursino

This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…

Data Structures and Algorithms · Computer Science 2018-04-17 Carlos Barrón-Romero

We show that for any positive integer $N$, there are only finitely many holomorphic eta quotients of level $N$, none of which is a product of two holomorphic eta quotients other than 1 and itself. This result is an analog of Zagier's…

Number Theory · Mathematics 2017-09-19 Soumya Bhattacharya

In the present paper we derive Liouville type results and existence of periodic solutions for $\chi^{(2)}$ type systems with non-homogeneous nonlinearities. Moreover, we prove both universal bounds as well as singularity and decay estimates…

Analysis of PDEs · Mathematics 2023-06-27 Aleks Jevnikar , Jun Wang , Wen Yang

We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sheldon Axler , Pamela Gorkin , Karl Voss

Investigating for interior regularity of viscosity solutions to the fully nonlinear elliptic equation $$F(x,u,\triangledown u,\triangledown ^2 u)=0,$$ we establish the interior $C^{1+1}$ continuity under the assumptions that $F$ is…

Analysis of PDEs · Mathematics 2007-05-23 G. C. Dong , B. J. Bian , Z. C. Guan

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…

Symbolic Computation · Computer Science 2024-06-18 Bertrand Teguia Tabuguia , James Worrell