Irreducible morphisms of categories of complexes

We study irreducible morphisms of complexes. In particular, we show that the irreducible morphisms having one (finite) irreducible submorphism fall into three canonical forms and we give necessary and sufficient conditions for a given morphism of that type to be irreducible. Our characterization of the above mentioned type of irreducible morphisms of complexes characterizes also some class of irreducible morphisms of the derived category D(-)(A) for A a finite dimensional k-algebra, where k is a field. (C) 2009 Published by Elsevier Inc.

A NOTE ON THE COMPOSITE OF TWO IRREDUCIBLE MORPHISMS

In this note, we show that a composite of two irreducible morphisms between indecomposable modules cannot lie in R(3)\R(5).

On the composite of irreducible morphisms in almost sectional paths

We study here when the composite of it irreducible morphisms in almost sectional paths is non-zero and lies in Rn+1 (C) 2007 Elsevier B.V. All rights reserved.

ON THE COMPOSITE OF THREE IRREDUCIBLE MORPHISMS IN THE FOURTH POWER OF THE RADICAL

We study here the nonzero composite of three irreducible morphisms between indecomposable modules lying in the fourth power of the radical.

Invariance under type morphisms: the bayesian Nash equilibrium

Ely and Peski (2006) and Friedenberg and Meier (2010) provide examples when changing the type space behind a game, taking a "bigger" type space, induces changes of Bayesian Nash Equilibria, in other words, the Bayesian Nash Equilibrium is not invariant under type morphisms. In this paper we introduce the notion of strong type morphism. Strong type morphisms are stronger than ordinary and conditional type morphisms (Ely and Peski, 2006), and we show that Bayesian Nash Equilibria are not invariant under strong type morphisms either. We present our results in a very simple, finite setting, and conclude that there is no chance to get reasonable assumptions for Bayesian Nash Equilibria to be invariant under any kind of reasonable type morphisms.

Reflections of universal algebras into semilattices, their Galois theories, and related factorization systems

Estabelecemos uma condição suficiente para a preservação dos produtos finitos, pelo reflector de uma variedade de álgebras universais numa subvariedade, que é, também, condição necessária se a subvariedade for idempotente. Esta condição é estabelecida, seguidamente, num contexto mais geral e caracteriza reflexões para as quais a propriedade de ser semi-exacta à esquerda e a propriedade, mais forte, de ter unidades estáveis, coincidem. Prova-se que reflexões simples e semi-exactas à esquerda coincidem, no contexto das variedades de álgebras universais e caracterizam-se as classes do sistema de factorização derivado da reflexão. Estabelecem-se resultados que ajudam a caracterizar morfismos de cobertura e verticais-estáveis em álgebras universais e no contexto mais geral já referido. Caracterizam-se as classes de morfismos separáveis, puramente inseparáveis e normais. O estudo dos morfismos de descida de Galois conduz a condições suficientes para que o seu par kernel seja preservado pelo reflector.

Shrinking restarting automata

Restarting automata are a restricted model of computation that was introduced by Jancar et.al. to model the so-called analysis by reduction. A computation of a restarting automaton consists of a sequence of cycles such that in each cycle the automaton performs exactly one rewrite step, which replaces a small part of the tape content by another, even shorter word. Thus, each language accepted by a restarting automaton belongs to the complexity class $CSL cap NP$. Here we consider a natural generalization of this model, called shrinking restarting automaton, where we do no longer insist on the requirement that each rewrite step decreases the length of the tape content. Instead we require that there exists a weight function such that each rewrite step decreases the weight of the tape content with respect to that function. The language accepted by such an automaton still belongs to the complexity class $CSL cap NP$. While it is still unknown whether the two most general types of one-way restarting automata, the RWW-automaton and the RRWW-automaton, differ in their expressive power, we will see that the classes of languages accepted by the shrinking RWW-automaton and the shrinking RRWW-automaton coincide. As a consequence of our proof, it turns out that there exists a reduction by morphisms from the language class $cL(RRWW)$ to the class $cL(RWW)$. Further, we will see that the shrinking restarting automaton is a rather robust model of computation. Finally, we will relate shrinking RRWW-automata to finite-change automata. This will lead to some new insights into the relationships between the classes of languages characterized by (shrinking) restarting automata and some well-known time and space complexity classes.

Critical anthropomorphism and animal ethics

Anthropomorphism has long been considered a cardinal error when describing animals. Ethicists have feared the consequences of misrepresenting animals in their reasoning. Recent research within human-animal studies, however, has sophisticated the notion of anthropomorphism. It is suggested that avoiding anthropomorphism merely creates other morphisms, such as mechanomorphism. Instead of avoiding anthropomorphism, it is argued that it is a communicative strategy that should be used critically. Instances of anthropomorphism in animal ethics are analyzed in this paper. Some analogies made between people and non-human animals in present theories of animal ethics are clear instances of psychological anthropomorphism. Other analogies are implicit cases of cultural anthropomorphism. It is argued that animal ethics needs to take the wider discourse of critical anthropomorphism into account in order to sophisticate the understanding and use of anthropomorphic projections. Anthropomorphism is an efficient tool of communication, and it may be made an adequate one as well.

Results on singularities of pairs

Thesis (Ph.D.)--University of Washington, 2016-06

Indice de Point Fixe pour les Morphismes de Chaînes

2000 Mathematics Subject Classification: 54H25, 55M20.