Consistency of a linear system of inequalities

We show that a consistency check of a linear system of inequalitiesAxb reduces to check whetherQb0 for a certain matrixQ. It is a direct consequence of the Farkas-Minkowski theorem. Thus, when one has to check consistency for different values ofb, one need not run a numerical algorithm for eachb.On leave at the Electronics Research Laboratory of the University of California at Berkeley in a CNRS/NSF Exchange Program.     

A generalized Dedekind-Mertens lemma and its converse

We study content ideals of polynomials and their behavior under multiplication. We give a generalization of the Lemma of Dedekind-Mertens and prove the converse under suitable dimensionality restrictions.

     

关于Morse引理的推广

Morse Lemma是奇点理论中一个极为重要的结论。[1]的作者称其文中的定理1和定理2是Morse Lemma的推广。为此我们愿就[1]中的几个问题与[1]的作者商榷。     

Averaging on slow and fast cycles of a three time scale system

Pontryagin–Rodygin?s Theorem for slow and fast systems describes the slow drift during the rolling up of the trajectories around the cycles of the fast dynamics. This drift is approximated by the averaging on the cycles. The calculation of this average is generally a difficult task since it requires the knowledge of the closed orbits and their periods. We present two paradigms of three time scale systems where we can overcome this limitation. It is the case of systems the fast dynamics of which have cycles with relaxation presenting or not a canard phenomenon. We can not apply Pontryagin–Rodygin?s Theorem to these systems because their fast equation is itself singularly perturbed. We also investigate the extension of the results to unbounded time intervals. The results are stated classically and proved within the framework of nonstandard analysis.     

Categorical abstract algebraic logic: The Diagram and the Reduction Operator Lemmas

The study of structure systems, an abstraction of the concept of first‐order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first‐order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality‐free first‐order structures are provided in the framework of structure systems. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Generalized Schwarz Lemma

In this paper,we establish a boundary Schwarz Lemma for holomorphic mapping on the generalized complex ellipsoid in Cn.     

On Quillen?s Theorem A for posets

A theorem of McCord of 1966 and Quillen?s Theorem A of 1973 provide sufficient conditions for a map between two posets to be a homotopy equivalence at the level of complexes. We give an alternative elementary proof of this result and we deduce also a stronger statement: under the hypotheses of the theorem, the map is not only a homotopy equivalence but a simple homotopy equivalence. This leads then to stronger formulations of the simplicial version of Quillen?s Theorem A, the Nerve Lemma and other known results. In particular we establish a conjecture of Kozlov on the simple homotopy type of the crosscut complex and we improve a well-known result of Cohen on contractible mappings.     

Elementary submodels in infinite combinatorics

The use of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary submodels. We also present a new proof of Nash-Williams’s theorem on cycle decomposition of graphs, and finally we improve a decomposition theorem of Laviolette concerning bond-faithful decompositions of graphs.     

A Network Algorithm for Realizing Constructivelythe Farkas Lemma Arising from the Quasi-Generalized Network

1.IntroductionLetRIbethespaceofallrealvectorsindexedbyelementsofafiniteseti,icachosenelemelltofi,SandS*apairofcompletelyorthogonalsubspacesofRI.Foragivenpartition(PI,P2,P3,P4)ofI--{ic}(i.e.PIuPZuP3uP4=I--{eo},andPinPj=acfori/j),letF={axled6S,Ax'.>0,Ax.20fore6PI,Ax.50foreEP2,Ax.~0foreEP3},F*={dyIAyES*,ac.>0,ace30foreEPI,ac50foreEP2,ac.~0foreEP4}.Now,theFarkasLemmacanbegenerallydescribedas[1]:oneandonlyoneofthefollowingtwostatemelltsholds:(i)ThereexistsaaxEF.(n)Thereexistsaac…