The Homotopy Type of Lie Semigroups in Semi-Simple Lie Groups

 Let G be a noncompact semi-simple Lie group and a Lie semigroup with nonempty interior. We study the homotopy groups , , of S. Generalizing a well known fact for G, it is proved that there exists a compact and connected subgroup such that is isomorphic to . Furthermore, there exists a coset z contained in int S which is a deformation retract of S.     

The Homotopy Type of Lie Semigroups in Semi-Simple Lie Groups

 Let G be a noncompact semi-simple Lie group and a Lie semigroup with nonempty interior. We study the homotopy groups , , of S. Generalizing a well known fact for G, it is proved that there exists a compact and connected subgroup such that is isomorphic to . Furthermore, there exists a coset z contained in int S which is a deformation retract of S. Received 6 December 2000; in revised form 23 November 2001     

Retract-collapsible graphs and invariant subgraph properties

A (finite or infinite) graph G is retract-collapsible if it can be dismantled by deleting systematically at each step every vertex that is strictly dominated, in such a way that the remaining subgraph is a retract of G, and so as to get a simplex at the end. A graph is subretract-collapsible if some graph obtained by planting some rayless tree at each of its vertices is retract-collapsible. It is shown that the subretract-colapsible graphs are cop-win; and that a ball-Helly graph is subretract-collapsible if and only if it has no isometric infinite paths (thus in particular if it has no infinite paths, or if it is bounded). Several fixed subgraph properties are proved. In particular, if G is a subretract-collapsible graph, and f a contraction from G into G, then (i) if G has no infinite simplices, then f(S) = S for some simplex S of G; and (ii) if the dismantling of G can be achieved in a finite number of steps and if some family of simplices of G has a compacity property, then there is a simplex S of G such that f(S) ? S. This last result generalizes a property of bounded ball-Helly graphs. © 1995 John Wiley & Sons, Inc.     

Fixed point theorems for ordered sets P with P ∖ {a,c} as retract

We prove fixed point theorems for ordered sets P that have a retract with two points less than P and show how they can be used to prove the fixed point property for various well-known and various new ordered sets.     

Why contextualists cannot know they are right: Self-refuting implications of contextualism

Conversational contextualism in epistemology is characterized by four main theses: 1. the indexicality of knowledge claims thesis; 2. the attributor contextualism thesis; 3. the conversational contextualism thesis, and 4. the main thesis of contextualism according to which a knowledge claim can be true in one context and false in another context in which more stringent standards for knowledge are operant. It is argued that these theses taken together generate problems for contextualism. In particular, it is shown that there is no context in which the contextualist can truthfully claim to know her theory is true. Since these results were obtained only with principles the contextualist cannot give up—like the principle of epistemic closure and the principle that knowledge implies truth—it seems that contextualism is in need of a thoroughgoing revision if it is to become a successful epistemic theory.     

Minimal extensions of graphs to absolute retracts

A graph H is an absolute retract if for every isometric embedding h of, into a graph G an edge-preserving map g from G to H exists such that g · h is the identity map on H. A vertex v is embeddable in a graph G if G ? v is a retract of G. An absolute retract is uniquely determined by its set of embeddable vertices. We may regard this set as a metric space. We also prove that a graph (finite metric space with integral distance) can be isometrically embedded into only one smallest absolute retract (injective hull). All graphs in this paper are finite, connected, and without multiple edges.     

On the Partially Ordered Semigroup Generated by the Class Operators I,R,H,S,P

Let I, H, S, P be the usual class operators on universal algebras. For a class K of universal algebras of the same type, let R({K}) be the class of all algebras isomorphic to a retract of a member of K and let R denote the corresponding class operator. In this paper the semigroup generated by class operators I, R, H, S, P and the corresponding partially ordered set are described. Also the standard semigroups of the above operators are determined for some varieties.     

The generation of formulas held in common knowledge

Common knowledge of a finite set of formulas implies a special relationship between syntactic and semantic common knowledge. If S, a set of formulas held in common knowledge, is implied by the common knowledge of some finite subset of S, and A is a non-redundant semantic model where exactly S is held in common knowledge, then the following are equivalent: (a) S is maximal among the sets of formulas that can be held in common knowledge, (b) A is finite, and (c) the set S determines A uniquely; otherwise there are uncountably many such A. Even if the knowledge of the agents are defined by their knowledge of formulas, 1) there is a continuum of distinct semantic models where only the tautologies are held in common knowledge and, 2) not assuming that S is finitely generated (a) does not imply (c), (c) does not imply (a), and (a) and (c) together do not imply (b). Received November 1999/Revised version January 2000     

Retracts of box products with odd‐angulated factors

