robust static output feedback stabilization for nonlinear discrete time systems with time delay via fuzzy control approach this paper addresses the problem of designing robust static output feedback controllers for nonlinear discrete time interval systems with time delays both in states and in control input in the approach we do not directly employ the lyapunov approach as do in most of traditional fuzzy control design approaches instead sufficient conditions for guaranteeing the robust stability for the considered systems are derived in terms of the matrix spectral norm of the closed loop fuzzy system the stability conditions are further formulated into linear matrix inequalities so that the desired controller can be easily obtained by using the matlab linear matrix inequality lmi toolbox finally an example is provided to illustrate the effectiveness of the proposed approach

a note on clique web facets for multicut polytopes in this note we provide a previously undiscovered necessary condition for the facet defining property of clique web inequalities for the multicut polytope this condition imposes a minimum cardinality requirement on the node set of the clique thus implying in general that clique web inequalities associated with relatively small cliques are not facet defining for multicut polytopes

on the limit products of a family of matrices in this paper we direct attention at bounded families of complex n n matrices in order to study their asymptotic behaviour we recall from linear algebra appl 322 2001 162 the concept of limit spectrum maximizing product and show that nondefective families always admit such limit products then we consider defective families in loc cite we proved that for finite families of 2 2 matrices defectivity is equivalent to the existence of defective such limit products this result led us to conjecture the validity of this property also for higher dimensions n 3 here instead by making use of the results obtained by bousch and mairesse j am math soc 15 2002 77 that disproved the well known finiteness conjecture we find some counterexamples to our conjecture in loc cite for all n 3 2002 elsevier science inc all rights reserved

on the stability of fuzzy systems studies the global asymptotic stability of a class of fuzzy systems it demonstrates the equivalence of stability properties of fuzzy systems and linear time invariant lti switching systems a necessary and sufficient condition for the stability of such systems are given and it is shown that under the sufficient condition a common lyapunov function exists for the lti subsystems a particular case when the system matrices can be simultaneously transformed to normal matrices is shown to correspond to the existence of a common quadratic lyapunov function a constructive procedure to check the possibility of simultaneous transformation to normal matrices is provided

inequalities for numerical invariants of sets of matrices we prove three inequalities relating some invariants of sets of matrices such as the joint spectral radius one of the inequalities in which proof we use geometric invariant theory has the generalized spectral radius theorem of berger and wang as an immediate corollary

a multirule base controller using the robust property of a fuzzy controller and its design method this paper suggests a new fuzzy adaptive controller which is able to solve the problems of classical adaptive controllers and conventional fuzzy adaptive controllers it explains the architecture of a fuzzy adaptive controller using the robust property of a fuzzy controller the basic idea of new adaptive control scheme is that an adaptive controller can be constructed with parallel combination of robust controllers this new adaptive controller uses a multirule base architecture which has several independent fuzzy controllers in parallel each with different robust stability area out of several independent fuzzy controllers the most suited one is selected by a system identifier which observes variations in the controlled system parameter here we propose a design procedure which can be carried out mathematically and systematically from the model of a controlled system related mathematical theorems and their proofs are also given the performance of the proposed adaptive control algorithm is analyzed through a design example and a dc motor control simulation

robust stabilization of the takagi sugeno fuzzy model via bilinear matrix inequalities quadratic stability has enabled mainly via the linear matrix inequality framework the analysis and design of a nonlinear control system from the local matrices of the system s takagi sugeno t s fuzzy model it is well known however that there exist stable differential inclusions hence t s fuzzy models whose stability is unprovable by a globally quadratic lyapunov function at present literature in the broader area of stability analysis suggests piecewise quadratic stability as a means to avoid such conservatism this paper generalizes the idea and proposes a framework that supports less conservative sufficient conditions for the stability of the t s model by using piecewise quadratic generalized lyapunov functions the advocated approach results in the formulation of the controller synthesis which herein aims for robust stabilization as a problem of bilinear rather than linear matrix inequalities simulation studies which include an algorithm for solution of bilinear matrix inequalities demonstrate the proposed method

fuzzy model based control stability robustness and performance issues a nonlinear controller based on a fuzzy model of mimo dynamical systems is described and analyzed the fuzzy model is based on a set of arx models that are combined using a fuzzy inference mechanism the controller is a discrete time nonlinear decoupler which is analyzed both for the adaptive and the fixed parameter cases a detailed stability analysis is carried out and the main result is that the closed loop is globally stable and robust with respect to unstructured uncertainty which may include modeling error and disturbances in addition bounds on the asymptotic and transient performance are given the main assumptions on the system and model are that they must not have strong nonminimum phase effects except time delay and the unstructured uncertainty must not be too large a simulation example illustrates some of the properties of the modeling method and model based control structure

