Related papers: Axiomatization of Compact Initial Value Problems: …
In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational…
This paper concerns the initial-boundary-value problem (IBVP) of the compressible Magnetohydrodynamic (MHD) equations in 3D exterior domains with Navier-slip boundary conditions for the velocity and perfect conducting conditions for the…
All simple translation-invariant valuations on polytopes are classified. As a direct consequence the well-known conditions for translative-equidecomposability are recovered. Furthermore, a simplified proof of the classification of…
A well-posed initial-boundary value problem is formulated for the model problem of the vector wave equation subject to the divergence-free constraint. Existence, uniqueness and stability of the solution is proved by reduction to a system…
We consider a characteristic initial value problem for a class of symmetric hyperbolic systems with initial data given on two smooth null intersecting characteristic surfaces. We prove existence of solutions on a future neighborhood of the…
In this paper well-posedness is proved for an initial and boundary value problem (IBVP) relative to a large class of quasilinear hyperbolic systems, in $p+q$ equations, on a strip, arising from a model of $H_2O$-phase transitions in the…
In this work, we study the initial value problem associated with an abstract integrodifferential equation in interpolation scales. We prove local-in-time existence, uniqueness, continuation, and a blow-up alternative for regular mild…
We consider the problem of rationalizing choice data by a preference satisfying an arbitrary collection of invariance axioms. Examples of such axioms include quasilinearity, homotheticity, independence-type axioms for mixture spaces,…
We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…
A new method for the solution of initial-boundary value problems for evolution PDEs recently introduced by Fokas is generalised to multidimensions. Also the relation of this method with the method of images and with the classical integral…
We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concrete syntax for strong monads on functor categories, and are…
We prove that the initial value problem (IVP) for the critical generalized KdV equation $u_{t}+u_{xxx}+(u^5)_{x}=0$ on the real line is globally well-posed in $H^{s}(\R)$ provided $s>3/5$.
The CSP (constraint satisfaction problems) is a class of problems deciding whether there exists a homomorphism from an instance relational structure to a target one. The CSP dichotomy is a profound result recently proved by Zhuk (2020, J.…
In this work we prove that the initial-boundary value problem (IBVP) for the fifth order Korteweg-de Vries equation \begin{align*} \left. \begin{array}{rlr} u_t+\partial_x^5 u+u\partial_x u&\hspace{-2mm}=0,&\quad x\in\mathbb R^+,\;…
In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step…
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended with hybrid operators. First, we present HXPath=, a multi-modal version of XPath with data, extended with nominals and the…
In this paper, we consider the problem of recovery of a burst-like forcing term in an initial value problem (IVP) in the framework of dynamical sampling. We introduce an idea of using two particular classes of samplers that allow one to…
We study the computational complexity of exact minimisation of rational-valued discrete functions. Let $\Gamma$ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The…