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

Let $\theta$ be an arithmetic function and let $\mathcal{B}$ be the set of positive integers $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$, which satisfy $p_{j+1} \le \theta ( p_1^{\alpha_1}\cdots p_{j}^{\alpha_{j}})$ for $0\le j < k$. We show…

We study extremal problems for tuples of integers chosen from sets $A_i \subset [X_i,2X_i]$ for $1\le i\le k$, under large GCD and small LCM conditions. For the GCD problem, we extend the work of Green and Walker to higher dimensions.…

We propose an Euler particle transport (EPT) approach for generative learning. The proposed approach is motivated by the problem of finding an optimal transport map from a reference distribution to a target distribution characterized by the…

Inverse problems are often ill-posed, with solutions that depend sensitively on data. In any numerical approach to the solution of such problems, regularization of some form is needed to counteract the resulting instability. This paper is…

The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…

Recently V.Drinfeld formulated a number of problems in quantum group theory. In particular, he suggested to consider ``set-theoretical'' solutions of the quantum Yang-Baxter equation, i.e. solutions given by a permutation $R$ of the set…

Graph Crossing Number is a fundamental problem with various applications. In this problem, the goal is to draw an input graph $G$ in the plane so as to minimize the number of crossings between the images of its edges. Despite extensive…

In this work we present a numerical method for the Optimal Mass Transportation problem. Optimal Mass Transportation (OT) is an active research field in mathematics.It has recently led to significant theoretical results as well as…

In this paper, we consider the tensor completion problem representing the solution in the tensor train (TT) format. It is assumed that tensor is high-dimensional, and tensor values are generated by an unknown smooth function. The assumption…

A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.

Non-Gaussian L\'evy noises are present in many models for understanding underlining principles of physics, finance, biology and more. In this work, we consider the Fokker-Planck equation(FPE) due to one-dimensional asymmetric L\'evy motion,…

For the linear partial differential equation $P(\partial_x,\partial_t)u=f(x,t)$, where $x\in\mathbb{R}^n,\;t\in\mathbb{R}^1$, with $P(\partial_x,\partial_t)$ is $\prod^m_{i=1}(\frac{\partial}{\partial{t}}-a_iP(\partial_x))$ or…

We consider the solution of a generalized Exe Jahn-Teller Hamiltonian in the context of quasi-exactly solvable spectral problems. This Hamiltonian is expressed in terms of the generators of the osp(2,2) Lie algebra. Analytical expressions…

We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer $q\in [1,n]$, and receive a response comparing this integer to an integer randomly chosen…

The problem of estimating discovery probabilities originated in the context of statistical ecology, and in recent years it has become popular due to its frequent appearance in challenging applications arising in genetics, bioinformatics,…

The solutions of fractional differential equations (FDEs) have a natural singularity at the initial point. The accuracy of their numerical solutions is lower than the accuracy of the numerical solutions of FDEs whose solutions are…

Time of arrival refers to the time a particle takes after emission to impinge upon a suitably idealized detector surface. Within quantum theory, no generally accepted solution exists so far for the corresponding probability distribution of…

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…

We consider the problem of answering $k$ counting (i.e. sensitivity-1) queries about a database with $(\epsilon, \delta)$-differential privacy. We give a mechanism such that if the true answers to the queries are the vector $d$, the…