Related papers: SPM Bulletin 10
We propose a new approach to solve an NP complete problem by means of stochastic limit.
In this paper we give a complete solution of the following "polynomial moment problem" which arose about 10 years ago in connection with Poincare's center-focus problem. For a given polynomial P(z) to describe polynomials Q(z) orthogonal to…
In this article, we consider the equation x^2+19^{m}=y^n, n>2, m>0. We find the solutions of the title equation for not only 2 \mid m but also 2\notdividesm.
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…
Simple proofs of the midpoint, trapezoidal and Simpson's rules are proved for numerical integration on a compact interval. The integrand is assumed to be twice continuously differentiable for the midpoint and trapezoidal rules, and to be…
By creating some new concepts and methods: checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, 2-unit layer and 3-unit layer, redundant units, and destroying…
In the papers Ziegler(2001) and Goldstein(2012) it was previously shown that any subset of the Boolean cube $ S \subset \{0,1\}^n $ for $ n \leq 9 $ can be partitioned into $n+1$ parts of smaller diameter, i.e., the Borsuk conjecture holds…
Given $2n$ points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is $NP$-complete to decide if a partial matching can be augmented to a perfect one, via a reduction…
The relativistic scattering of a spin-1/2 particle from an infinitely long solenoid is considered in the framework of covariant perturbation theory. The first order term agrees with the corresponding term in the series expansion of the…
This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.
Boolean Satisfiability (SAT) problems are expressed as mathematical formulas. This paper presents a matrix representation for these SAT problems. It shows how to use this matrix representation to get the full set of valid satisfying…
We provide a precise statement and self contained proof of a Sobolev inequality (cf. [A, page 236 and page 237]) stated in the original paper. Higher order and fractional inequalities are treated as well.
We introduce an algebraic formula producing infinitely many exact solutions of the constant astigmatism equation $ z_{yy} + ({1}/{z})_{xx} + 2 = 0 $ from a given seed. A construction of corresponding surfaces of constant astigmatism is then…
In 1855 H. J. S. Smith proved Fermat's two-square using the notion of palindromic continuants. In his paper, Smith constructed a proper representation of a prime number $p$ as a sum of two squares, given a solution of…
The exactly and quasi-exactly solvable problems for spin one-half in one dimension on the basis of a hidden dynamical symmetry algebra of Hamiltonian are discussed. We take the supergroup, $OSP(2|1)$, as such a symmetry. A number of exactly…
We establish conditions guaranteeing that all eventually positive increasing solutions of a half-linear delay differential equation are regularly varying and derive precise asymptotic formulae for them. The results here presented are new…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…