Related papers: A problem of Stanislaw Saks
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.
Following the work of Friedman, Koerwien, Nies and Schlicht we positively answer their question whether the Scott rank of Polish metric spaces is countable.
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…
We find the form of the potential depending on the coordinates and the time such that a solution, $S$, of the Hamilton--Jacobi equation yields an exact solution, $\exp ({\rm i} S/\hbar)$, of the corresponding Schr\"odinger equation.
We here announce and outline a solution of this major and longstanding foundational problem, dealing with all seven of its heavily-interrelated local facets.
In this paper we analyze possible extensions of the classical Steklov eigenvalue problem to the fractional setting. In particular, we find a nonlocal eigenvalue problem of fractional type that approximate, when taking a suitable limit, the…
In this article we prove under suitable assumptions that the marginals of any solution to a relaxed controlled martingale problem on a Polish space $E$ can be mimicked by a Markovian solution of a Markov-relaxed controlled martingale…
The Halting Problem is a version of the Liar's Paradox.
A modified $k$-deck of a graph is obtained by removing $k$ edges in all possible ways and adding $k$ (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of M\"uller's result…
This work is concerned with existence and uniqueness of solutions to the reflection problem for linear parabolic equation with multiplicative Gaussian noise.
We provide elementary and accurate numerical solutions to the differential-difference equation, which improves an explicit version of the linear sieve given by Nathanson.
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
The aim of this note is to present a numerical method to solve the Stokes problem in a bounded domain with a Dirac source term, which preserves optimality for any approximation order by the finite-element method. It is based on the…
We formulate a solution to the Algebraic version of the Inverse Jacobi problem. Using this solution we produce explicit addition laws on any algebraic curve generalizing the law suggested by Leykin [2] in the case of (n, s) curves. This…
This paper describes TSP exact solution of polynomial complexity. It is considered properties of proposed method. Effectiveness of proposed solution is illustrated by outcomes of computer modeling.
We introduce the constrained topological sorting problem (CTS): given a regular language K and a directed acyclic graph G with labeled vertices, determine if G has a topological sort that forms a word in K. This natural problem applies to…
In this paper, we derive the existence of solutions with small volume to the $L_p$-Gaussian Minkowski problem for $1\leq p<n$, which implies that there are at least two solutions for the $L_p$-Gaussian Minkowski problem.
The classical solvability of the initial-boundary problem for the Davey-Stewartson-II type system of equations is proved.
We present the solution to a problem presented by Knuth, attributed to Gosper.
This note describes a SAT encoding for the $n$-fractions puzzle which is problem 041 of the CSPLib. Using a SAT solver we obtain a solution for two of the six remaining open instances of this problem.