相关论文: The Prouhet-Tarry-Escott problem for Gaussian inte…

For given positive integers $m$ and $n$ with $m<n$, the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$th moments for $1\leq k\leq m$; in the ideal case one requires…

This paper explores the Prouhet-Tarry-Escott problem (PTE), the Generalized PTE problem (GPTE), and the Fermat form of Generalized PTE problem (FPTE). The GPTE problem extends the PTE problem by allowing different sets of exponents, while…

In this paper we describe a new method of obtaining ideal solutions of the well-known Tarry-Escott problem, that is, the problem of finding two distinct sets of integers $x_i,\;i=1,\,2,\,\dots,\,k+1$ and $y_i,\;i=1,\,2,\,\dots,\,k+1$ such…

The notion of ellipsoidal design was first introduced by Pandey (2022) as a full generalization of spherical designs on the unit circle $S^1$. In this paper, we elucidate the advantages of examining the connections between ellipsoidal…

In this paper we obtain four new parametric ideal solutions of the Tarry-Escott problem of degree 7, that is, of the simultaneous diophantine equations, $\sum_{i=1}^8x_i^r=\sum_{i=1}^8y_i^r,\;r=1,\,2,\,\dots,\,7$. While all the known…

The famous Prouhet-Tarry-Escott problem seeks collections of mutually disjoint sets of non-negative integers having equal sums of like powers. In this paper we present a new proof of the solution to this problem by deriving a generalization…

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…

In this paper we obtain new parametric ideal solutions of the Tarry-Escott problem of degrees 2, 3 and 5, that is, of the diophantine systems $\sum_{i=1}^{k+1}x_i^j=\sum_{i=1}^{k+1}y_i^j,\;j=1,\,2,\,\dots,\,k$, when $k$ is 2, 3 or 5. When…

We elucidate, for the first time, a novel group-theoretic structure that arises from certain solutions of the $n$-dimensional Prouhet--Tarry--Escott problem of degree $2$ and size $n$. We prove that the group is isomorphic to the orthogonal…

We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson-Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class of…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

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…

Given integers $1\leq k<n$, the Gusein-Zade version of a generalized secretary problem is to choose one of the $k$ best of $n$ candidates for a secretary, which are interviewing in random order. The stopping rule in the selection is based…

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…

A comprehensive convergence and stability analysis of some probabilistic numerical methods designed to solve Cauchy-type inverse problems is performed in this study. Such inverse problems aim at solving an elliptic partial differential…

We present new methods of generating Prouhet-Tarry-Escott partitions of arbitrarily large regularity. One of these methods generalizes the construction of the Thue-Morse sequence to finite alphabets with more than two letters. We show how…

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with…

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

We introduce a simple, rigorous, and unified framework for solving nonlinear partial differential equations (PDEs), and for solving inverse problems (IPs) involving the identification of parameters in PDEs, using the framework of Gaussian…