English
Related papers

Related papers: Path-complete positivity of switching systems

200 papers

We present some necessary and/or sufficient conditions for the positivity problem of three-term recurrence sequences. As applications we show the positivity of diagonal Taylor coefficients of some rational functions in a unified approach.…

Combinatorics · Mathematics 2023-01-06 Yanni Pei , Yaling Wang , Yi Wang

Transient stability is crucial to the reliable operation of power systems. Existing theories rely on the simplified electromechanical models, substituting the detailed electromagnetic dynamics of inductor and capacitor with their impedance…

Systems and Control · Electrical Eng. & Systems 2025-02-17 Xinyuan Jiang , Constantino M. Lagoa , Yan Li

We characterize the total positivity in space-time of real strictly stable semigroups. In the positive case, this solves a problem which had been raised by Karlin. In the drifted Cauchy case, this concludes a study which we had initiated in…

Classical Analysis and ODEs · Mathematics 2014-12-02 Thomas Simon

We present sufficient conditions for total positivity of Riordan arrays. As applications we show that many well-known combinatorial triangles are totally positive and many famous combinatorial numbers are log-convex in a unified approach.

Combinatorics · Mathematics 2016-01-22 Xi Chen , Huyile Liang , Yi Wang

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

The relationship between port-Hamiltonian and positive real descriptor systems is investigated. It is well-known that port-Hamiltonian systems are positive real, but the converse implication does not always hold. In [K. Cherifi, H.…

Optimization and Control · Mathematics 2024-08-27 Delin Chu , Volker Mehrmann

This work continues and substantially extends our recent work on switching diffusions with the switching processes that depend on the past states and that take values in a countable state space. That is, the discrete components of the…

Probability · Mathematics 2017-10-10 Dang H. Nguyen , George Yin

We introduce a generalization of the set of completely positive matrices that we call "pairwise completely positive" (PCP) matrices. These are pairs of matrices that share a joint decomposition so that one of them is necessarily positive…

Quantum Physics · Physics 2019-05-30 Nathaniel Johnston , Olivia MacLean

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

Functional Analysis · Mathematics 2026-02-16 Mohsen Kian

Passivity theory is one of the cornerstones of control theory, as it allows one to prove stability of a large-scale system while treating each component separately. In practice, many systems are not passive, and must be passivized in order…

Systems and Control · Electrical Eng. & Systems 2021-05-06 Miel Sharf , Daniel Zelazo

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

Combinatorics · Mathematics 2024-12-24 Jonathan Boretsky , Veronica Calvo Cortes , Yassine El Maazouz

The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…

Quantum Physics · Physics 2015-06-12 Vern I. Paulsen , Fred Shultz

Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A…

Formal Languages and Automata Theory · Computer Science 2021-10-12 David Fernando Casas Torres

Recent works have shown that the $L_1$ and $L_\infty$-gains are natural performance criteria for linear positive systems as they can be characterized using linear programs. Those performance measures have also been extended to linear…

Optimization and Control · Mathematics 2020-05-07 Corentin Briat

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

Matrix completion results deal with the question of when a partially specified symmetric matrix can be completed to a member of certain matrix cones. Results from positive semidefinite matrix completion and completely positive matrix…

General Mathematics · Mathematics 2025-09-25 Markus Gabl

A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an…

Logic in Computer Science · Computer Science 2018-02-27 Alexandre Goy

Power law systems have been studied extensively due to their wide-ranging applications, particularly in chemistry. In this work, we focus on power law systems that can be decomposed into stoichiometrically independent subsystems. We show…

Dynamical Systems · Mathematics 2024-04-23 Al Jay Lan J. Alamin , Bryan S. Hernandez

The notion of (auto) catalytic networks has become a cornerstone in understanding the possibility of a sudden dramatic increase of diversity in biological evolution as well as in the evolution of social and economical systems. Here we study…

Other Condensed Matter · Physics 2016-10-05 Rudolf Hanel , Stuart A. Kauffman , Stefan Thurner

We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio