Related papers: A stronger model for peg solitaire, II
We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…
We present a new strategy for solving stiff ODEs with explicit methods. By adaptively taking a small number of stabilizing small explicit time steps when necessary, a stiff ODE system can be stabilized enough to allow for time steps much…
Let an $n\times n$ array $\left( a_{ij}\right) $ of lights be given, each either on (when $a_{ij}=1$) or off (when $a_{ij}=-1$). For each row and each column there is a switch so that if the switch is pulled ($x_{i}=-1$ for row $i$ and…
In this paper we present necessary and sufficient conditions for the existence of a unique solution to the relaxed commutant lifting problem. The obtained conditions are more complicated than those for the classical commutant lifting…
It is now established that, contrary to common belief, (electro-)vacuum Brans-Dicke gravity does not reduce to general relativity for large values of the Brans-Dicke coupling $\omega$. Since the essence of experimental tests of…
This paper investigates new first-order optimality conditions for general optimization problems. These optimality conditions are stronger than the commonly used M-stationarity conditions and are in particular useful when the latter cannot…
It is well known that there are no stable bundles of rank greater than 1 on the projective line. In this paper, our main purpose is to study the existence problem for stable coherent systems on the projective line when the number of…
The present status of Unified Theories is summarized with special emphasis on their possible experimental tests. Outline: i) Unification of couplings; ii) Where can a positive signal come from? iii) HERA anomaly and Unification; iv) Recent…
Often in Software Engineering, a modeling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such…
We investigate the important problem of certifying stability of reinforcement learning policies when interconnected with nonlinear dynamical systems. We show that by regulating the input-output gradients of policies, strong guarantees of…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
In this document, we deal with the stabilization problem of slow-fast systems (or singularly perturbed Ordinary Differential Equations) at a non-hyperbolic point. The class of systems studied here have the following properties: 1) they have…
Our ability to know when to trust the decisions made by machine learning systems has not kept up with the staggering improvements in their performance, limiting their applicability in high-stakes domains. We introduce Prover-Verifier Games…
We introduce and study a notion of duality for two classes of optimization problems commonly occurring in probability theory. That is, on an abstract measurable space $(\Omega,\mathcal{F})$, we consider pairs $(E,\mathcal{G})$ where $E$ is…
Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining…
In the "Game about Squares" the task is to push unit squares on an integer lattice onto corresponding dots. A square can only be moved into one given direction. When a square is pushed onto a lattice point with an arrow the direction of the…
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…
We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
Super-stability is one of the stability concepts in the stable matching problem with ties. It is known that there may not exist a super-stable matching, and the existence of a super-stable matching can be checked in polynomial time. In this…