Advances in Mathematics and Computer Science Vol. 1
Synopsis
This book covers brief areas of mathematics and computer science. Authors’ contribution includes in aspect of complex systems, matrix vector transition net, modeling, Petri nets, colored Petri nets, symbolic modeling, Bitwise operations, integer representation of sets, exponential latin square, Exponential Sudoku matrix, G¨odel encoding, Russell’s paradox, standard model, Henkin semantics, inaccessible cardinal, Fatou set, simple and multiple connected components, Dual reciprocity boundary elemental method, shape optimization, design sensitivity analysis, golden-section search algorithm, neutrosophic goal geometric programming algorithm, proof complexity, Binomial and multinomial modeling, periodic function, fixed point theorem, Banach contractive mapping theorem, periodic g-contractive mapping theorem, Shape optimization, design sensitivity, implicit differentiation, anisotropic structures etc. This book contains various materials suitable for students, researchers and academicians in the field of mathematical as well as computer science.
Chapters
-
Chapter 1A Matrix Vector Transition Net Implementation
-
Chapter 2Exponential Latin square, exponential Sudoku matrix and bitwise operations
-
Chapter 3There is No Standard Model of ZFC and ZFC2
-
Chapter 4Examples of Simply and Multiply Connected Fatou Sets for a Class of Meromorphic Functions
-
Chapter 5DRBEM Sensitivity Analysis and Shape Optimization of Rotating Magneto-Thermo-Viscoelastic FGA Structures Using DRBEM-GSS and DRBEM-NGGP Algorithms
-
Chapter 6On the Proof Complexities of Strongly Equal Non-classical Tautologies
-
Chapter 7Recursive Computation of Binomial and Multinomial Coefficients and Probabilities
-
Chapter 8A New Definition of Limit of Periodic Function and Periodic g-Contractive Mapping at Infinity
-
Chapter 9The Effect of Anisotropy on the Structure Optimization Using BEM-GSS and BEM-NGGP Algorithms

This work is licensed under a Creative Commons Attribution 4.0 International License.