Let G be a connected graph with odd girth 2κ+1. Then G is a (2κ+1)‐angulated graph if every two vertices of G are connected by a path such that each edge of the path is in some (2κ+1)‐cycle. We prove that if G is (2κ+1)‐angulated, and H is connected with odd girth at least 2κ+3, then any retract of the box (or Cartesian) product G□ H is S□T where S is a retract of G and T is a connected subgraph of H. A graph G is strongly (2κ+1)‐angulated if any two vertices of G are connected by a sequence of (2κ+1)‐cycles with consecutive cycles sharing at least one edge. We prove that if G is strongly (2κ+1)‐angulated, and H is connected with odd girth at least 2κ+1, then any retract of G□ H is S□T where S is a retract of G and T is a connected subgraph of H or |V(S)|=1 and T is a retract of H. These two results improve theorems on weakly and strongly triangulated graphs by Nowakowski and Rival [Disc Math 70 ( 13 ), 169–184]. As a corollary, we get that the core of the box product of two strongly (2κ+1)‐angulated cores must be either one of the factors or the box product itself. Furthermore, if G is a strongly (2κ+1)‐angulated core, then either Gⁿ is a core for all positive integers n, or the core of Gⁿ is G for all positive integers n. In the latter case, G is homomorphically equivalent to a normal Cayley graph [Larose, Laviolette, Tardiff, European J Combin 19 ( 12 ), 867–881]. In particular, let G be a strongly (2κ+1)‐angulated core such that either G is not vertex‐transitive, or G is vertex‐transitive and any two maximum independent sets have non‐empty intersection. Then Gⁿ is a core for any positive integer n. On the other hand, let G_i be a (2κ_i+1)‐angulated core for 1 ≤ i≤ n where κ₁ < κ₂ < … < κ_n. If G_i has a vertex that is fixed under any automorphism for 1 ≤ i ≤ n‐1, or G_i is vertex‐transitive such that any two maximum independent sets have non‐empty intersection for 1 ≤ i ≤ n‐1, then □_i=1ⁿ G_i is a core. We then apply the results to construct cores that are box products with Mycielski construction factors or with odd graph factors. We also show that K(r,2r+1) □ C_2l+1 is a core for any integers l ≥ r ≥ 2. It is open whether K(r,2r+1) □ C_2l+1 is a core for r > l ≥ 2. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Retracts and monomorphism monoids in semigroup varieties

If a semigroup varietyV contains the variety of commutative three-nilpotent semigroups, or if it is a variety of bands containing all semilattices, then, for anyA∈V and any left cancellative monoidM, there is a semigroupS∈V such thatA is a retract ofS andM is isomorphic to the monoid of all injective endomorphisms ofS.     

Basic properties of e-inversive semigroups

Generalizing a property of regular resp. finite semigroups a semigroup S is called E-(0-) inversive if for every a ∈ S4(a ≠ 0) there exists x ∈ S such that ax (≠ 0) is an idempotent. Several characterizations are given allowing to identify the (completely, resp. eventually) regular semigroups in this class. The case that for every a ∈ S4(≠ 0) there exist x,y ∈ S such that ax = ya(≠ 0) is an idempotent, is dealt with also. Ideal extensions of E- (0-)inversive semigroups are studied discribing in particular retract extensions of completely simple semigroups. The structure of E- (0-)inversive semigroups satisfying different cancellativity conditions is elucidated. 1991 AMS classification number: 20M10.     

The set of indeterminate rings of a normal pair as a partially ordered set

Let R ì S{R\subset S} be an extension of integral domains and let [R, S] be the set of intermediate rings between R and S ordered by inclusion. If (R, S) is normal pair and [R, S] is finite, we do prove that there exists a semi-local Prüfer ring T with quotient field K such that [R,S] @ [T,K]{[R,S]\cong \lbrack T,K]} (as a partially ordered set). Consequently, any problem relative to the finiteness conditions in [R, S] can be investigated in the particular case where R is a semi-local Prüfer ring with quotient field S.     

Nevanlinna Functions,Perturbation Formulas,and Triplets of Hilbert Spaces

Let S be a closed symmetric operator with defect numbers (1,1) in a Hilbert space ?? and let A be a selfadjoint operator extension of S in ??. Then S is necessarily a graph restriction of A and the selfadjoint extensions of S can be considered as graph perturbations of A, cf. [8]. Only when S is not densely defined and, in particular, when S is bounded, 5 is given by a domain restriction of A and the graph perturbations reduce to rank one perturbations in the sense of [23]. This happens precisely when the Q - function of S and A belongs to the subclass No of Nevanlinna functions. In this paper we show that by going beyond the Hilbert space ?? the graph perturbations can be interpreted as compressions of rank one perturbations. We present two points of view: either the Hilbert space ?? is given a one-dimensional extension, or the use of Hilbert space triplets associated with A is invoked. If the Q - function of S and A belongs to the subclass N₁ of Nevanlinna functions, then it is convenient to describe the selfadjoint extensions of S including its generalized Friedrichs extension (see [6]) by interpolating the original triplet, cf. [5]. For the case when A is semibounded, see also [4]. We prove some invariance properties, which imply that such an interpolation is independent of the (nonexceptional) extension.     