on the cut polytope the cut polytopep c g of a graphg v e is the convex hull of the incidence vectors of all edge sets of cuts ofg we show some classes of facet defining inequalities ofp c g we describe three methods with which new facet defining inequalities ofp c g can be constructed from known ones in particular we show that inequalities associated with chordless cycles define facets of this polytope moreover for these inequalities a polynomial algorithm to solve the separation problem is presented we characterize the facet defining inequalities ofp c g ifg is not contractible tok 5 we give a simple characterization of adjacency inp c g and prove that for complete graphs this polytope has diameter one and thatp c g has the hirsch property a relationship betweenp c g and the convex hull of incidence vectors of balancing edge sets of a signed graph is studied

experiments in quadratic 0 1 programming we present computational experience with a cutting plane algorithm for 0 1 quadratic programming without constraints our approach is based on a reduction of this problem to a max cut problem in a graph and on a partial linear description of the cut polytope

on a positive semidefinite relaxation of the cut polytope abstract we study the convex set l n defined by l n z x x xij a positive semidefinite n n matrix xii 1 for all i we describe several geometric properties of l n in particular we show that l n has 2n 1 vertices which are its rank one matrices corresponding to all bipartitions of the set 1 2 n our main motivation for investigating the convex set l n comes from combinatorial optimization namely from approximating the max cut problem an important property of l n is that due to the positive semidefinite constraints one can optimize over it in polynomial time on the other hand l n still inherits the difficult structure of the underlying combinatorial problem in particular it is np hard to decide whether the optimum of the problem min tr cx x ln is reached at a vertex this result follows from the complete characterization of the matrices c of the form c bbt for some vector b for which the optimum of the above program is reached at a vertex

on simultaneously nilpotent fuzzy matrices abstract nilpotent fuzzy matrices play a crucial role in the study of fuzzy matrices in this paper we shall extend the nilpotence to the notion of simultaneous nilpotence for a finite set of fuzzy matrices the notion of simultaneous nilpotence relates to the infinite products of a finite number of fuzzy matrices which converge to the zero matrix properties of the simultaneous nilpotence will be established in the study of consecutive powers of a fuzzy matrix a controllable fuzzy matrix can be characterized by an associated nilpotent fuzzy matrix in this paper we propose the notion of simultaneously controllable fuzzy matrices which can be thought of as a generalization of the notion of controllable fuzzy matrices similar to the nilpotent characterization for a controllable fuzzy matrix the simultaneously controllable fuzzy matrices can be characterized by a finite set of associated simultaneously nilpotent fuzzy matrices

computational experience with an interior point cutting plane algorithm there has been a great deal of success in the last 20 years with the use of cutting plane algorithms to solve specialized integer programming problems generally these algorithms work by solving a sequence of linear programming relaxations of the integer programming problem and they use the simplex algorithm to solve the relaxations in this paper we describe experiments using a predictor corrector interior point method to solve the relaxations for some problems the interior point code requires considerably less time than a simplex based cutting plane algorithm

robust fuzzy control of nonlinear systems with parametric uncertainties addresses the robust fuzzy control problem for nonlinear systems in the presence of parametric uncertainties the takagi sugeno t s fuzzy model is adopted for fuzzy modeling of the nonlinear system two cases of the t s fuzzy system with parametric uncertainties both continuous time and discrete time cases are considered in both continuous time and discrete time cases sufficient conditions are derived for robust stabilization in the sense of lyapunov asymptotic stability for the t s fuzzy system with parametric uncertainties the sufficient conditions are formulated in the format of linear matrix inequalities the t s fuzzy model of the chaotic lorenz system which has complex nonlinearity is developed as a test bed the effectiveness of the proposed controller design methodology is finally demonstrated through numerical simulations on the chaotic lorenz system

extremal and barabanov semi norms of a semigroup generated by a bounded family of matrices abstract let s s i i i be an arbitrary family of complex n by n matrices where 1 n let s denote the joint spectral radius of s defined as s lim sup l sup i 1 i l i l s i 1 s i l 1 l which is independent of the norm used here a semi norm on c n is called extremal of s if it satisfies x 0 and x s i s x x x 1 x n c n and i i in this paper using an elementary analytical approach we show that if s is bounded in c n n then there always exists for s an extremal semi norm on c n if additionally s is compact in c n n this extremal semi norm has the barabanov type property i e to any x c n one can find an infinite sequence i n i with x s i 1 s i k s k x for each k 1 as a common starting point this directly implies the fundamental results barabanov s norm theorem berger wang s formula and elsner s reduction theorem

metrics and undirected cuts suppose thatg is an undirected graph whose edges have nonnegative integer valued lengthsl e and that s1 t1 sm tm are pairs of its vertices can one assign nonnegative weights to the cuts ofg such that for each edgee the total weight of cuts containinge does not exceedl e and for eachi the total weight of cuts separating si andti is equal to the distance with respect tol betweensi andti using linear programming duality it follows from papernov s multicommodity flow theorem that the answer is affirmative if the graph induced by the pairs s1 t1 sm tm is one of the following i the complete graph with four vertices ii the circuit with five vertices iii a union of two stars we prove that if in addition each circuit ing has an even length with respect tol then there exists a suitable weighting of the cuts with the weights integer valued moreover an algorithm of complexity o n3 n is the number of vertices ofg is developed for solving such a problem also a class of metrics decomposable into a nonnegative linear combination of cut metrics is described and it is shown that the separation problem for cut cones isnp hard

