Results 271 to 280 of about 1,828,404 (296)
Some of the next articles are maybe not open access.

Heart of Irreducible Morphisms of Bounded Complexes

Communications in Algebra, 2015
In [9] Giraldo and Merklen studied irreducible morphisms in the categories 𝒞(𝒜) and D−(Λ), where 𝒞(𝒜) is the category of complexes over an abelian Krull–Schmidt category 𝒜 and D−(Λ) is the derived category of the bounded above complexes of finite generate left modules, over an Artin algebra Λ.
Hernán Giraldo, Eduardo Marcos
openaire   +1 more source

CLASSIFICATION OF EXTREMALLY IRREDUCIBLE AND NORMALLY IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE COMPLEX CONNECTED LIE GROUPS

Mathematics of the USSR-Izvestiya, 1971
A new concept of "extremal irreducibility" for representations of Lie groups in separable locally convex spaces is introduced. All extremally irreducible representations of semisimple complex Lie groups are classified to within equivalence, i.e. to within topological isomorphism rearranging representation operators.
openaire   +2 more sources

Creationist Purpose and Irreducible Complexity Rebutted

2007
Abstract This chapter rebuts irreducible complexity and creationism by explaining the reliability of dating techniques as well as sophisticated laboratory techniques that allow researchers to synthesize extinct genes (genetic archaeology, gene resurrection) and study their homology to other genes.
Paul F. Lurquin, Linda Stone
openaire   +1 more source

The Omega Number: Irreducible Complexity in Pure Math

2006
We discuss the halting probability Ω, whose bits are irreducible mathematical facts, that is, facts which cannot be derived from any principles simpler than they are. In other words, you need a mathematical theory with N bits of axioms in order to be able to determine N bits of Ω.
openaire   +2 more sources

MINIMALLY IRREDUCIBLE FAMILIES OF COMPLEX MATRICES

Bulletin of the Australian Mathematical Society
Abstract A family of n times n $n\times n$ n ×
openaire   +1 more source

A Review of Algorithms to Computing Irreducible Testors Applied to Feature Selection

Artificial Intelligence Review, 2022
Manuel S Lazo-Cortes   +2 more
exaly  

New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2ⁿ)

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012
Seokhie Hong   +2 more
exaly  

Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2006
Roman Hermida, Francisco Tirado
exaly  

The classification of the irreducible complex algebras of infinite type

Journal d'Analyse Mathématique, 1967
Guillemin, Victor W.   +2 more
openaire   +2 more sources

Irreducible Complexity and the Problem of Biochemical Emergence

Biology and Philosophy, 1999
Bruce H Weber
exaly  

Home - About - Disclaimer - Privacy