Contextualist theories of knowledge

Contextualist theories of knowledge offer a semantic hypothesis to explain the observed contextual variation in what people say they know, and the difficulty people have resolving skeptical paradoxes. Subject or speaker relative versions make the truth conditions of “S knows that p” depend on the standards of either the knower’s context (Hawthorne and Stanley) or those of the speaker’s context (Cohen and DeRose). Speaker contextualism avoids objections to subject contextualism, but is implausible in light of evidence that “know” does not behave like an indexical. I deepen and extend these criticisms in light of recent defenses by contextualists (including Ludlow). Another difficulty is that whether certain standards are salient or intended does not entail that they are the proper standards. A normative form of contextualism on which the truth of a knowledge claim depends on the proper standards for the context is more promising, but still unsatisfactory whether the view is speaker or subject relative. I defend alternative explanations for the observed linguistic and psychological data: a pragmatic account for some cases and a cognitive account for others.¹ I presented this paper at the 2004 Bled Conference on Contextualism, sponsored by Mirabor and Northern Illinois Universities.     

Retract rational fields and cyclic Galois extensions

In [23], this author began a study of so-called lifting and approximation problems for Galois extensions. One primary point was the connection between these problems and Noether’s problem. In [24], a similar sort of study was begun for central simple algebras, with a connection to the center of generic matrices. In [25], the notion of retract rational field extension was defined, and a connection with lifting questions was claimed, which was used to complete the results in [23] and [24] about Noether's problem and generic matrices. In this paper we, first of all, set up a language which can be used to discuss lifting problems for very general “linear structures”. Retract rational extensions are defined, and proofs of their basic properties are supplied, including their connection with lifting. We also determine when the function fields of algebraic tori are retract rational, and use this to further study Noether’s problem and cyclic 2-power Galois extensions. Finally, we use the connection with lifting to show that ifp is a prime, then the center of thep degree generic division algebra is retract rational over the ground field. The author is grateful for NSF support under grant #MCS79-04473.     

Zur Darstellung der Unterräume von Kettengeometrien

A subspace of a chain geometry in the sense of W. Benz [1] is defined as a subset S of points such that the chain joining any three pairwise non-parallel points of S is contained in S. In this note we are concerned with the problem of determining those subspaces that can be represented by subalgebras.     

Free idempotent generated semigroups: subsemigroups,retracts and maximal subgroups

Let S be a subsemigroup of a semigroup T and let IG(E) and IG(F) be the free idempotent generated semigroups over the biordered sets of idempotents of E of S and F of T, respectively. We examine the relationship between IG(E) and IG(F), including the case where S is a retract of T. We give su?cient conditions satisfied by T and S such that for any e∈E, the maximal subgroup of IG(E) with identity e is isomorphic to the corresponding maximal subgroup of IG(F). We then apply this result to some special cases and, in particular, to that of the partial endomorphism monoid PEnd A and the endomorphism monoid EndA of an independence algebra A of finite rank. As a corollary, we obtain Dolinka’s reduction result for the case where A is a finite set.     

Third-Person Internalism: A Critical Examination of Externalism and a Foundation-Oriented Alternative

This paper starts with an examination of the major problems of foundation-oriented epistemology in Sect. 2. Then, in Sects. 3–4, it is argued that the externalistic re-definition of knowledge deprives this concept from useful applications to human’s epistemic practice. From the viewpoint of cultural evolution, the condition of justification is the most important ingredient of knowledge. An alternative foundation-oriented conception of knowledge called third-person internalism is developed in Sect. 2 and Sect. 5. It combines insights of externalism with the requirement of second-order justification. The application of third-person internalism to contextualistic positions leads to an important constraint on contextualism (Sect. 6). The final section (Sect. 7) sketches new prospects for a foundation-oriented epistemology which are based on epistemic optimality arguments.     

Multiplying Schur functions

A new combinatorial rule for expanding the product of Schur functions as a sum of Schur functions is formulated. The rule has several advantages over the Littlewood-Richardson rule (D. E. Littlewood and A. R. Richardson, Philos. Trans. Roy. Soc. London Ser. A233 (1934), 49–141). First this rule allows for direct computation of the expansion of the product of any number of Schur functions, not just the product of two Schur functions. Also, the rule is easily stated and is well suited to computer implementation. It is shown that the rule implies the Littlewood-Richardson rule and gives a combinatorial proof that the coefficient of S_λ in the product S_μS_ν equals the coefficient of S_ν in the expansion of the skew Schur function S_λ/μ. The rule is derived from some results proved independently by A. P. Hillman and R. M. Grassl (J. Combin. Comput. Sci. Systems5 (1980), 305–316) and by D. White (J. Combin. Theory Ser. A30 (1981), 237–247) on the Robinson-Schensted-Knuth correspondence.