English
Related papers

Related papers: SPM Bulletin 10

200 papers

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.

Number Theory · Mathematics 2019-02-21 Junsoo Ha , Kannan Soundararajan

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…

Computational Complexity · Computer Science 2023-05-26 Leif Eriksson , Victor Lagerkvist

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…

Combinatorics · Mathematics 2017-09-01 Ravi B. Boppana , Ron Holzman

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$…

Data Structures and Algorithms · Computer Science 2020-02-10 Mario Pennacchioni , Emanuele Munarini , Marco Mesiti

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…

Number Theory · Mathematics 2024-10-01 Domenico Cantone , Luca Cuzziol , Eugenio G. Omodeo

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…

Combinatorics · Mathematics 2021-06-01 Mihai Ciucu , Christian Krattenthaler

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…

History and Overview · Mathematics 2017-08-04 Eunice Krinsky , Serban Raianu , Alexander Wittmond

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…

Numerical Analysis · Mathematics 2012-03-28 Jose Rodriguez , Maurizio Ruggiu

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…

Combinatorics · Mathematics 2010-10-20 Gregory S. Warrington

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…

Discrete Mathematics · Computer Science 2024-09-23 Arnab Chatterjee , Amin Coja-Oghlan , Noela Müller , Connor Riddlesden , Maurice Rolvien , Pavel Zakharov , Haodong Zhu

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.

Differential Geometry · Mathematics 2009-10-02 Baris Coskunuzer

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…

Chaotic Dynamics · Physics 2015-05-30 Petr Braun

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…

Computation and Language · Computer Science 2016-04-06 Mrinmaya Sachan , Avinava Dubey , Eric P. Xing

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…

Analysis of PDEs · Mathematics 2016-10-20 Konstantinos Dareiotis

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…

Number Theory · Mathematics 2012-07-10 E. Yu. Lerner

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…

Machine Learning · Computer Science 2025-03-03 Kechen Li , Wenqi Zhu , Coralia Cartis , Tianbo Ji , Shiwei Liu

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…

Analysis of PDEs · Mathematics 2019-12-16 Leonid Chaichenets , Dirk Hundertmark , Peer Kunstmann , Nikolaos Pattakos

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…

Discrete Mathematics · Computer Science 2020-11-20 Max A. Deppert , Klaus Jansen , Kim-Manuel Klein

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…

Computational Complexity · Computer Science 2018-03-28 Wenxia Guo , Jin Wang , Majun He , Xiaoqin Ren , Wenhong Tian , Qingxian Wang