On the topological equivalence of flows of Brouwer homeomorphisms

We prove that the set of all regular points of a flow of Brouwer homeomorphisms is invariant under topological equivalence of flows. We also show that a similar result holds for the first prolongational limit set.     

On fractional iterates of a Brouwer homeomorphism embeddable in a flow

We present a method for finding continuous (and consequently homeomorphic) orientation preserving iterative roots of a Brouwer homeomorphism which is embeddable in a flow. To obtain the roots we use a countable family of maximal parallelizable regions of the flow which is a cover of the plane. The maximal parallelizable regions are unions of equivalence classes of an appropriate equivalence relation. We show that if an equivalence class is invariant under the nth iterate of a Brouwer homeomorphism g, then it is invariant under g. We use this fact to prove that each maximal parallelizable region of the flow must be invariant under all homeomorphic orientation preserving iterative roots of the given Brouwer homeomorphism.     

On properties of the set of invariant lines of a Brouwer homeomorphism

Abstract

We present properties of sets of invariant lines for Brouwer homeomorphisms which are not necessarily embeddable in a flow. Using such lines we describe the structure of equivalence classes of the codivergency relation. We also obtain a result concerning the set of regular points.     

Constructive Proofs of the Brouwer Type Coincidence Theorems

In 1 966,Schirmer[1 ] proved the following interesting Brouwer type coincidencetheorem for the n dimensional closed unit disc Dn.　 Theorem1　 Suppose that the continuous mapping f:Dn→ Dn maps the boundary Sn- 1essentially onto itself.Then for any continuous mapping g:Dn→Dn,the equationf(x) =g(x)has a solution in Dn.　 This result is closely related to Brouwer' s celebrated fixed point theorem. Someimportant generalizations and applications of it can be found in [2— 4 ] .　 In this not…     

Solving a Class of Brouwer Fixed-point Problems via a Modified Aggregate Constraint Homotopy Method

In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method （proposed by Yu and Lin, Appl. Math. Comput., 74（1996）, 65）, the main adavantages of this method are as foUows： on the one hand, it can solve the Brouwer fixed-point problems in a broader class of nonconvex subsets Ω in R^n （in this paper, we let Ω={x∈ R^n ： gi（x） ≤0, i= 1,... , m}）; on the other hand, it can also deal with the subsets Ω with larger amount of constraints more effectively.     

求解Brouwer不动点问题的改进同伦方法

In this paper,we modify the homotopy method(proposed by Yu and Lin,Appl.Math.Comput.,74(1996),65)and hence make the modified method be able to solve Brouwer fixed-point problems in a broader class of nonconvex subsets in R~n.In addition,a simple example is given to show the effectiveness of the modified method.     

On families of invariant lines of a Brouwer homeomorphism

ABSTRACT

We present properties of equivalence classes of the codivergency relation defined for a Brouwer homeomorphism for which there exists a family of invariant pairwise disjoint lines covering the plane. In particular, using the codivergency relation we describe the sets of regular and irregular points for such Brouwer homeomorphisms. Moreover, we show that under this assumption the interior of each equivalence class of this relation is invariant and simply connected.     

On the Brouwer Dimension of Compact Spaces

A closed set is called a cut between two disjoint sets if any continuum intersecting both these sets intersects the cut. The main result of this paper is that, for any compact space, the dimension defined by induction on the basis of the notion of cut does not exceed the covering dimension.     

用改进的凝聚约束同伦方法求解一类Brouwer不动点问题

In this paper, we provide an aggregate function homotopy interior point method to solve a class of Brouwer fixed-point problems. Compared with the homotopy method (proposed by Yu and Lin, Appl. Math. Comput., 74(1996), 65), the main adavantages of this method are as follows: on the one hand, it can solve the Brouwer fixed-point problems in a broader class of nonconvex subsets Ω in Rn (in this paper, we let Ω = [x ∈ Rn: gi(x) ≤ 0, i = 1,… ,m]); on the other hand, it can also deal with the subsets Ω with larger amount of constraints more effectively.     

The Creating Subject,the Brouwer–Kripke Schema,and infinite proofs

Kripke’s Schema (better the Brouwer–Kripke Schema) and the Kreisel–Troelstra Theory of the Creating Subject were introduced around the same time for the same purpose, that of analysing Brouwer’s ‘Creating Subject arguments’; other applications have been found since. I first look in detail at a representative choice of Brouwer’s arguments. Then I discuss the original use of the Schema and the Theory, their justification from a Brouwerian perspective, and instances of the Schema that can in fact be found in Brouwer’s own writings. Finally, I defend the Schema and the Theory against a number of objections that have been made.     

同伦方法求解非凸区域Brouwer不动点问题

本文构造了一个新的求解非凸区域上不动点问题的内点同伦算法,并在弱法锥(见定义2．1(2))和适当的条件下,证明了算法的全局收敛性．本文所给的条件比外法锥条件更加一般．     

Maximal antipodal sets of compact classical symmetric spaces and their cardinalities I

We classify and explicitly describe maximal antipodal sets of some compact classical symmetric spaces and those of their quotient spaces by making use of suitable embeddings of these symmetric spaces into compact classical Lie groups. We give the cardinalities of maximal antipodal sets and we determine the maximum of the cardinalities and maximal antipodal sets whose cardinalities attain the maximum.     

Mathematical modelling of surface vibration with volume constraint and its analysis

A hyperbolic problem with volume constraint is investigated by means of a minimizing method called the discrete Morse flow. A weak solution is introduced in a constructive way and results of numerical computations are shown.     

Array theory and the nial programming language

The Nested Interactive Array Language Nial is based on a mathematical theory of hierarchical rectangular arrays known as array theory. This paper gives a brief introduction to array theory and Nial and then discusses the main characteristics of the Nial language, its current implementation and some of its applications.Dedicated to Peter Naur on the occasion of his 60th birthday.     

On the notion of canonical dimension for algebraic groups

We define and study a numerical invariant of an algebraic group action which we call the canonical dimension. We then apply the resulting theory to the problem of computing the minimal number of parameters required to define a generic hypersurface of degree d in P^n-1.     

On Korn's Inequality

The author first reviews the classical Korn inequality and its proof. Following recent works of S. Kesavan, P. Ciarlet, Jr., and the author, it is shown how the Korn inequality can be recovered by an entirely different proof. This new proof hinges on appropriate weak versions of the classical Poincare and Saint-Venant lemma. In fine, both proofs essentially depend on a crucial lemma of J. L. Lions, recalled at the beginning of this paper.     

Direct image of parabolic line bundles

Given a vector bundle E, on an irreducible projective variety X, we give a necessary and sufficient criterion for E to be a direct image of a line bundle under a surjective étale morphism. The criterion in question is the existence of a Cartan subalgebra bundle of the endomorphism bundle $\text{End}(E)$. As a corollary, a criterion is obtained for E to be the direct image of the structure sheaf under an étale morphism. The direct image of a parabolic line bundle under any ramified covering map has a natural parabolic structure. Given a parabolic vector bundle, we give a similar criterion for it to be the direct image of a parabolic line bundle under a ramified covering map.