相关论文: SPM Bulletin 10
This festive issue concludes the civilian year 2008 with details on a special issue of Topology and its Applications dedicated to SPM, and with a quite large list of research announcements.
We study a 2+2 body problem introduced in a previous paper as the circular double Sitnikov problem. Since the secondary bodies are moving on the same perpendicular line where evolve the primaries, almost every solution is a collision orbit.…
The amount of information in satisfiability problem (SAT) is considered. SAT can be polynomial-time solvable when the solving algorithm holds an exponential amount of information. It is also established that SAT Kolmogorov complexity is…
We consider solutions of the 2x2 matrix Hamiltonians of the physical systems within the context of the su(2) and su(1,1) Lie algebra. Our technique is relatively simple when compared with the others and treats those Hamiltonians which can…
The manual contains (in Russian) solutions of 230 problems that were used by the author for a number of years at the tutorial seminars in the first year undergraduate course in Mechanics and special relativity at Novosibirsk State…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…
We present various analytic and number theoretic results concerning the #SAT problem as reflected when reduced into a #PART problem. As an application we propose a heuristic to probabilistically estimate the solution of #SAT problems.
Some symmetry problems are formulated and solved. New simple proofs are given for the earlier studied symmetry problems.
Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of "Yes," whereas Huffman codewords need not obey this constraint. We bring resolution…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
We study the Parallel Task Scheduling problem $Pm|size_j|C_{\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \geq 5$, while it is solvable in pseudo-polynomial time for each $m \leq 3$.…
We compute the number of solutions to the Skolem pairings problem, S(n), and to the Langford variant of the problem, L(n). These numbers correspond to the sequences A059106, and A014552 in Sloane's Online Encyclopedia of Integer Sequences.…
Polynome codes and code evaluation; arithmetical theory frames; $\mu$-recursive race for decision; decision correctness; decision termination; correct termination in theory $T = PR$ of Primitive Recursion; comparison with the negative…
In addition to announcements of several new papers, this issue contains a brief personal memorandum for Misha Matveev. The issue also announces the coming SPM meeting (June 2012).
We provide both human and computer (even better collaboration between the two) proofs to four recent American Mathematical Monthly problems, namely problem 11897, problem 11899, problem 11916, and problem 11928. We also show that problem…
We show two results of mean value problem, Smale's mean value problem is comprehensively solved in this paper.
We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…
We consider semidefinite programming (SDP) approaches for solving the maximum satisfiability problem (MAX-SAT) and the weighted partial MAX-SAT. It is widely known that SDP is well-suited to approximate the (MAX-)2-SAT. Our work shows the…
We study interactions between Skolem Arithmetic and certain classes of Constraint Satisfaction Problems (CSPs). We revisit results of Glass er et al. in the context of CSPs and settle the major open question from that paper, finding a…
The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…