Results 21 to 30 of about 7,966,807 (295)
In this paper we introduce the Horadam hybrid numbers and give some their properties: Binet formula, character and generating function.
Szynal-Liana Anetta
doaj +1 more source
On the complexity of the circular chromatic number [PDF]
AbstractCircular chromatic number, χcis a natural generalization of chromatic number. It is known that it isNP‐hard to determine whether or not an arbitrary graphGsatisfies χ(G)=χc(G). In this paper we prove that this problem isNP‐hard even if the chromatic number of the graph is known. This answers a question of Xuding Zhu.
Hamed Hatami, Ruzbeh Tusserkani
openaire +5 more sources
This study explored the utilisation of GeoGebra as a modelling tool to develop undergraduate engineering mathematics students’ conceptual and procedural knowledge of complex numbers.
Philemon M. Seloane +2 more
doaj +1 more source
The theta number of simplicial complexes [PDF]
We introduce a generalization of the celebrated Lovász theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial Laplacians, and provides a semidefinite programming upper bound of the independence number of a simplicial complex.
Christine Bachoc +2 more
openaire +2 more sources
This article will begin with the claim that Hamilton spent a great deal of time trying to figure out the three-dimensional complex numbers. He was never able to accomplish that.
MSc. Ruslan Pozinkevycha
doaj +1 more source
Our aim is to contribute to the classification of anomalous patterns in biosignals using this novel approach. We specifically focus on melanoma and heart murmurs.
Mario Jojoa +2 more
doaj +1 more source
Convert between neutrosophic complex numbers forms [PDF]
Complex numbers have been studied in previous papers, but the papers did not deal with the conversion from algebraic form of a neutrosophic complex number form to exponential or trigonometric form and vice versa, and this prompted us to search for a ...
Yaser Ahmad Alhasan +2 more
doaj +1 more source
This is the English version of the paper: "Complejidad de los números naturales", Gaceta de la Real Sociedad Matemática Española 3 (2000) 230--250. In this paper, several conjectures about the complexity of natural numbers are proposed. In a recent joint paper with H.
openaire +3 more sources
Leray Numbers of Tolerance Complexes
AbstractLet K be a simplicial complex on vertex set V. K is called d-Leray if the homology groups of any induced subcomplex of K are trivial in dimensions d and higher. K is called d-collapsible if it can be reduced to the void complex by sequentially removing a simplex of size at most d that is contained in a unique maximal face.
Minki Kim, Alan Lew
openaire +3 more sources
In this study, we introduce the complex Leonardo numbers and give some of their properties including Binet formula, generating function, Cassini and d'Ocagne's identities.
Karatas, Adnan
core +1 more source