stable adaptive control of fuzzy dynamic systems this paper discusses fuzzy model reference adaptive control for a class of nonlinear systems the system concerned is represented by a family of local transfer function models smoothly connected together by fuzzy membership functions the model reference adaptive control law is first designed in each local region and then constructed in global domain it is shown that the resulting fuzzy adaptive control system is globally stable based on a suitable piecewise differentiable lyapunov function a simulation example is given for demonstration of the application of the method

facets of the clique partitioning polytope a subseta of the edge set of a graphg v e is called a clique partitioning ofg is there is a partition of the node setv into disjoint setsw 1 w k such that eachw i induces a clique i e a complete but not necessarily maximal subgraph ofg and such thata 1 uv u v w i u v given weightsw e for alle e the clique partitioning problem is to find a clique partitioninga ofg such that e a w e is as small as possible this problem known to be hard see wakabayashi 1986 comes up for instance in data analysis and here the underlying graphg is typically a complete graph in this paper we study the clique partitioning polytope of the complete graphk n i e is the convex hull of the incidence vectors of the clique partitionings ofk n we show that triangles 2 chorded odd cycles 2 chorded even wheels and other subgraphs ofk n induce facets of the theoretical results described here have been used to design an empirically efficient cutting plane algorithm with which large real world instances of the clique partitioning problem could be solved these computational results can be found in grotschel and wakabayashi 1989

the equipartition polytope i formulations dimension and basic facets the following basic clustering problem arises in different domains ranging from physics statistics and boolean function minimization given a graphg v e and edge weightsce partition the setv into two sets of 1 2 v and 1 2 v nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized anequicut is a feasible solution of the above problem and theequicut polytope q g is the convex hull of the incidence vectors of equicuts ing in this paper we give some integer programming formulations of the equicut problem study the dimension of the equicut polytope and describe some basic classes of facet inducing inequalities forq g

the real positive semidefinite completion problem for series parallel graphs abstract we consider the partial real symmetric matrices x whose diagonal entries are equal to 1 and whose off diagonal entries are specified only on a subset of the positions the question is to determine whether x can be completed to a positive semidefinite matrix extending a result of barrett et al 3 we give a set of necessary conditions for x to be completable and show that these conditions are also sufficient if and only if the graph corresponding to the positions of the specified entries is series parallel i e has no k 4 minor

categorical aspects of generating functions i exponential formulas and krull schmidt categories abstract in this paper we study formal power series with exponents in a category for example the generating function of a category e with finite hom sets is defined by e t tx aut x where the summation is taken over all isomorphism classes of objects of e we can use such power series to enumerate the number of e structures along a faithful functor theorem 4 6 our theory is closely related to the theory of species joyal 1981 a species can be identified with a faithful functor from a groupoid to the category of finite sets theorem 3 6 we use mainly the concept of faithful functors with finite fibers instead of species so that we can separate the roles categories and functors play for example the exponential formula e t exp con e t means the unique coproduct decomposition property theorem 5 8 in the final section we give some applications of our theory to rather classical enumerations

an approach to fuzzy control of nonlinear systems stability and design issues presents a design methodology for stabilization of a class of nonlinear systems first the authors represent a nonlinear plant with a takagi sugeno fuzzy model then a model based fuzzy controller design utilizing the concept of the so called parallel distributed compensation is employed the main idea of the controller design is to derive each control rule so as to compensate each rule of a fuzzy system the design procedure is conceptually simple and natural moreover the stability analysis and control design problems can be reduced to linear matrix inequality lmi problems therefore they can be solved efficiently in practice by convex programming techniques for lmis the design methodology is illustrated by application to the problem of balancing and swing up of an inverted pendulum on a cart

an inequality for the spectral radius of an interval matrix abstract for an n n interval matrix a aij we say that a is majorized by the point matrix a a ij if aij aij when the jth column of a has the property that there exists a power a m containing in the same jth column at least one interval not degenerated to a point interval and aij aij otherwise denoting the generalized spectral radius in the sense of daubechies and lagarias of a by a and the usual spectral radius of a by a it is proved that if a is majorized by a then a a this inequality sheds light on the asymptotic stability theory of discrete time linear interval systems

