Related papers: A Necessary Solution Condition for Sudoku

The primary goal of this paper is to prove a near-martingale optional stopping theorem and establish solvability and large deviations for a class of anticipating linear stochastic differential equations. We prove the existence and…

In this note, we study large deviations of the number $\mathbf{N}$ of intercalates ($2\times2$ combinatorial subsquares which are themselves Latin squares) in a random $n\times n$ Latin square. In particular, for constant $\delta>0$ we…

The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array of useful applications in engineering, machine learning and statistics, and the design of…

The purpose of this paper is to provide answers to some questions raised in a paper by Kaneko and Koike about the modularity of the solutions of a differential equations of hypergeometric type. In particular, we provide a number-theoretic…

The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with several singular coefficients. These fundamental solutions are directly connected with multiple…

Using Carleman estimates, we give a lower bound for solutions to the discrete Schr\"odinger equation in both dynamic and stationary settings that allows us to prove uniqueness results, under some assumptions on the decay of the solutions.

Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as…

We review the indefinite sublinear elliptic equation $-\Delta u=a(x)u^{q}$ in a smooth bounded domain $\Omega\subset\mathbb{R}^{N}$, with Dirichlet or Neumann homogeneous boundary conditions. Here $0<q<1$ and $a$ is continuous and changes…

An integrable version of the supersymmetric U model with open boundary conditions and an impurity situated at one end of the chain is introduced. The model is solved through the algebraic Bethe ansatz method and the Bethe ansatz equations…

The purpose of this paper is to propose methods for verifying the positivity of a weak solution $ u $ of an elliptic problem assuming $ H^1_0 $-error estimation $ \left\|u-\hat{u}\right\|_{H_{0}^{1}} \leq \rho $ given some numerical…

Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications, and yet most of the literature of the last two decades has focused thus…

In this paper, we propose an inexact Newton-like conditional gradient method for solving constrained systems of nonlinear equations. The local convergence of the new method as well as results on its rate are established by using a general…

This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…

Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…

Unique existence of analytically strong solutions to stochastic partial differential equations (SPDE) with drift given by the subdifferential of a quasi-convex function and with general multiplicative noise is proven. The proof applies a…

The paper considers a boundary value problem for the high-order Lavrent'ev-Bitsadze equation. Necessary and sufficient conditions for the uniqueness of the solution are found. When substantiating the existence, the problem of "small…

We present a unified hard-constraint framework for solving geometrically complex PDEs with neural networks, where the most commonly used Dirichlet, Neumann, and Robin boundary conditions (BCs) are considered. Specifically, we first…

A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. Based on this representation, we apply a uniform method to prove the M. Hall's,…

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

This paper proposes a new method for finding closed-loop saddle points in zero-sum linear-quadratic stochastic differential games by decoupling their inherent structure. Specifically, we develop a nested iterative scheme that constructs a…