The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 2681 – 2700 of 3023

Showing per page

There is no analog of the transpose map for infinite matrices.

Juan Jacobo Simón (1997)

Publicacions Matemàtiques

In this note we show that there are no ring anti-isomorphism between row finite matrix rings. As a consequence we show that row finite and column finite matrix rings cannot be either isomorphic or Morita equivalent rings. We also show that antiisomorphisms between endomorphism rings of infinitely generated projective modules may exist.

Tilings associated with non-Pisot matrices

Maki Furukado, Shunji Ito, E. Arthur Robinson (2006)

Annales de l’institut Fourier

Suppose A G l d ( ) has a 2-dimensional expanding subspace E u , satisfies a regularity condition, called “good star”, and has A * 0 , where A * is an oriented compound of A . A morphism θ of the free group on { 1 , 2 , , d } is called a non-abelianization of A if it has structure matrix A . We show that there is a tiling substitution Θ whose “boundary substitution” θ = Θ is a non-abelianization of A . Such a tiling substitution Θ leads to a self-affine tiling of E u 2 with A u : = A | E u G L 2 ( ) as its expansion. In the last section we find conditions on A so...

Transformación de principios de consistencia aleatorios en determinísticos.

Miguel Sanchez García, Antonio Pérez, M.ª Josefa Domench (1988)

Trabajos de Investigación Operativa

En la Teoría de la Decisión en Grupo, cuando los expertos emiten su información sobre los objetos de una manera probabilística, se pueden construir Principios de Consistencia que satisfagan los cinco principios de racionalidad y no sean dictatoriales [ver Sánchez-Pérez-Domench (1986)].Partiendo de esta situación, en el presente artículo se analizan y proponen diferentes métodos y algoritmos para transformar relaciones sociales aleatorias en determinísticas, continuando y completando así investigaciones...

Currently displaying 2681 – 2700 of 3023