continuity of the generalized spectral radius in max algebra abstract let be an induced matrix norm associated with a monotone norm on r n and be the collection of all nonempty closed and bounded subsets of n n nonnegative matrices under this matrix norm for the hausdorff metric h between and is given by h max sup a inf b a b sup b inf a a b the max algebra system consists of the set of nonnegative numbers with sum a b max a b and the standard product ab for a b 0 for n n nonnegative matrices a b their product is denoted by a b where a b ij max 1 k n a ik b kj for each the max algebra version of the generalized spectral radius of is limsup m sup a m a 1 m where m a 1 a 2 a m a i here a is the maximum circuit geometric mean in this paper we prove that the max algebra version of the generalized spectral radius is continuous on the hausdorff metric space h the notion of the max algebra version of simultaneous nilpotence of matrices is also proposed necessary and sufficient conditions for the max algebra version of simultaneous nilpotence of matrices are presented as well

simultaneous schur stability let be a set of n n complex matrices denote by the multiplicative semi group generated by for an n n complex matrix a the spectrum of a and spectral radius of a are denoted by a and r a respectively motivated by a phenomenon in the closed unit disc of the complex plane we give a rigorous definition of simultaneous schur stability as follows is said to be simultaneously schur stable if r a 1 a and 1 a a is said to be asymptotically stable if there exists a norm on cn such that sup a a e 1 it is proved that for a bounded set of n n complex matrices is asymptotically stable if and only if it is simultaneously schur stable by way of simultaneous schur stability some applications are illustrated especially an analytic combinatorial proof of a recent result of considerable depth generalized gelfand spectral radius formula

on the convergence of powers of interval matrices abstract we give a necessary and sufficient condition for the sequence a k of the powers of an interval matrix a to converge to the null matrix o we construct a point matrix b which has spectral radius b less than one if a k converges

the equipartition polytope ii valid inequalities and facets theequipartition problem is defined as follows given a graphg v e and edge weightsce partition the setv into two sets of 1 2 v and 1 2 v nodes in such a way that the sum of the weights of edges not having both endnodes in the same set is maximized or minimized anequicut is a feasible solution of the above problem and theequicut polytope q g is the convex hull of the incidence vectors of equicuts ing in this paper we describe some facet inducing inequalities of this polytope

sets of matrices all infinite products of which converge an infinite product iit lmi of matrices converges on the right if limi m mi exists a set z ai i l of n x n matrices is called an rcp set rightconvergent product set if all infinite products with each element drawn from z converge such sets of matrices arise in constructing self similar objects like von koch s snowflake curve in various interpolation schemes in constructing wavelets of compact support and in studying nonhomogeneous markov chains this paper gives necessary conditions and also some sufficient conditions for a set x to be an rcp set these are conditions on the eigenvalues and left eigenspaces of matrices in 2 and finite products of these matrices necessary and sufficient conditions are given for a finite set z to be an rcp set having a limit function m d rit lad where d d d which is a continuous function on the space of all sequences d with the sequence topology finite rcp sets of column stochastic matrices are completely characterized some results are given on the problem of algorithmically deciding if a given set x is an rcp set

comments on robust stabilization of a class of uncertain nonlinear systems via fuzzy control quadratic stabilizability h sup spl infin control theory and linear matrix inequalities this paper presents stability analysis for a class of uncertain nonlinear systems and a method for designing robust fuzzy controllers to stabilize the uncertain nonlinear systems first a stability condition for takagi and sugeno s fuzzy model is given in terms of lyapunov stability theory next new stability conditions for a generalized class of uncertain systems are derived from robust control techniques such as quadratic stabilization h sup spl infin control theory and linear matrix inequalities the derived stability conditions are used to analyze the stability of takagi and sugeno s fuzzy control systems with uncertainty which can be regarded as a generalized class of uncertain nonlinear systems the design method employs the so called parallel distributed compensation important issues for the stability analysis and design are remarked finally three design examples of fuzzy controllers for stabilizing nonlinear systems and uncertain nonlinear systems are presented

sufficient conditions for the stability of linear takagi sugeno free fuzzy systems in this paper we will study the stability issues of the linear takagi sugeno t s free fuzzy systems based on matrix norm we propose a new sufficient condition for the linear t s free fuzzy system to be globally asymptotically stable we then study the stability analysis in the case of systems with consequent parameter uncertainty based on mayer s convergent theorem we propose a sufficient condition which is easily implemented for the systems with consequent parameter uncertainty to be globally asymptotically stable

fuzzy regulators and fuzzy observers relaxed stability conditions and lmi based designs this paper presents new relaxed stability conditions and lmi linear matrix inequality based designs for both continuous and discrete fuzzy control systems they are applied to design problems of fuzzy regulators and fuzzy observers first takagi and sugeno s fuzzy models and some stability results are recalled to design fuzzy regulators and fuzzy observers nonlinear systems are represented by takagi sugeno s ts fuzzy models the concept of parallel distributed compensation is employed to design fuzzy regulators and fuzzy observers from the ts fuzzy models new stability conditions are obtained by relaxing the stability conditions derived in previous papers lmi based design procedures for fuzzy regulators and fuzzy observers are constructed using the parallel distributed compensation and the relaxed stability conditions other lmi s with respect to decay rate and constraints on control input and output are also derived and utilized in the design procedures design examples for nonlinear systems demonstrate the utility of the relaxed stability conditions and the lmi based design procedures

