Related papers: A problem of Stanislaw Saks
The exact solutions of the Schrodinger equation with the hyperbolic Scarf potential reported in the literature so far rely upon Jacobi polynomials with imaginary arguments and parameters. We here show that upon a suitable factorization…
The solutions, in terms of orthogonal polynomials, of Dirac equation with analytically solvable potentials are investigated within a novel formalism by transforming the relativistic equation into a Schrodinger like one. Earlier results are…
Highly localized explicit solutions to multidimensional wave and Klein--Gordon--Fock equations are presented. Their Fourier transform is also found explicitly. Solutions depend on a set of parameters, and demonstrate astigmatic properties.…
Exact solutions of the relativistic many-body problem are presented
The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the…
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
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…
The article provides a counterexample to a conjecture by Blocki-Zwonek.
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with…
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
The paper [1] considers a spherical cloak described by three radially varying acoustical quantities. For a given radial mass density in the cloak the question posed is whether the remaining two parameters, tangential density and…
For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…
We propose an elemantary approach to Zudilin's q-question about Schmidt's problem [Electron. J. Combin. 11 (2004), #R22], which has been solved in a previous paper [Acta Arith. 127 (2007), 17--31]. The new approach is based on a q-analogue…
In this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack…
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…
The Christoffel problem is equivalent to the existence of convex solutions to the Laplace equation on the unit sphere $S^n$. Necessary and sufficient conditions have been found by Firey and Berg, using the Green function of the Laplacian on…
The recent extensive work on different approaches to the Schottky problem has produced marked progress on several fronts. At the same time, it has become apparent that there exist very close connections between the various characterizations…
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values…
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…