相关论文: SPM Bulletin 10

One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Constraint Satisfaction Problem CSP(G) is either NP--complete or…

In this paper, it is proved that, for $\gamma\in(\frac{317}{320},1)$, every sufficiently large odd integer can be written as the sum of nine cubes of primes, each of which is of the form $[n^{1/\gamma}]$. This result constitutes an…

Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a $k$-local ($k$-body) Hamiltonian is frustration-free, could be classified as being either in $\mathsf{P}$; or complete for $\mathsf{NP}$,…

Motivated by a WhattsApp message, we find out the integers $x> y\ge 1$ such that $(x+1)/(y+1)=(x\circ(y+1))/(y\circ (x+1))$, where $\circ$ means the concatenation of the strings of two natural numbers (for instance $783\circ 56=78356$). The…

There are four puzzling questions about by the magnitudes of neutrino mixings and mass splittings. A brief sketch is given of the various kinds of models of neutrino masses and how they answer these questions. Special attention is given to…

In this paper we study some solution techniques of differential-difference equation $$ y'(x) = y(x + 1/2)- y(x- 1/2),$$ first without an initial condition and then with some initial function $h$ defined on the unit interval $ [-1/2, 1/2]$.…

We study sign symmetric $P_{0,1}^+$-matrix completion problem. It is shown that any non-asymmetric incomplete digraph lacks sign symmetric $P_{0,1}^+$-completion, digraphs of order at most four are completely classified and finally…

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

Examples are given of solutions of the planar N-body problem which remain the same for at least two systems of masses with the same sum and same center of mass. The least value of N achieved up to now with this property is 474, a number…

The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…

We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the…

This review aims to provide a comprehensive update on the progress made on the Sequential Testing problem (STP) in the last 20 years after the review, [1] was published. Many studies have provided new theoretical results, extensions of the…

The purpose of this paper is to develop a new effective approach to higher-order mixing in the semisimple setting. We prove effective exponential mixing of all orders for partially hyperbolic algebraic actions, under a strong spectral-gap…

The following is an improved version of Chapter 12 of my book [Sm17]. Among others, we present a new unified approach to the Archimedean Positivstellens\"atze for quadratic modules and semirings in Section 12.4 and we add a number of new…

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

Necessary and sufficient conditions for the existence of an integer solution of the diophantine equation $m/n=1/x(\lambda)+1/y(\lambda)+1/z(\lambda)$ with $n=b+a\lambda$ are explicitly given for a,b coprime and a not a multiple of m . The…

In the past few decades there has been a good deal of papers which are concerned with optimization problems in different areas of mathematics (along 0-1 words, finite or infinite) and which yield - sometimes quite unexpectedly - balanced…

We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete

The Hamiltonian form of the (2+1) nonlinear integrable Schr\"odinger equation and the system of two (2+1) nonlinear analogue of the mKdV equation is proved. A well--posed Cauchy problem is formulated and the solvability of such a problem…