On recursive filters inverse to finite sequences in the minimum mean square sense
In this paper, two robust consensus problems are considered for a multi-agent system with various disturbances. To achieve the robust consensus, two distributed control schemes for each agent, described by a second-order differential equation, are proposed. With the help of graph theory, the robust consensus stability of the multi-agent system with communication delays is obtained for both fixed and switching interconnection topologies. The results show the leaderless consensus can be achieved with...
It is shown that the maximum size of a set of vectors of a -dimensional vector space over , with the property that every subset of size is a basis, is at most , if , and at most , if , where and is prime. Moreover, for , the sets of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a matrix, with and entries from , has columns which are linearly dependent. Another is...
We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce structural properties of Bayesian networks, which is important within causal inference.
In this series, this paper is devoted to the study of two related functional equations primarily connected with weighted entropy and weighted entropy of degree beta (which are weighted additive and weighted beta additive respectively) which include as special cases Shannon's entropy, inaccuracy (additive measures) and the entropy of degree beta (nonadditive) respectively. These functional equations which arise mainly from the representation and these 'additive' properties are solved for fixed m...
Partially supported by the Technical University of Gabrovo under Grant C-801/2008One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values of N(T, 1, 3) are known for...