Related papers: A Weak Solution of Inverse Treblecross
We study twisted modules for (weak) quantum vertex algebras and we give a conceptual construction of (weak) quantum vertex algebras and their twisted modules. As an application we construct and classify irreducible twisted modules for a…
The purpose of this paper is to study weak solutions of a nonlinear Neumann problem considered on a ball. Assuming that the potential is invariant, we consider an orbit of critical points, i.e. we do not assume that critical points are…
The disjunctive sum of impartial games is analyzed by Sprague-Grundy theory. The theory has been extended to loopy games and entailing games by early results. In this study, we consider further extension of this theory and show partial…
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…
In this paper, we consider a partial information two-person zero-sum stochastic differential game problem where the system is governed by a backward stochastic differential equation driven by Teugels martingales associated with a L\'{e}vy…
Since the day the core inverse has been known in a paper of Bakasarly and Trenkler, it has been widely researched. So far, there are four generalizations of this inverse for the case of matrices of an arbitrary index, namely, the BT…
A new class of projected dynamical systems of third order is investigated for quasi (parametric) variational inequalities in which the convex set in the classical variational inequality also depends upon the solution explicitly or…
Here, we prove the existence of solutions to first-order mean-field games (MFGs) arising in optimal switching. First, we use the penalization method to construct approximate solutions. Then, we prove uniform estimates for the penalized…
We analyze the computational complexity of the popular computer games Threes!, 1024!, 2048 and many of their variants. For most known versions expanded to an m x n board, we show that it is NP-hard to decide whether a given starting…
In this paper we utilize a convex integration scheme to construct non-trivial solutions to the stationary KdV equation which lie in $L^p(\mathbb{T})$, $p < 2$. In addition, we demonstrate this result is sharp in the sense that if $u \in…
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg at a specified board location. We develop necessary and…
We present Solrex,an automated solver for the game of Reverse Hex.Reverse Hex, also known as Rex, or Misere Hex, is the variant of the game of Hex in which the player who joins her two sides loses the game. Solrex performs a mini-max search…
Pebble games are popular models for analyzing time-space trade-offs. In particular, the reversible pebble game is often applied in quantum algorithms like Grover's search to efficiently simulate classical computation on inputs in…
We analyze a two-player game in which players take turns avoiding the selection of certain points within a convex geometry. The objective is to prevent the convex closure of all chosen points from encompassing a predefined set. The first…
We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a \textit{pairwise stable} solution, a graph with an arbitrarily specified degree distribution.…
In our article we consider some algebraical methods which may be useful in some inverse spectral problems. The reconstraction of the matrix from its minors is considered.
We investigate weak approximation away from a finite set of places for a class of biquadratic fourfolds inside $\mathbb{P}^3 \times \mathbb{P}^2$, some of which appear in the recent work of Hassett--Pirutka--Tschinkel.
We analyze the computational complexity of two 2-player games involving packing objects into a box. In the first game, players alternate drawing polycubes from a shared pile and placing them into an initially empty box in any available…
The existence of at least three weak solutions for a kind of nonlinear time-dependent equation is studied. In fact, we consider the case that the source function has singularity at origin. To this aim, the variational methods and the…