Search results for "isomorphism"

AUDIENCE SUPPORT DECISIONS IN IN THE AFTERMATH OF A SOCIAL SCANDAL: THE ROLES OF LEGITIMACY AND REPUTATION

2014

Constituent audience evaluations and decisions regarding whether to continue to support a corporation after it has been perceived as culpable for socially irresponsible behaviour following corporate social irresponsibility (CSI) scandals are coin of the realm in selecting which firms (or which parts of a firm) will be able to survive a CSI-scandal. Research has largely taken for granted that CSI leads to the loss of corporate legitimacy and, consequently, of constituent audience support. Though legitimacy may be reconstructed, empirics suggest this is a necessary but insufficient condition for the maintenance of audience support. Adopting the evaluators’ perspective, this study focuses on t…

Problemas multiplicativos relacionados con la división de fracciones : un estudio sobre su enseñanza y aprendizaje

2013

Los estudiantes tienen dificultades para asociar el enunciado de un problema multiplicativo con la operación que permite resolverlo; esta investigación identifica los tipos de problemas multiplicativos que los estudiantes reconocen como de división de fracciones. Mediante el análisis histórico-epistemológico de textos de enseñanza sobre tres épocas históricas y ocho períodos diferentes, se obtiene un listado de variables de enseñanza (algoritmos, sentidos de uso de fracción y de división de fracciones, representaciones, problemas), así como los valores de dichas variables. Se localizan en los textos consultados algunas reglas particulares y seis algoritmos generales, cuyo predominio ha vari…

Automorphisms of hyperelliptic GAG-codes

2009

Abstract We determine the n –automorphism group of generalized algebraic-geometry codes associated with rational, elliptic and hyperelliptic function fields. Such group is, up to isomorphism, a subgroup of the automorphism group of the underlying function field.

Kontsevich formality and cohomologies for graphs

2004

A formality on a manifold M is a quasi isomorphism between the space of polyvector fields (Tpoly(M)) and the space of multidifferential operators (Dpoly(M)). In the case M=R d , such a mapping was explicitly built by Kontsevich, using graphs drawn in configuration spaces. Looking for such a construction step by step, we have to consider several cohomologies (Hochschild, Chevalley, and Harrison and Chevalley) for mappings defined on Tpoly. Restricting ourselves to the case of mappings defined with graphs, we determine the corresponding coboundary operators directly on the spaces of graphs. The last cohomology vanishes.

Implementation of IFRS in Japan: An Analysis of Voluntary Adoption by Listed Firms

2019

Since 2010 Japanese listed firms can voluntarily use international financial reporting standards for their consolidated financial statements. Using financial and non-financial data, we carry out a comprehensive research into the adopters’ determinants. We employ a multi-period logit model that considers every annual decision made along the period 2010-2019. We find that the having outside networks through subsidiaries and a strong internal corporate governance system are key factors. We also confirm a contagion effect. Finally, our results suggest that goodwill is also relevant, since only Japanese accounting standards require annual amortization.

“Facts Are Grasped by Us in Pictures (PT, 2.1). Remarks on Pictures and Facts in Wittgenstein’s Tractatus

2023

This paper proposes a (re)reading of the famous section in the Tractatus Logico-philosophicus, 2.1: “We picture facts to ourselves” and its relation to the similar section in the Prototractatus, 2.1: “Facts are grasped by us in images”. We reject the dominant solution that interprets the relation between facts and images as an isomorphic relation and propose that instead it is an internal relation: there are no facts that are not perceived through images. In other words: For us, linguistic animals, there is no world independent of language.

Two groups with isomorphic group algebras

1990

Pattern Matching and Pattern Discovery Algorithms for Protein Topologies

2001

We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…

Models and Phenomena: Bas van Fraassen’s Empiricist Structuralism

2013

Bas van Fraassen’s recent endorsement of empiricist structuralism is based on a particular approach to representation. He sharply distinguishes between what makes a scientific model M a successful representation of its target T from what makes M a representation of T and not of some other different target T’. van Fraassen maintains that embedment (i.e.: a particular sort of isomorphism which relates structures) gives the answer to the first question while the user’s decision to employ model M to represent T accounts for the representational link. After discussing the rationale for this approach, I defend that indexical constraints like those favoured by van Fraassen cannot be the last word …

Combinatorial isomorphism between Fibonacci classes

2008

Abstract In 1985 Simion and Schmidt showed that the set S n (T 3) of length n permutations avoiding the set of patterns T 3={123, 132, 213} is counted by (the second order) Fibonacci numbers. They also presented a constructive bijection between the set F n–1 of length (n–1) binary strings with no two consecutive 1s and S n (T 3). In 2005, Egge and Mansour generalized the first Simion-Simion’s result and showed that S n (T p ), the set of permutations avoiding the patterns T p ={12…p, 132, 213}, is counted by the (p–1)th order Fibonacci numbers. In this paper we extend the second Simion-Schmidt’s result by giving a bijection between the set of length (n–1) binary strings with no (p–1) consec…