Results 1 to 10 of about 245,049 (165)
Expander Graphs in Pure and Applied Mathematics [PDF]
arXiv, 2011 Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry and more. This expository
Alexander Lubotzky
arxiv +7 more sources
Courses in Higher Pure Mathematics [PDF]
Science, 1911 n ...
George A. Miller
openalex +5 more sources
About Pure and Applied Mathematics
Bibechana, 2018 No abstract available.
Nagendra Prasad Shah
doaj +6 more sources
German Idealism and the Origins of Pure Mathematics: Riemann, Dedekind, Cantor [PDF]
Journal of Philosophical Investigations, 2021 When it comes to the relation of modern mathematics and philosophy, most people tend to think of the three major schools of thought—i.e. logicism, formalism, and intuitionism—that emerged as profound researches on the foundations and nature of ...
Ehsan Karimi Torshizi
doaj +1 more source
A Course in Pure and Applied Mathematics [PDF]
, 1963 H. J. Halstead, Douglas Harris
openalex +3 more sources
Mathematical Modeling of Wax Deposition in Field-Scale Crude Oil Pipeline Systems
Journal of Applied Mathematics, 2022 The formation of solid wax crystals, which interlock and form a gel-like layer on the inner wall of the crude oil pipeline, influences the transportation of waxy crude oil. The deposited layer grows continuously and hardens during the oil transportation,
Francis Oketch Ochieng +3 more
doaj +1 more source
Hydromagnetic Non-Newtonian Fluid Flow in a Convergent Conduit
Journal of Applied Mathematics, 2022 In the present study, a hydromagnetic non-Newtonian (dilatant) fluid flow in a convergent conduit, in the presence of a variable transverse magnetic field, has been investigated.
Njue Caroline Wawira +2 more
doaj +1 more source
Computing some Laplacian Coefficients of Forests
Journal of Applied Mathematics, 2022 Let G be a finite simple graph with Laplacian polynomial ψG,λ=∑k=0n−1n−kckλk. In an earlier paper, the coefficients cn−4 and cn−5 for forests with respect to some degree-based graph invariants were computed. The aim of this paper is to continue this work
Ali Ghalavand, Ali Reza Ashrafi
doaj +1 more source
Metric Dimension Threshold of Graphs
Journal of Mathematics, 2022 Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w.
Meysam Korivand +2 more
doaj +1 more source