相关论文: How to compute $\sum 1/n^2$ by solving triangles
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
A hitherto difficult and unsolved issue in plasma physics is how to give a general numerical solver for complicated plasma dispersion relation, although we have long known the general analytical forms. We transform the task to a full-matrix…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance…
A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph. Given an undirected graph $G$, one can query the degree of a vertex, the existence of an edge between…
Fast summation refers to a family of techniques for approximating $O(N^2)$ sums in $O(N\log{N})$ or $O(N)$ time. These techniques have traditionally found wide use in astrophysics and electrostatics in calculating the forces in a $N$-body…
We present an algorithm for computing all the solutions in not necessarily distinct integers to the decomposition of the unit into a sum of unit fractions with denominators $p^a.q^b$ where $p$ and $q$ are two distinct primes, each appearing…
At present, only some special differential equations have explicit analytical solutions. In general, no one thinks that it is possible to analytically find the exact solution of nonlinear equations. In this article based on the idea that…
We study the sum of divisors of the quadratic form $m_1^2+m_2^2+m_3^2$. Let $$S_3(X)=\sum_{1\le m_1,m_2,m_3\le X}\tau(m_1^2+m_2^2+m_3^2).$$ We obtain the asymptotic formula $$S_3(X)=C_1X^3\log X+ C_2X^3+O(X^2\log^7 X),$$ where $C_1,C_2$ are…
Recently, E. Samsonadze (arXiv:2411.11859v1) has given an explicit formula for the sums of powers of integers $S_k(n) = 1^k +2^k +\cdots + n^k$. In this short note, we show that Samsonadze's formula corresponds to a well-known formula for…
We provide numerical procedures for possibly best evaluating the sum of positive series. Our procedures are based on the application of a generalized version of Kummer's test.
The main purpose of the present article is to give some new Hilbert's sum type inequalities, which in special cases yield the classical Hilbert's inequalities. Our results provide some new estimates to these types of inequalities.
We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
A formula to construct classic exact solutions to Tricomi partial differential equation. The steps to obtain this formula require only elementary resolution of a simple system of first order PDEs.
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
A novel approach to an old symmetry problem is developed. A new proof is given for the following symmetry problem, studied earlier.
Let $N$ be any fixed positive integer and define \begin{align*} S_N(x)=\sum_{m, n \leq x}d(n^2+Nm^2), \end{align*} where $d(n)$ is the divisor function. We evaluate asymptotically $S_N(x)$ for several $N$, extending earlier works of Gafurov…
IIn computational geometry, the construction of essential primitives like convex hulls, Voronoi diagrams and Delaunay triangulations require the evaluation of the signs of determinants, which are sums of products. The same signs are needed…