Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Dynamical Systems
A Group-Permutation Algorithm To Solve The Generalized Sudoku, Florentin Smarandache
A Group-Permutation Algorithm To Solve The Generalized Sudoku, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Sudoku can be generalized to squares whose dimensions are n^2 × n^2 , where n ≥ 2, using various symbols (numbers, letters, mathematical symbols, etc.), written just one time on each row and on each column; and the large square is divided into n 2 small squares with the side n × n and each will contain all n 2 symbols written only once. In this paper we present an elementary solution for the generalized sudoku based on a group-permutation algorithm.
Neutrosophic Interval Bialgebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy
Neutrosophic Interval Bialgebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors for the first time introduce the notion of neutrosophic intervals and study the algebraic structures using them. Concepts like groups and fields using neutrosophic intervals are not possible. Pure neutrosophic intervals and mixed neutrosophic intervals are introduced and by the very structure of the interval one can understand the category to which it belongs. We in this book introduce the notion of pure (mixed) neutrosophic interval bisemigroups or neutrosophic biinterval semigroups. We derive results pertaining to them. The new notion of quasi bisubsemigroups and ideals are introduced. Smarandache interval neutrosophic bisemigroups are also introduced and …