a lagrangian relaxation approach to the edge weighted clique problem the b clique polytope cp n b is the convex hull of the node and edge incidence vectors of all subcliques of size at most b of a complete graph on n nodes including the boolean quadric polytope qp n as a special case and being closely related to the quadratic knapsack polytope it has received considerable attention in the literature in particular the max cut problem is equivalent with optimizing a linear function over qp n n the problem of optimizing linear functions over cp n b has so far been approached via heuristic combinatorial algorithms and cutting plane methods we study the structure of cp n b in further detail and present a new computational approach to the linear optimization problem based on lucena s suggestion of integrating cutting planes into a lagrangian relaxation of an integer programming problem in particular we show that the separation problem for tree inequalities becomes polynomial in our lagrangian framework finally computational results are presented

the boolean quadric polytope some characteristics facets and relatives we study unconstrained quadratic zero one programming problems havingn variables from a polyhedral point of view by considering the boolean quadric polytope qpn inn n 1 2 dimensions that results from the linearization of the quadratic form we show that qpn has a diameter of one descriptively identify three families of facets of qpn and show that qpn is symmetric in the sense that all facets of qpn can be obtained from those that contain the origin by way of a mapping the naive linear programming relaxation qpnlp of qpn is shown to possess the trubin property and its extreme points are shown to be 0 1 2 1 valued furthermore o n3 facet defining inequalities of qpn suffice to cut off all fractional vertices of qpnlp whereas the family of facets described by us has at least o 3n members the problem is also studied for sparse quadratic forms i e when several or many coefficients are zero and conditions are given for the previous results to carry over to this case polynomially solvable problem instances are discussed and it is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation in the case that the graph induced by the nonzero coefficients of the quadratic form is series parallel a complete linear description of the associated boolean quadric polytope is given the relationship of the boolean quadric polytope associated to sparse quadratic forms with the vertex packing polytope is discussed as well

applications of cut polyhedra ii abstract in this paper and in its continuation part ii this issue we group within a unified framework many applications of the following polyhedra cut boolean quadric hypermetric and metric polyhedra we treat in particular the following applications l1 and l1 metrics in functional analysis the max cut problem the boole problem and multicommodity flow problems in combinatorial optimization lattice holes in geometry of numbers density matrices of many fermions systems in quantum mechanics we present some other applications in probability theory statistical data analysis and design theory in this first part after introducing the main definitions and operations for cut polyhedra we describe the connections with l1 metrics and with other metric properties and we consider in particular the applications to some classes of metrics arising from graphs normed spaces and lattices

facets for the cut cone i we study facets of the cut conec n i e the cone of dimension 1 2n n 1 generated by the cuts of the complete graph onn vertices actually the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope we present several operations on facets and in particular a lifting procedure for constructing facets ofc n 1 from given facets of the lower dimensional conec n after reviewing hypermetric valid inequalities we describe the new class of cycle inequalities and prove the facet property for several subclasses the new class of parachute facets is developed and other known facets and valid inequalities are presented

stability analysis and design of fuzzy control systems abstract the stability analysis and the design technique of fuzzy control systems using fuzzy block diagrams are discussed first we show the concept of fuzzy blocks and consider the connection problems of fuzzy blocks diagrams we derive some theorems and corollaries with respect to two basic types of connections of fuzzy blocks in order to preserve some properties in a connection of fuzzy blocks continuous piecewise polynomial membership functions are defined secondly a sufficient condition which guarantees the stability of fuzzy systems is obtained in terms of lyapunov s direct method we give an important fact based on this condition thirdly we propose a new design technique of a fuzzy controller the fuzzy block diagrams and the stability analysis are applied to the design problems of a model based fuzzy controller

brief paper periodically switched stability induces exponential stability of discrete time linear switched systems in the sense of markovian probabilities the conjecture that periodically switched stability implies absolute asymptotic stability of random infinite products of a finite set of square matrices has recently been disproved under the guise of the finiteness conjecture in this paper we show that this conjecture holds in terms of markovian probabilities more specifically let s k c n x n 1 k k be arbitrarily given k matrices and s k k j j 1 1 k j k for each j 1 where n k 2 then we study the exponential stability of the following discrete time switched dynamics s x j s k j s k 1x 0 j 1 and x 0 c n where k j j 1 s k can be an arbitrary switching sequence for a probability row vector p p 1 p k r k and an irreducible markov transition matrix p r k x k with pp p we denote by m p p the markovian probability on s k corresponding to p p by using symbolic dynamics and ergodic theoretic approaches we show that if s possesses the periodically switched stability then i it is exponentially stable m p p almost surely ii the set of stable switching sequences k j j 1 s k has the same hausdorff dimension as s k thus the periodically switched stability of a discrete time linear switched dynamics implies that the system is exponentially stable for almost all switching sequences

