Related papers: Passive Linear Continuous-Time Systems: Characteri…
In this paper, we consider the systems with trajectories originating in the nonnegative orthant becoming nonnegative after some finite time transient. First we consider dynamical systems (i.e., fully observable systems with no inputs),…
Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures. Such arguments are often cumbersome as…
We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions, linear right hand side functions, and a constant coefficient matrix, as well as their symmetric dual. We search for…
We discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…
Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which…
A new method of symbolic analysis based on finite discretization of velocity-curvature space is proposed. A minimum alphabet is introduced in a natural way, and a number of initial analytic measures are defined that make it possible to…
In this contribution we discuss flat discrete-time nonlinear systems in a general setting including two special subclasses, namely, forward- and backward-flat systems. We relate rank conditions for certain submatrices of the Jacobian of the…
One of the characteristic features of categorical systems theory is that the behavior of systems can be characterized by certain morphisms into them. In other words, behaviors form a representable covariant functor to Set. And more…
A line of hard spheres confined by a transverse harmonic potential, with hard walls at its ends, exhibits a variety of buckled structures as it is compressed longitudinally. Here we show that these may be conveniently observed in a rotating…
The notion of path-complete $p$-dominance for switching linear systems (in short, path-dominance) is introduced as a way to generalize the notion of dominant/slow modes for LTI systems. Path-dominance is characterized by the contraction…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…
In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…
The characteristics of a time-delayed system with time-dependent delay time is investigated. We demonstrate the nonlinearity characteristics of the time-delayed system are significantly changed depending on the properties of time-dependent…
A parameter of a mathematical model is structurally identifiable if it can be determined from noiseless experimental data. Here, we examine the identifiability properties of two important classes of linear compartmental models:…
We extend the modeling framework of port-Hamiltonian descriptor systems to include under- and over-determined systems and arbitrary differentiable Hamiltonian functions. This structure is associated with a Dirac structure that encloses its…
In this document the author proves that several problems in data-driven numerical approximation of dynamical systems in $\mathbb{C}^n$, can be reduced to the computation of a family of constrained matrix representations of elements of the…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
In this document, some general results in approximation theory and matrix analysis with applications to sparse identification of time series models and nonlinear discrete-time dynamical systems are presented. The aforementioned theoretical…
We show that every flat nonlinear discrete-time system with two inputs can be transformed into a structurally flat normal form by state- and input transformations. This normal form has a triangular structure and allows to read off the flat…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…