Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Concept of a vertex in a matroid and 3-connected graphs

The concept of a matroid vertex is introduced. The vertices of a matroid of a 3-connected graph are in one-to-one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3-connected graphs implies isomorphism. The concept of a vertex of a matroid leads to an equally simple proof of Whitney's theorem on the unique embedding of a 3-connected planar graph in the sphere. It also leads to a number of new facts about 3-connected graphs. Thus, consideration of a vertex in a matroid that is the dual of the matroid of a graph leads to a natural concept of a nonseparating cycle of a graph. Whitney's theorem on cyclic isomorphism can be strengthened (even if the nonseparating cycles of a graph are considered, the theorem is found to work) and a new criterion for planarity of 3-connected graphs is obtained (in terms of nonseparating cycles).     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

Continuous conjugation of special nonisentropic one-dimensional gas motions

The exact partially invariant solution of equations of motion of a compressible fluid describing the collapse of particles to a point and an instantaneous source from the point in a one-dimensional nonisentropic motion is cut off by the characteristics and glued into a continuous solution of a one-dimensional submodel in a finite domain. The possibility of a continuous periodic nonisentropic motion of a compressible fluid in a bounded domain under the action of a piston is shown.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

A New Pareto Optimal Solution in a Lagrange Decomposable Multi-Objective Optimization Problem

In this paper a committee decision-making process of a convex Lagrange decomposable multi-objective optimization problem, which has been decomposed into various subproblems, is studied. Each member of the committee controls only one subproblem and attempts to select the optimal solution of this subproblem most desirable to him, under the assumption that all the constraints of the total problem are satisfied. This procedure leads to a new solution concept of a Lagrange decomposable multi-objective optimization problem, called a preferred equilibrium set. A preferred equilibrium point of a problem, for a committee, may or may not be a Pareto optimal point of this problem. In some cases, a non-Pareto optimal preferred equilibrium point of a problem, for a committee, can be considered as a special type of Pareto optimal point of this problem. This fact leads to a generalization of the Pareto optimality concept in a problem.     

Knuth’s Coherent Presentations of Plactic Monoids of Type A

We construct finite coherent presentations of plactic monoids of type A. Such coherent presentations express a system of generators and relations for the monoid extended in a coherent way to give a family of generators of the relations amongst the relations. Such extended presentations are used for representations of monoids, in particular, it is a way to describe actions of monoids on categories. Moreover, a coherent presentation provides the first step in the computation of a categorical cofibrant replacement of a monoid. Our construction is based on a rewriting method introduced by Squier that computes a coherent presentation from a convergent one. We compute a finite coherent presentation of a plactic monoid from its column presentation and we reduce it to a Tietze equivalent one having Knuth’s generators.     

弱辫子T-范畴（英文）

Recently Turaev generalized the notion of a tensor category to that of a crossed group category.In[5]the authors constructed the representation category Rep(H) of a T-coalgebra H.In[2]the authors introduced the notions of a weak tensor category to characterize a weak bialgebra and a weak Hopf algebra.This paper is based on these ideas to naturally introduce the notions of a weak T-category and a weak braided T-category which are not under the usual way and prove that the categories of representations of a weak T-coalgebra and a weak braided T-coalgebra are a weak T-category and a weak braided T-category respectively.Furthermore we also discuss some properties of weak T-category.     

Staircase Parameterization in Dynamical Selection

This paper deals with a variant of a dynamical selection scheme introduced by Attouch and Cominetti for ill-posed convex minimization which combines approximation with the steepest descent method by mean of a suitable parameterization of the approximation parameter as a function of the time. This variant applies to a general inclusion with a maximal monotone operator by mean of a staircase parameterization. A discrete analogue is also considered. Applications to selecting a particular zero of a maximal monotone operator or a particular fixed point of a nonexpansive mapping via regularization techniques are presented. Finally, the alternative use of well-posedness by perturbations is discussed.     

A generalized duality and applications

The aim of this paper is to present a nonconvex duality with a zero gap and its connection with convex duality. Since a convex program can be regarded as a particular case of convex maximization over a convex set, a nonconvex duality can be regarded as a generalization of convex duality. The generalized duality can be obtained on the basis of convex duality and minimax theorems. The duality with a zero gap can be extended to a more general nonconvex problems such as a quasiconvex maximization over a general nonconvex set or a general minimization over the complement of a convex set. Several applications are given.On leave from the Institute of Mathematics, Hanoi, Vietnam.     

On bifurcations of multidimensional diffeomorphisms having a homoclinic tangency to a saddle-node

We study the main bifurcations of multidimensional diffeomorphisms having a nontransversal homoclinic orbit to a saddle-node fixed point. On a parameter plane we build a bifurcation diagram for single-round periodic orbits lying entirely in a small neighborhood of the homoclinic orbit. Also, a relation of our results to the well-known codimension one bifurcations of a saddle fixed point with a quadratic homoclinic tangency and a saddle-node fixed point with a transversal homoclinic orbit is discussed.     

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

Genus fields of Kummer extensions of rational function fields

In this paper we obtain the genus field of a general Kummer extension of a global rational function field. We study first the case of a general Kummer extension of degree a power of a prime. Then we prove that the genus field of a composite of two abelian extensions of a global rational function field with relatively prime degrees is equal to the composite of their respective genus fields. Our main result, the genus of a general Kummer extension of a global rational function field, is a direct consequence of this fact.     

Hybrid iterative scheme for generalized equilibrium problems and fixed point problems of finite family of nonexpansive mappings

In this paper, we introduce a new mapping and a Hybrid iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem and the set of common fixed points of a finite family of nonexpansive mappings in a Hilbert space. Then, we prove the strong convergence of the proposed iterative algorithm to a common fixed point of a finite family of nonexpansive mappings which is a solution of the generalized equilibrium problem. The results obtained in this paper extend the recent ones of Takahashi and Takahashi [S. Takahashi, W. Takahashi, Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space, Nonlinear Anal. 69 (2008) 1025–1033].     

Lagrangians adapted to submersions and foliations

Lagrangians related to submersions and foliations, which are analogous to Riemannian submersions and Riemannian foliations respectively are studied in the paper. One prove that a bundle-like Lagrangian, a transverse hyperregular Lagrangian, a hyperregular Lagrangian foliated cocycle or a geodesic orthogonal property are equivalent data for a foliation. A conjecture of E. Ghys is proved in a more general setting than that of Finslerian foliations: a foliation that has a transverse positively definite Lagrangian is a Riemannian foliation. One extend also a result of Miernowski and Mozgawa on Finslerian foliations, proving that the natural lift to the normal bundle of a Lagrangian foliation that has a transverse positively definite Lagrangian is a Riemannian foliation.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Numerical Evaluation of Functionals based on Variance Minimisation

Numerically evaluating the effect of a functional on a function is a very common task in scientific computing. The definite integral of a function over a domain is an example, differentiating a function in a certain point into a certain direction is another one. We developed a generic method to compute the effect of a functional using a linear approximation formula. The method is designed to generate the nodes and weights needed to approximate different functionals using a single set of tools: it regards the target function as a stochastic field and uses a user–defined covariance function for this field to minimise the error made by the approximation formula. The resulting formulas are optimal in an average case sense: all possible realisations of this stochastic field are taken into account while computing the solution. This results in nodes and weights that evaluate the target functional applied to any realisation with a minimised average error. The space of all realisations of such a stochastic field can be of infinite dimension whereas classical approaches often only consider a finite dimensional space of functions. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)