Contractibility and Connectedness of Efficient Point Sets

Using the technique of space theory and set-valued analysis, we establish contractibility results for efficient point sets in a locally convex space and a path connectedness result for a positive proper efficient point set in a reflexive space. We also prove a connectedness result for a positive proper efficient point set in a locally convex space; as an application, we give a connectedness result for an efficient solution set in a locally convex space.     

集值优化问题Benson真有效解的高阶Fritz John型最优性条件

本文讨论的是集值优化问题Benson真有效解的高阶Fritz John型最优性条件,利用Aubin和Fraukowska引入的高阶切集和凸集分离定理,在锥-似凸映射的假设条件下,获得了带广义不等式约束的集值优化问题Benson真有效解的高阶Fritz John型必要和充分性条件.     

Optimality of Balanced Proper Orthogonal Decomposition for Data Reconstruction

Proper orthogonal decomposition (POD) finds an orthonormal basis yielding an optimal reconstruction of a given dataset. We consider an optimal data reconstruction problem for two general datasets related to balanced POD, which is an algorithm for balanced truncation model reduction for linear systems. We consider balanced POD outside of the linear systems framework, and prove that it solves the optimal data reconstruction problem. The theoretical result is illustrated with an example.     

Part 1: Dynamical Characterization of a Frictionally Excited Beam

The dynamics of an experimental frictionally excited beam areinvestigated. The friction is characterized and shown to involve contactcompliance. Beam displacements are approximated from strain gagesignals. The system dynamics are rich, including a variety of periodic,quasi-periodic and chaotic responses. Proper orthogonal decomposition isapplied to chaotic data to obtain information about the spatialcoherence of the beam dynamics. Responses for different parameter valuesresult in a different set of proper orthogonal modes. The number ofproper orthogonal modes that account for 99.99% of the signalpower is compared to the corresponding number of linear normal modes,and it is verified that the proper orthogonal modes are more efficientin capturing the dynamics.     

关于C.Fefferman定理与全纯映射的边界扩充

C．Fefferman定理证明了光滑有界强拟凸域之间的双全纯映射可以光滑延拓到边界，这个结果已经被推广到各种情形．其中Bell和Catlin以及Diederich和Fornaess独立地将其推广到拟凸域的逆紧全纯映射．本文较全面地综述了C．Fefferman定理的推广情况以及Bergman投射的边界正则性问题，同时对如何去掉Bell和Catlin以及Diederich和Fornaess定理条件中的拟凸性给出一个新观察，提出一个解决方向并且说明在具体情况下这个新观察确实是可以提供答案的．     

Proper Efficiency in Vector Optimization on Real Linear Spaces

In this paper, we use an algebraic type of closure, which is called vector closure, and through it we introduce some adaptations to the proper efficiency in the sense of Hurwicz, Benson, and Borwein in real linear spaces without any particular topology. Scalarization, multiplier rules, and saddle-point theorems are obtained in order to characterize the proper efficiency in vector optimization with and without constraints. The usual convexlikeness concepts used in such theorems are weakened through the vector closure.     

Hopf cyclic cohomology and Hodge theory for proper actions on complex manifolds

We introduce two Hopf algebroids associated to a proper and holomorphic Lie group action on a complex manifold. We prove that the cyclic cohomology of each Hopf algebroid is equal to the Dolbeault cohomology of invariant differential forms. When the action is cocompact, we develop a generalized complex Hodge theory for the Dolbeault cohomology of invariant differential forms. We prove that every cyclic cohomology class of these two Hopf algebroids can be represented by a generalized harmonic form. This implies that the space of cyclic cohomology of each Hopf algebroid is finite dimensional. As an application of the techniques developed in this paper, we generalize the Serre duality and prove a Kodaira type vanishing theorem.     

Completing orientations of partially oriented graphs

We initiate a general study of what we call orientation completion problems. For a fixed class of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in by orienting the (nonoriented) edges in P. Orientation completion problems commonly generalize several existing problems including recognition of certain classes of graphs and digraphs as well as extending representations of certain geometrically representable graphs. We study orientation completion problems for various classes of oriented graphs, including k‐arc‐strong oriented graphs, k‐strong oriented graphs, quasi‐transitive‐oriented graphs, local tournaments, acyclic local tournaments, locally transitive tournaments, locally transitive local tournaments, in‐tournaments, and oriented graphs that have directed cycle factors. We show that the orientation completion problem for each of these classes is either polynomial time solvable or NP‐complete. We also show that some of the NP‐complete problems become polynomial time solvable when the input‐oriented graphs satisfy certain extra conditions. Our results imply that the representation extension problems for proper interval graphs and for proper circular arc graphs are polynomial time solvable. The latter generalizes a previous result.     

On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under benson proper efficiency

ＩｎｔｒｏｄｕｃｔｉｏｎＩｔｉｓｗｅｌｌ＿ｋｎｏｗｎｔｈａｔｔｈｅＦｒｉｔｚＪｏｈｎｏｐｔｉｍａｌｉｔｙｃｏｎｄｉｔｉｏｎｗｉｔｈｄｅｒｉｖａｔｉｖｅｉｓｏｎｅｏｆｔｈｅｍｏｓｔｉｍｐｏｒｔａｎｔｒｅｓｕｌｔｓｏｆｃｏｎｓｔｒａｉｎｅｄｏｐｔｉｍｉｚａｔｉｏｎｔｈｅｏｒｙ .Ｉｔｈａｓｂｅｅｎｅｘｔｅｎｄｅｄｔｏｖｅｃｔｏｒ＿ｖａｌｕｅｄｆｕｎｃｔｉｏｎｓｉｎａｂｓｔｒａｃｔｓｐａｃｅｓｕｎｄｅｒｗｅａｋｅｆｆｉｃｉｅｎｃｙ[1].ＷｉｔｈｔｈｅｈｅｌｐｏｆａｋｉｎｄｏｆＣｏｎｔｉｎｇｅｎｔｄｅｒｉｖ…     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .