Related papers: A modern solution to the Gion shrine problem
Recent researches on the solution of Schwinger-Dyson equations, as well as lattice simulations of pure QCD, suggest that the gluon propagator is massive. In this letter, we assume that the classical counterpart of this massive gluon field…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
The usual implement procedure for the reconstruction of secular equation for an effective Hamiltonian has been discussed and improved. A relative characteristic polynomial has been introduced for the effective Hamiltonian, to obtain a…
In this paper, we generalise an interesting geometry problem from the 1995 edition of the International Mathematical Olympiad (IMO) using analytic geometry tools.
Moment problems and orthogonal polynomials, both meant in a single real variable, belong to the oldest problems in Classical Analysis. They have been developing for over a century in two parallel, mostly independent streams. During the last…
Using an algebraic method for solving the wave equation in quantum mechanics, we encountered a new class of orthogonal polynomials on the real line. It consists of a four-parameter polynomial with continuous spectrum on the whole real line…
The Feynman checkerboard problem is an interesting path integral approach to the Dirac equation in `1+1' dimensions. I compare two approaches reported in the literature and show how they may be reconciled. Some physical insights may be…
This paper proposes a new gradient method to solve the large-scale problems. Theoretical analysis shows that the new method has finite termination property for two dimensions and converges R-linearly for any dimensions. Experimental results…
An open problem about two new families of orthogonal polynomials was posed by Alhaidari. Here we will identify one of them as Wilson polynomials. The other family seems to be new but we show that they are discrete orthogonal polynomials on…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
In this paper we review nine previous proposed and solved problems of elementary 2D geometry, and we extend them either from triangles to polygons or polyhedrons, or from circles to spheres (from 2D-space to 3D-space) and make some…
Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…
Algorithms for the computation of the forward and inverse geodesic problems for an ellipsoid of revolution are derived. These are accurate to better than 15 nm when applied to the terrestrial ellipsoids. The solutions of other problems…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
The property and gravitational field of global string of tachyon matter are investigated in a four dimentional approximately cylindrically-symmetric spacetime with a deficit angle. Especially, we give an exact solution of the tachyon field…
We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\exists\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial…
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…
We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…