相关论文: SPM Bulletin 10

We show that there are arbitrarily large sets $S$ of $s$ primes for which the number of solutions to $a+1=c$ where all prime factors of $ac$ lie in $S$ has $\gg \exp( s^{1/4}/\log s)$ solutions.

Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of…

Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Holzman and Kleitman (1992) proved that at least 3/8 of these sums satisfy $|S| \le 1$. This 3/8 bound…

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a…

We present new, simple proofs for the enumeration of five of the ten symmetry classes of plane partitions contained in a given box. Four of them are derived from a simple determinant evaluation, using combinatorial arguments. The previous…

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

In this paper, an analytical method that solves the forward displacement problem of several common spherical parallel manipulators (SPMs) is presented. The method uses the the quaternion algebra to restate the problem as a system of four…

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…

We prove that throughout the satisfiable phase, the logarithm of the number of satisfying assignments of a random 2-SAT formula satisfies a central limit theorem. This implies that the log of the number of satisfying assignments exhibits…

Because of the relevance of the results, this paper is merged into the paper titled "On the Number of Solutions to Asymptotic Plateau Problem" (arXiv:math.DG/0505593) as a new section.

The two-point correlation function of chaotic systems with spin 1/2 is evaluated using periodic orbits. The spectral form factor for all times thus becomes accessible. Equivalence with the predictions of random matrix theory for the…

We provide a solution for elementary science test using instructional materials. We posit that there is a hidden structure that explains the correctness of an answer given the question and instructional materials and present a unified…

We prove a comparison theorem for the averages of the solutions of two exterior parabolic problems, the second being the "symmetrization" of the first one, by using approximation of the Schwarz symmetrization by polarizations, as it was…

In this paper we answer certain questions posed by V.I. Arnold, namely, we study periods of continued fractions for solutions of quadratic equations in the form $x^2+p x=q$ with integer $p$ and $q$, $p^2+q^2\le R^2$. Our results concern the…

This is a collection of teaching materials used in several Russian universities, schools, and mathematical circles. Most problems are chosen in such a way that in the course of the solution and discussion a reader learns important…

Large Language Models (LLMs) have achieved human-level proficiency across diverse tasks, but their ability to perform rigorous mathematical problem solving remains an open challenge. In this work, we investigate a fundamental yet…

We show the existence of weak solutions in the extended sense of the Cauchy problem for the cubic nonlinear Schr\"odinger equation in the modulation space $M_{p,q}^{s}(\mathbb R)$ where $1\leq q\leq2$, $2\leq p<\frac{10q'}{q'+6}$ and…

We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer $s$ that is specified by $n$ fixed remainders modulo integer divisors $a_1,\dots,a_n$ we consider…

In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…