English
Related papers

Related papers: Axiomatization of Compact Initial Value Problems: …

200 papers

The main aim of this paper is to provide a method which allows finding limiting shapes of symbolic generic initial systems of higher-dimensional subvarieties of P^n. M. Mustata and S. Mayes established a connection between volumes of…

Algebraic Geometry · Mathematics 2014-07-03 Marcin Dumnicki , Justyna Szpond , Halszka Tutaj-Gasinska

A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…

Computational Complexity · Computer Science 2022-11-17 Todd Bichoupan

A common problem in various applications is the additive decomposition of the output of a function with respect to its input variables. Functions with binary arguments can be axiomatically decomposed by the famous Shapley value. For the…

Mathematical Finance · Quantitative Finance 2023-03-15 Marcus C Christiansen

In this paper we prove uniqueness for an inverse boundary value problem (IBVP) arising in electrodynamics. We assume that the electromagnetic properties of the medium, namely the magnetic permeability, the electric permittivity and the…

Analysis of PDEs · Mathematics 2016-01-20 Pedro Caro , Ting Zhou

In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over $\mathbb{Q}$ is invertible or not. The analogous question for commuting variables is the celebrated…

Computational Complexity · Computer Science 2019-01-25 Ankit Garg , Leonid Gurvits , Rafael Oliveira , Avi Wigderson

The winner determination problems of many attractive multi-winner voting rules are NP-complete. However, they often admit polynomial-time algorithms when restricting inputs to be single-peaked. Commonly, such algorithms employ dynamic…

Computer Science and Game Theory · Computer Science 2021-04-20 Dominik Peters

The paper proposes a control-theoretic framework for verification of numerical software systems, and puts forward software verification as an important application of control and systems theory. The idea is to transfer Lyapunov functions…

Systems and Control · Computer Science 2011-08-02 Mardavij Roozbehani , Alexandre Megretski , Eric Feron

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

Analysis of PDEs · Mathematics 2025-10-20 Vladimir P. Gerdt

The paper proposes a control-theoretic framework for verification of numerical software systems, and puts forward software verification as an important application of control and systems theory. The idea is to transfer Lyapunov functions…

Systems and Control · Computer Science 2011-08-30 Mardavij Roozbehani , Alexandre Megretski , Eric Feron

The problem of searching boundary value problems for soliton equations consistent with the integrability property is discussed. A method of describing integrals of motion for the integrable initial boundary value problems for the…

Exactly Solvable and Integrable Systems · Physics 2012-05-31 I. T. Habibullin

Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way. Problems of this type are well studied for…

Computational Complexity · Computer Science 2014-08-19 Andrei A. Bulatov

The initial value problem is introduced after a thorough review of the essential geometry. The initial value equations are put into elliptic form using both conformal transformations and a treatment of the extrinsic curvature introduced…

General Relativity and Quantum Cosmology · Physics 2016-11-09 James W. York

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…

Computational Complexity · Computer Science 2007-05-23 Elmar Böhler , Edith Hemaspaandra , Steffen Reith , Heribert Vollmer

Taking insight from the theory of general relativity, where space and time are treated on the same footing, we develop a novel geometric variational discretization for second order initial value problems (IVPs). By discretizing the dynamics…

Numerical Analysis · Mathematics 2023-07-11 Alexander Rothkopf , Jan Nordström

In some significant applications such as data forecasting, the locations of missing entries cannot obey any non-degenerate distributions, questioning the validity of the prevalent assumption that the missing data is randomly chosen…

Information Theory · Computer Science 2019-09-09 Guangcan Liu , Qingshan Liu , Xiao-Tong Yuan , Meng Wang

In this paper we propose novel optimization-based methods for verifying reach-avoid (or, eventuality) properties of continuous-time systems modelled by ordinary differential equations. Given a system, an initial set, a safe set and a target…

Optimization and Control · Mathematics 2022-08-18 Bai Xue , Naijun Zhan , Martin Fränzle , Ji Wang , Wanwei Liu

In this work we prove that the initial value problem (IVP) associated to the fractional two-dimensional Benjamin-Ono equation $$\left. \begin{array}{rl} u_t+D_x^{\alpha} u_x +\mathcal Hu_{yy} +uu_x &=0,\qquad\qquad (x,y)\in\mathbb R^2,\;…

Analysis of PDEs · Mathematics 2017-12-08 Eddye Bustamante , José Jiménez Urrea , Jorge Mejía

We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…

Computational Complexity · Computer Science 2024-05-03 Olivier Bournez , Riccardo Gozzi

We consider the initial boundary value problem for a model system of one-dimensional equations which describe unsteady polytropic motions of a mixture of viscous compressible fluids. We prove the global existence and uniqueness theorem for…

Analysis of PDEs · Mathematics 2017-11-22 Dmitriy Prokudin

Many large MDPs can be represented compactly using a dynamic Bayesian network. Although the structure of the value function does not retain the structure of the process, recent work has shown that value functions in factored MDPs can often…

Artificial Intelligence · Computer Science 2013-01-18 Daphne Koller , Ron Parr