Related papers: A problem of Stanislaw Saks
The aim of this paper is to study time-fractional pseudo-parabolic type equations generated by the Dunkl operator. The forward problem is considered and its well-posedness is established. In particular, a prior estimates are obtained in the…
We demonstrate that any logical problem can be solved by Bayesian inference. In this approach, the distinction between complexity classes vanishes. The method is illustrated by solving the 3-SAT problem in polynomial time. Beyond this,…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…
The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned $1$, while the rest are all assigned $0$. We can generalise this problem further by…
We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.
Kronecker's 1856 paper contains a solvability theorem that is useful to construct unsolvable algebraic equations. We show how Kronecker's solvability theorem can be derived naturally via a polynomial complete decomposition method. This…
A lattice system is derived which amounts to a higher-rank analogue of the Q3 equation, the latter being an integrable partial difference equation which has appeared in the ABS list of multidimensionally consistent quadrilateral lattice…
In this paper, we almost completely solve the Hamilton-Waterloo problem with C8- factors and Cm-factors where the number of vertices is a multiple of 8m.
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
I provide the algorithm that solves the challenge proposed by Wm. G. Hoover and Carol G. Hoover in their recent paper "Time-Reversible Random Number Generators", arXiv:1305.0961, with an explanation on how to derive it analytically.
In this paper, we consider the Minkowski problem associated with the solution to the anisotropic $p$-Laplacian (or Finsler $p$-Laplacian) equation, namely, the Minkowski problem of anisotropic $p$-torsional rigidity. The sufficient and…
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of $K_{2n+1}$ into edge-disjoint copies of a given $2$-factor. We show that this can be achieved for all large $n$. We actually prove a significantly more general…
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding.…
It is shown that the complex Bernoulli differential equations admitting the supplementary structure of a Lie-Hamilton system related to the book algebra $\mathfrak{b}_2$ can always be solved by quadratures, providing an explicit solution of…
We announce the solution of 4+21+1/2 (!) problems posed in earlier issues of the SPM Bulletin; the ``1/2'' standing for a ``consistently yes'' answer of Zdomsky to the last issue's Problem of the Month.
By combining theoretical and computational techniques from geometry, calculus, group theory, and Galois theory, we prove the nonexistence of a closed-form algebraic solution to a Japanese geometry problem first stated in the early…
In this note, we present a new numerical method for solving backward stochastic differential equations. Our method can be viewed as an analogue of the classical finite element method solving deterministic partial differential equations.
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.