activity
20062022
most citedOn the complexity of computing the capacity of codes that avoid forbidden difference patterns

23 citations · 72 across the 27 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.DS2014

Resonance and marginal instability of switching systems

Vladimir Y. Protasov, Raphael M. Jungers

We analyse the so-called Marginal Instability of linear switching systems, both in continuous and discrete time. This is a phenomenon of unboundedness of trajectories when the Lyap…

math.MG2014

Matrix semigroups with constant spectral radius

Vladimir Protasov, Andrey Voynov

Multiplicative matrix semigroups with constant spectral radius (c.s.r.) are studied and applied to several problems of algebra, combinatorics, functional equations, and dynamical s…

math.OC2014★ 1 cited

Stability of linear switching systems and Markov-Bernstein inequalities for exponents

Vladimir Yu. Protasov, Raphael M. Jungers

We analyse the problem of stability of a continuous time linear switching system (LSS) versus the stability of its Euler discretization. It is well-known that the existence of a po…

math.DS2014★ 2 cited

Polytope Lyapunov functions for stable and for stabilizable LSS

Nicola Guglielmi, Linda Laglia, Vladimir Protasov

We present a new approach for constructing polytope Lyapunov functions for continuous-time linear switching systems (LSS). This allows us to decide the stability of LSS and to comp…

math.NA2014★ 3 cited

Regularity of Non-Stationary Multivariate Subdivision

Maria Charina, Costanza Conti, Nicola Guglielmi +1

In this paper, we study scalar multivariate non-stationary subdivision schemes with integer dilation matrix M=mI, m >=2, and present a general approach for checking their convergen…