Results 31 to 40 of about 1,828,404 (296)

A note on irreducible Heegaard diagrams

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2006
We construct a Heegaard diagram of genus three for the real projective 3-space, which has no waves and pairs of complementary handles. The first example was given by Im and Kim but our diagram has smaller complexity.
Alberto Cavicchioli, Fulvia Spaggiari
doaj   +1 more source

Low‐Power and Low‐Hardware Bit‐Parallel Polynomial Basis Systolic Multiplier over GF(2m) for Irreducible Polynomials

open access: yesETRI Journal, 2017
Multiplication in finite fields is used in many applications, especially in cryptography. It is a basic and the most computationally intensive operation from among all such operations.
Sudha Ellison Mathe, Lakshmi Boppana
doaj   +1 more source

Fast Asymptotic Square Root for Two Types of Special Pentanomials

open access: yesIEEE Access, 2019
Inspired by the Montgomery and generalized polynomial basis (GPB) squaring operation, we introduce and study the notion of asymptotic square root over binary extension fields GF(2m).
Yu Zhang, Yin Li, Qing Chen
doaj   +1 more source

Disimplicial arcs, transitive vertices, and disimplicial eliminations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence.
Martiniano Eguia, Francisco Soulignac
doaj   +1 more source

Computing Matveev's complexity via crystallization theory: The boundary case [PDF]

open access: yes, 2013
The notion of Gem-Matveev complexity (GM-complexity) has been introduced within crystallization theory, as a combinatorial method to estimate Matveev's complexity of closed 3-manifolds; it yielded upper bounds for interesting classes of such manifolds ...
MARIA RITA CASALI   +3 more
core   +1 more source

A complexity of compact 3-manifolds via immersed surfaces

open access: yes, 2021
We generalise the surface-complexity of closed 3-manifolds to the compact case. This generalisation preserves the (natural generalisation of the) properties holding in the closed case: the surface-complexity on compact 3-manifolds is a natural number ...
Amendola G., Gennaro Amendola
core   +1 more source

Intelligent Design—Fundamentalismus oder unbequeme Herausforderung? [Intelligent Design—Fundamentalism or Uncomfortable Challenge?] [PDF]

open access: yesStudia Gilsoniana, 2017
Order and change in nature have been for a long time understood in philosophy and theology as founded in divine reason. In the neo-Darwinist theory of evolution, their explanation is reduced to material change without reason. Molecular biologists like M.
Berthold Wald
doaj  

The Criticism of Atheistic Evolution [PDF]

open access: yesComparative Theology, 2010
With regard to close relation between evolution theory and religious knowledge, and its prodigious influence on arising new schools in philosophy this paper firstly considers the outcome of Darwin’s theologian theory in brief secondly it talks about ...
Farah Ramin
doaj   +4 more sources

Simulation model for determining the rational dimensions of the irreducible reserve of locomotives at the stations of its turnover

open access: yesВестник Научно-исследовательского института железнодорожного транспорта, 2018
With the introduction of polygon site technologies, the extension of locomotive circulation areas has increased the complexity of solving the problems of regulating the fleet of locomotives.
E. A. Sotnikov   +3 more
doaj   +1 more source

Determining Minimal Polynomial of Proper Element by Using Higher Degree Traces [PDF]

open access: yes, 2001
Modern communication engineerings, such as elliptic curve cryptographies, often requires algebra on finite extension field defined by modulus arithmetic with an irreducible polynomial. This paper provides a new method to detemine the minimal (irreducible)
Morikawa, Yoshitaka, Nogami, Yasuyuki
core   +1 more source

Home - About - Disclaimer - Privacy