Related papers: Verifying $k$-Contraction without Computing $k$-Co…
The flow of contracting systems contracts 1-dimensional parallelotopes, i.e., line segments, at an exponential rate. One reason for the usefulness of contracting systems is that many interconnections of contracting sub-systems yield an…
A dynamical system is called contractive if any two solutions approach one another at an exponential rate. More precisely, the dynamics contracts lines at an exponential rate. This property implies highly ordered asymptotic behavior…
This paper investigates stability conditions of continuous-time Hopfield and firing-rate neural networks by leveraging contraction theory. First, we present a number of useful general algebraic results on matrix polytopes and products of…
A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…
A $k$-attractor is a combinatorial object unifying dictionary-based compression. It allows to compare the repetitiveness measures of different dictionary compressors such as Lempel-Ziv 77, the Burrows-Wheeler transform, straight line…
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…
Local superlinear convergence of the semismooth Newton method usually necessitates assumptions on the uniform invertibility of the utilized, generalized Jacobian matrices, such as, e.g., BD- or CD-regularity. For certain composite-type…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…
Despite modular conditions to guarantee stability for large-scale systems have been widely studied, few methods are available to tackle the case of networks with multiple equilibria. This paper introduces small-gain like sufficient…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…
In this note we study contractivity of monotone systems and exponential convergence of positive systems using non-Euclidean norms. We first introduce the notion of conic matrix measure as a framework to study stability of monotone and…
The multiplicative and additive compounds of a matrix have important applications in geometry, linear algebra, and the analysis of dynamical systems. In particular, the $k$-compounds allow to build a $k$-compound dynamical system that…
For integer $k\geq2,$ a graph $G$ is called $k$-leaf-connected if $|V(G)|\geq k+1$ and given any subset $S\subseteq V(G)$ with $|S|=k,$ $G$ always has a spanning tree $T$ such that $S$ is precisely the set of leaves of $T.$ Thus a graph is…
Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…
Critical questions in dynamical neuroscience and machine learning are related to the study of continuous-time neural networks and their stability, robustness, and computational efficiency. These properties can be simultaneously established…
We derive a sufficient condition for a set of pure states, each entangled in two remote $N$-dimensional systems, to be transformable to $k$-dimensional-subspace equivalent entangled states ($k\leq N$) by same local operations and classical…
The $k$ multiplicative and $k$ additive compounds of a matrix play an important role in geometry, multi-linear algebra, the asymptotic analysis of nonlinear dynamical systems, and in bounding the Hausdorff dimension of fractal sets. These…