facets of the bipartite subgraph polytope the bipartite subgraph polytope pbg of a graph g v e is the convex hull of the incidence vectors of all edge sets of bipartite subgraphs of g we show that all complete subgraphs of g of odd order and all so called odd bicycle wheels contained in g induce facets of pbg moreover we describe several methods with which new facet defining inequalities of pbg can be constructed from known ones examples of these methods are contraction of node sets in odd complete subgraphs odd subdivision of edges certain splittings of nodes and subdivision of all edges of a cut using these methods we can construct facet defining inequalities of pbg having coefficients of order v 2

an extended formulation approach to the edge weighted maximal clique problem we consider an extended formulation approach to the edge weighted maximal clique problem the problem is formulated by using additional variables for the set of nodes with the natural variables for the set of edges we show that the proposed formulation is superior to the natural formulation both theoretically and practically by using the projection technique we can also derive new classes of facet defining inequalities for the lower dimensional polytope of the natural variables computational results are reported

a max version of the generalized spectral radius theorem abstract let be a bounded set of n n nonnegative matrices in max algebra in this paper we propose the notions of the max algebra version of the generalized spectral radius of and the max algebra version of the joint spectral radius of the max algebra version of the generalized spectral radius theorem is established we propose the relationship between the generalized spectral radius of in the sense of daubechies and lagarias and its max algebra version moreover a generalization of elsner and van den driessche s lemma is presented as well

the combinatorics of a class of representation functions abstract in the study of the irreducible representations of the unitary group u n one encounters a class of polynomials defined on n 2 indeterminates z ij 1 i j n which may be arranged into an n n matrix array z z ij these polynomials are indexed by double gelfand patterns or equivalently by pairs of column strict young tableaux of the same shape using the double labeling property one may define a square matrix d z whose elements are the double indexed polynomials these matrices possess the remarkable group multiplication property d xy d x d y for arbitrary matrices x and y even though these matrices may be singular for z u u n these matrices give irreducible unitary representations of u n these results are known but not always fully proved from the extensive physics literature on representation of the unitary groups where they are often formulated in terms of the boson calculus and the multiplication property is unrecognized the generality of the multiplication property is the key to understanding group representation theory from the purview of combinatorics the combinatorial structure of the general polynomials is expected to be intricate and in this paper we take the first step to explore the combinatorial aspects of a special class which can be defined in terms of the set of integral matrices with given row and column sums these special polynomials are denoted by l z where and are integral vectors representing the row sums and column sums of a class of integral matrices we present a combinatorial interpretation of the multiplicative properties of these polynomials we also point out the connections with macmahon s master theorem and schwinger s inner product formula which is essentially equivalent to macmahon s master theorem finally we give a formula for the double pfaffian which is crucial in the studies of the generating function of the 3 n j coefficients in angular momentum theory we also review the background of the general polynomials and give some of their properties

stability analysis and synthesis for an affine fuzzy control system via lmi and ilmi a continuous case a new stability analysis and controller synthesis methodology for a continuous affine fuzzy system is proposed in this paper the method suggested is based on the numerical convex optimization techniques in analysis the stability condition under which the affine fuzzy system is quadratically stable is derived and is recast in the formulation of linear matrix inequalities lmis the emphasis of this paper however is on the synthesis of fuzzy controller based on the derived stability condition in the synthesis the stabilizability condition turns out to be in the formulation of bilinear matrix inequalities and is solved numerically in an iterative manner fuzzy local controllers also assume the affine form and their bias terms are solved in a numerical manner simultaneously together with the gains continuous iterative lmi ilmi approach is presented to obtain a feasible solution for the synthesis of the affine fuzzy system

an application of combinatorial optimization to statistical physics and circuit layout design we study the problem of finding ground states of spin glasses with exterior magnetic field and the problem of minimizing the number of vias holes on a printed circuit board or contacts on a chip subject to pin preassignments and layer preferences the former problem comes up in solid state physics and the latter in very large scale integrated vlsi circuit design and in printed circuit board design both problems can be reduced to the max cut problem in graphs based on a partial characterization of the cut polytope we design a cutting plane algorithm and report on computational experience with it our method has been used to solve max cut problems on graphs with up to 1 600 nodes

binary positive semidefinite matrices and associated integer polytopes we consider the positive semidefinite psd matrices with binary entries along with the corresponding integer polytopes we begin by establishing some basic properties of these matrices and polytopes then we show that several families of integer polytopes in the literature the cut boolean quadric multicut and clique partitioning polytopes are faces of binary psd polytopes finally we present some implications of these polyhedral relationships in particular we answer an open question in the literature on the max cut problem by showing that the rounded psd inequalities define a polytope

