English
Related papers

Related papers: A new approach to the Tarry-Escott problem

200 papers

A new numerical method for an inverse problem for an elliptic equation with unknown potential is proposed. In this problem the point source is running along a straight line and the source-dependent Dirichlet boundary condition is measured…

Numerical Analysis · Mathematics 2008-09-24 Hua Shan , M. V. Klibanov , Jianzhong Su , Natee Pantong , Hanli Liu

The formal derivatives of the Yang-Baxter equation with respect to its spectral parameters, evaluated at some fixed point of these parameters, provide us with two systems of differential equations. The derivatives of the $R$ matrix…

Exactly Solvable and Integrable Systems · Physics 2021-07-07 R. S. Vieira , A. Lima-Santos

The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…

High Energy Physics - Phenomenology · Physics 2011-06-21 Lars Sonnenschein

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

Number Theory · Mathematics 2016-04-11 László Tóth

In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…

Number Theory · Mathematics 2025-03-04 Maher Mamah

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…

Discrete Mathematics · Computer Science 2013-11-18 M. A. Nyblom , C. D. Evans

In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…

Statistics Theory · Mathematics 2007-06-13 Ana K. Fermin , Carenne Ludena

Let k>=2 and let (Q_{n}^{(k)})_{n>=2-k} be the k-generalized Pell sequence defined by Q_{n}^{(k)}=2Q_{n-1}^{(k)}+Q_{n-2}^{(k)}+...+Q_{n-k}^{(k)} for n>=2 with initial conditions Q_{-(k-2)}^{(k)}=Q_{-(k-3)}^{(k)}=...=Q_{-1}^{(k)}=0,…

Number Theory · Mathematics 2022-09-12 Zafer Şiar , Refik Keskin

A new numerical method for solving a scalar ordinary differential equation with a given initial condition is introduced. The method is using a numerical integration procedure for an equivalent integral equation and is called in this paper…

Numerical Analysis · Mathematics 2011-09-06 Alexander Lozovskiy

By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…

General Mathematics · Mathematics 2015-04-20 Mamuka Meskhishvili

The Kaczmarz method for solving a linear system $Ax = b$ interprets such a system as a collection of equations $\left\langle a_i, x\right\rangle = b_i$, where $a_i$ is the $i-$th row of $A$, then picks such an equation and corrects $x_{k+1}…

Numerical Analysis · Mathematics 2021-09-15 Stefan Steinerberger

We discuss the problem of finding distinct integer sets $\{x_1,x_2,...,x_n\}$ where each sum $x_i+x_j, i \ne j$ is a square, and $n \le 7$. We confirm minimal results of Lagrange and Nicolas for $n=5$ and for the related problem with…

Number Theory · Mathematics 2009-09-10 Allan J. MacLeod

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

Computational Geometry · Computer Science 2025-11-04 Ke Chen , Adrian Dumitrescu

In his book "250 Problems in Elementary Number Theory", W.Sierpinski shows that the numbers 1+2^(2^n)+2^(2^n+1) are divisible by 21; for n=1,2,.... In this paper, we prove a similar but more general result.Consider the natural numbers of…

General Mathematics · Mathematics 2008-06-10 Konstantine "Hermes" Zelator

In this work, we discuss and compare three methods for the numerical approximation of constant- and variable-coefficient diffusion equations in both single and composite domains with possible discontinuity in the solution/flux at…

Numerical Analysis · Mathematics 2021-11-17 Gustav Ludvigsson , Kyle R. Steffen , Simon Sticko , Siyang Wang , Qing Xia , Yekaterina Epshteyn , Gunilla Kreiss

The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the…

Number Theory · Mathematics 2017-02-01 Victor Volfson

Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…

Analysis of PDEs · Mathematics 2019-06-06 Phuong Mai Nguyen , Loc Hoang Nguyen

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

Number Theory · Mathematics 2012-06-29 Ruslan Sharipov

In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…

General Mathematics · Mathematics 2009-09-09 Rom Varshamov , Armen Bagdasaryan

We study the query complexity of finding a Tarski fixed point over the $k$-dimensional grid $\{1,\ldots,n\}^k$. Improving on the previous best upper bound of $\smash{O(\log^{\lceil 2k/3\rceil} n)}$ [FPS20], we give a new algorithm with…

Computer Science and Game Theory · Computer Science 2022-05-24 Xi Chen , Yuhao Li