generating facets for the cut polytope of a graph by triangular elimination the cut polytope of a graph arises in many fields although much is known about facets of the cut polytope of the complete graph very little is known for general graphs the study of bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or more generally the complete k partite graph lifting is a central tool to prove certain inequalities are facet inducing for the cut polytope in this paper we introduce a lifting operation named triangular elimination applicable to the cut polytope of a wide range of graphs triangular elimination is a specific combination of zero lifting and fourier motzkin elimination using the triangle inequality we prove sufficient conditions for the triangular elimination of facet inducing inequalities to be facet inducing the proof is based on a variation of the lifting lemma adapted to general graphs the result can be used to derive facet inducing inequalities of the cut polytope of various graphs from those of the complete graph we also investigate the symmetry of facet inducing inequalities of the cut polytope of the complete bipartite graph derived by triangular elimination

the finiteness conjecture for the generalized spectral radius of a set of matrices the generalized spectral radius g9 of a set of n n matrices is g9 lim supk g9k 1k where g9k sup a1a2 ak each ai the joint spectral radius g9 is g9 lim supk g9k 1k where g9k sup a1 ak each ai it is known that g9 g9 holds for any finite set of n n matrices the finiteness conjecture asserts that for any finite set of real n n matrices there exists a finite k such that g9 g9 g9k 1k the normed finiteness conjecture for a given operator norm asserts that for any finite set a1 am having all ai op 1 either g9 1 or g9 g9 g9k 1k 1 for some finite k it is shown that the finiteness conjecture is true if and only if the normed finiteness conjecture is true for all operator norms the normed finiteness conjecture is proved for a large class of operator norms extending results of gurvits in particular for polytope norms and for the euclidean norm explicit upper bounds are given for the least k having g9 g9k 1k these results imply upper bounds for generalized critical exponents for these norms

analysis and synthesis of nonlinear time delay systems via fuzzy control approach takagi sugeno ts fuzzy models 1985 1992 can provide an effective representation of complex nonlinear systems in terms of fuzzy sets and fuzzy reasoning applied to a set of linear input output i o submodels in this paper the ts fuzzy model approach is extended to the stability analysis and control design for both continuous and discrete time nonlinear systems with time delay the ts fuzzy models with time delay are presented and the stability conditions are derived using lyapunov krasovskii approach we also present a stabilization approach for nonlinear time delay systems through fuzzy state feedback and fuzzy observer based controller sufficient conditions for the existence of fuzzy state feedback gain and fuzzy observer gain are derived through the numerical solution of a set of coupled linear matrix inequalities an illustrative example based on the cstr model is given to design a fuzzy controller

a bijective proof of infinite variated good s inversion abstract we use the theory of colored species to prove the plethystic lagrange inversion formula and infinite variated good s inversion formula these inversion formulas are shown to be equivalent to transfer formulas in the infinite variated umbral calculus

on the stability of takagi sugeno fuzzy systems with time varying uncertainties this paper studies the problems of stability analysis of takagi sugeno free fuzzy systems with time varying uncertainties in our prior study we represented the time varying uncertainty incurred in characteristic interval matrices in terms of the stability of takagi sugeno free fuzzy systems with consequent parameter uncertainties based on mayer s convergent theorem for powers of single interval matrix and its generalization we further proposed some sufficient conditions for the takagi sugeno free fuzzy system with time varying uncertainties to be globally asymptotically stable in this paper we propose the notion of simultaneously nilpotent interval matrices to investigate the takagi sugeno free fuzzy system with time varying uncertainties to be strongly stable within steps where relates to the dimension of interval matrices moreover a unique situation for the deterministic takagi sugeno free fuzzy system to be strongly stable within steps is derived as well where relates to the dimension of characteristic matrices for the deterministic takagi sugeno free fuzzy system

stability analysis of discrete time fuzzy dynamic systems based on piecewise lyapunov functions this paper presents a stability analysis method for discrete time takagi sugeno fuzzy dynamic systems based on a piecewise smooth lyapunov function it is shown that the stability of the fuzzy dynamic system can be established if a piecewise lyapunov function can be constructed and moreover the function can be obtained by solving a set of linear matrix inequalities that is numerically feasible with commercially available software it is also demonstrated via numerical examples that the stability result based on the piecewise quadratic lyapunov functions is less conservative than that based on the common quadratic lyapunov functions

the generalized spectral radius theorem an analytic geometric proof abstract let be a bounded set of complex matrices m a 1 a m a i the generalized spectral radius theorem states that where and are defined as follows lim sup m 1 m where m sup a a m with a the spectral radius lim sup m 1 m where m sup a a m with any matrix norm we give an elementary proof based on analytic and geometric tools which is in some ways simpler than the first proof by berger and wang

facets for the cut cone ii clique web inequalities we study new classes of facets for the cut conec n generated by the cuts of the complete graph onn vertices this cone can also be interpreted as the cone of all semi metrics onn points that are isometricallyl1 embeddable and in fact the study of the facets of the cut polytope is in some sense equivalent to the study of the facets ofc n these new facets belong to the class of clique web inequalities which generalize the hypermetric and cycle inequalities as well as the bicycle odd wheel inequalities

robust controllability of t s fuzzy model based control systems with parametric uncertainties the robust controllability problem for the takagi sugeno t s fuzzy model based control systems is studied in this paper under the assumption that the nominal t s fuzzy model based control systems are locally controllable i e each fuzzy rule of the nominal t s fuzzy model based control systems has a full row rank for its controllability matrix a sufficient condition is proposed to preserve the assumed property when the parameter uncertainties are added into the nominal t s fuzzy model based control systems the proposed sufficient condition can provide the explicit relationship of the bounds on parameter uncertainties to preserve the assumed property besides a robustly global controllability condition and the related robustly global stabilizability condition of the uncertain t s fuzzy model based control systems are also presented in this paper a nonlinear mass spring damper mechanical system with parameter uncertainties is given as an example to illustrate the application of the proposed sufficient conditions

approximation of the joint spectral radius using sum of squares we provide an asymptotically tight computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares sos programming the approach is based on a search for an sos polynomial that proves simultaneous contractibility of a finite set of matrices we provide a bound on the quality of the approximation that unifies several earlier results and is independent of the number of matrices additionally we present a comparison between our approximation scheme and earlier techniques including the use of common quadratic lyapunov functions and a method based on matrix liftings theoretical results and numerical investigations show that our approach yields tighter approximations

a note on a gap result for norms of semigroups of matrices abstract let be a matrix norm and be a bounded set of n n complex matrices for each m 1 2 let m sup a a m where m a1a2 am ai bell proved that there is a gap in the possible growth of m if consists of finitely many n n complex matrices in this note based on a lemma by elsner we give an elementary proof of bell s theorem in bounded case

the generalised berger wang formula and the spectral radius of linear cocycles using ergodic theory we prove two formulae describing the relationships between different notions of joint spectral radius for sets of bounded linear operators acting on a banach space the first formula was previously obtained by v s shulman and yu v turovski using operator theoretic ideas the second formula shows that the joint spectral radii corresponding to several standard measures of noncompactness share a common value when applied to a given precompact set of operators this result may be seen as an extension of classical formulae for the essential spectral radius given by r nussbaum a lebow and m schechter both results are obtained as a consequence of a more general theorem concerned with continuous operator cocycles defined over a compact dynamical system as a byproduct of our method we answer a question of j e cohen on the limiting behaviour of the spectral radius of a measurable matrix cocycle

bounded semigroups of matrices in this note are proved two conjectures of daubechies and lagarias the first asserts that if z is a bounded set of matrices such that all left infinite products converge then 8 generates a bounded semigroup the second asserts the equality of two differently defined joint spectral radii for a bounded set of matrices one definition involves the conventional spectral radius and one involves the operator norm

clique web facets for multicut polytopes let g v e be a graph an edge set uv e u si v sj i j where s1 sk is a partition of v is called a multicut with k shores we investigate the polytopes mck n and mck n that are defined as the convex hulls of the incidence vectors of all multicuts with at most k shores and at least k shores respectively of the complete graph kn we introduce a large class of inequalities called clique web inequalities valid for these polytopes and provide a quite complete characterization of those clique web inequalities that define facets of mck n and mck n using general facet manipulation techniques like collapsing and node splitting we construct further new classes of facets for these multicut polytopes we also exhibit a class of clique web facets for which the separation problem can be solved in polynomial time

an approach to adaptive control of fuzzy dynamic systems this paper discusses adaptive control for a class of fuzzy dynamic models the adaptive control law is first designed in each local region and then constructed in the global domain it is shown that the resulting fuzzy adaptive control system is globally stable robustness issues of the adaptive control system are also addressed a simulation example is given for demonstration of the application of the approach

piecewise quadratic stability of fuzzy systems presents an approach to stability analysis of fuzzy systems the analysis is based on lyapunov functions that are continuous and piecewise quadratic the approach exploits the gain scheduling nature of fuzzy systems and results in stability conditions that can be verified via convex optimization over linear matrix inequalities examples demonstrate the many improvements over analysis based on a single quadratic lyapunov function special attention is given to the computational aspects of the approach and several methods to improve the computational efficiency are described

asymptotic stability and generalized gelfand spectral radius formula let be a set of n n complex matrices for m 1 2 let m be the set of all products of matrices in of length m denote by the multiplicative semigroup generated by is said to be asymptotically stable in the sense of dynamical systems if there is 0 1 such that there are bounded neighborhoods u v cn of the origin for which av mu for all a m m 1 2 for a bounded set of n n complex matrices it is shown that the following conditions are mutually equivalent i is asymptotically stable ii g9 lim supm supa m a 1 m 1 iii lim supm supa m a 1 m 1 where a stands for the spectral radius of a and iv there exists a positive number such that a 1 for all a this fact answers an open question raised by brayton and tong the generalized gelfand spectral radius formula that is g9 conjectured by daubechies and lagarias and proved by berger and wang using advanced tools from ring theory and then by elsner using analytic geometric tools follows immediately form the above asymptotic stability theorem