We give a local analytic characterization that a minimal surface in the 3-sphere S3 C R4 defined by an irreducible cubic polynomial is one of the Lawson＇s minimal tori. This provides an alternative proof of the resul...We give a local analytic characterization that a minimal surface in the 3-sphere S3 C R4 defined by an irreducible cubic polynomial is one of the Lawson＇s minimal tori. This provides an alternative proof of the result by Perdomo （Characterization of order 3 algebraic immersed minimal surfaces of S3, Geom. Dedicata 129 （2007）, 23 34）.展开更多
Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these lo...Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these logic rule with Pan-Boolean algebra was described, therefore a PID Pan-Boolean algebra control algorithm was obtained. The simulation results indicates that the new control algorithm is more effective compared to the traditional PID algorithm, having advantages such as more than 3 adjustable parameters of controllers, better result, and so on.展开更多
To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation o...To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.展开更多
A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-L...A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.展开更多
The breakdown of the Heisenberg Uncertainty Principle occurs when energies approach the Planck scale, and the corresponding Schwarzschild radius becomes similar to the Compton wavelength. Both of these quantities are ...The breakdown of the Heisenberg Uncertainty Principle occurs when energies approach the Planck scale, and the corresponding Schwarzschild radius becomes similar to the Compton wavelength. Both of these quantities are approximately equal to the Planck length. In this context, we have introduced a model that utilizes a combination of Schwarzschild’s radius and Compton length to quantify the gravitational length of an object. This model has provided a novel perspective in generalizing the uncertainty principle. Furthermore, it has elucidated the significance of the deforming linear parameter β and its range of variation from unity to its maximum value.展开更多
We prove that the adjoint semigroup of an implicative BCK algebra is an upper semilattice, and the adjoint semigroup of an implicative BCK algebra with condition(s) is a generalized Boolean algebra. Moreover we prov...We prove that the adjoint semigroup of an implicative BCK algebra is an upper semilattice, and the adjoint semigroup of an implicative BCK algebra with condition(s) is a generalized Boolean algebra. Moreover we prove the adjoint semigroup of a bounded implicative BCK algebra is a Boolean algebra.展开更多
In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations an...In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].展开更多
The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approach...The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approaches are not necessarily mutually exclusive. The design of the present paper is to add one more approach by analyzing the mathematical structure of the Monty Hall problem in digital terms. The structure of the problem is described as much as possible in the tradition and the spirit—and as much as possible by means of the algebraic conventions—of George Boole’s Investigation of the Laws of Thought (1854), the Magna Charta of the digital age, and of John Venn’s Symbolic Logic (second edition, 1894), which is squarely based on Boole’s Investigation and elucidates it in many ways. The focus is not only on the digital-mathematical structure itself but also on its relation to the presumed digital nature of cognition as expressed in rational thought and language. The digital approach is outlined in part 1. In part 2, the Monty Hall problem is analyzed digitally. To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended and generalized in parts 3 and 4 to related cases in light of the axioms of probability theory. In the full mapping of the mathematical structure of the Monty Hall problem and any extensions thereof, a digital or non-quantitative skeleton is fleshed out by a quantitative component. The pertinent mathematical equations are developed and presented and illustrated by means of examples.展开更多
The axioms of A ∞ algebras can be written as Maurer Cartan equation.Infi nitesimal multiplication of a graded associative algebra is defined and the integrability of infinitesimal multiplication is discussed throu...The axioms of A ∞ algebras can be written as Maurer Cartan equation.Infi nitesimal multiplication of a graded associative algebra is defined and the integrability of infinitesimal multiplication is discussed through the Massey F product.展开更多
Let （L, 〈, V, A） be a complete Heyting algebra. In this article, the linear system Ax = b over a complete Heyting algebra, where classical addition and multiplication operations are replaced by V and A respectively...Let （L, 〈, V, A） be a complete Heyting algebra. In this article, the linear system Ax = b over a complete Heyting algebra, where classical addition and multiplication operations are replaced by V and A respectively, is studied. We obtain： （i） the necessary and sufficient conditions for S（A,b）≠Ф; （ii） the necessary conditions for IS（A,b）｜ = 1. We also obtain the vector x ∈ Ln and prove that it is the largest element of S（A, b） if S（A, b）≠Ф.展开更多
Boolean homomorphisms of a hypercube, which correspond to the morphisms in the category of finite Boolean algebras, coincide with the linear isometries of the category of finite binary metric vector spaces.
In mathematics, physics, and engineering, abstract concepts are an indispensable foundation for the study and comprehension of concrete models. As concepts within these fields become increasingly detached from physica...In mathematics, physics, and engineering, abstract concepts are an indispensable foundation for the study and comprehension of concrete models. As concepts within these fields become increasingly detached from physical entities and more associated with mental events, thinking shifts from analytical to conceptual-abstract. Fundamental topics taken from the abstract algebra (aka: modern algebra) are unquestionably abstract. Historically, fundamental concepts taught from the abstract algebra are detached from physical reality with one exception: Boolean operations. Even so, many abstract algebra texts present Boolean operations from a purely mathematical operator perspective that is detached from physical entities. Some texts on the abstract algebra introduce logic gate circuits, but treat them as perceptual symbols. For majors of pure or applied mathematics, detachments from physical entities is not relevant. For students of Computer and Electrical Engineering (CpE/EE), mental associations of Boolean operations are essential, and one might argue that studying pure Boolean axioms are unnecessary mental abstractions. But by its nature, the CpE/EE field tends to be more mentally abstract than the other engineering disciplines. The depth of the mathematical abstractions that we teach to upper-division CpE/EE majors is certainly up for questioning.展开更多
文摘We give a local analytic characterization that a minimal surface in the 3-sphere S3 C R4 defined by an irreducible cubic polynomial is one of the Lawson＇s minimal tori. This provides an alternative proof of the result by Perdomo （Characterization of order 3 algebraic immersed minimal surfaces of S3, Geom. Dedicata 129 （2007）, 23 34）.
基金Project (J51801) supported by Shanghai Education Commission Key DisciplineProject(08ZY79)supported by Shanghai Education Commission Research FundProject(DZ207004)supported by Shanghai Second Polytechnic University Fund
文摘Single input single output system was studied. With proportion, differential, integral results of deviation between given input and output as controller input, the logic rules in control process was analyzed, these logic rule with Pan-Boolean algebra was described, therefore a PID Pan-Boolean algebra control algorithm was obtained. The simulation results indicates that the new control algorithm is more effective compared to the traditional PID algorithm, having advantages such as more than 3 adjustable parameters of controllers, better result, and so on.
基金This work was supported by the National Natural Science Foundation of China under Grants No. 61103191, No. 61070215 the Funds of Key Lab of Fujian Province University Network Security and Cryptology under Crant No. 2011003 and the Open Research Fund of State Key Laboratory of Inforrmtion Security.
文摘To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to constmct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is deter- mined for the number of Boolean functions with rmximum algebraic immunity.
基金Supported by the National Natural Science Foundation of China(11501523,61673320)。
文摘A 2-dimension linguistic lattice implication algebra(2DL-LIA)can build a bridge between logical algebra and 2-dimension fuzzy linguistic information.In this paper,the notion of a Boolean element is proposed in a 2DL-LIA and some properties of Boolean elements are discussed.Then derivations on 2DL-LIAs are introduced and the related properties of derivations are investigated.Moreover,it proves that the derivations on 2DL-LIAs can be constructed by Boolean elements.
文摘The breakdown of the Heisenberg Uncertainty Principle occurs when energies approach the Planck scale, and the corresponding Schwarzschild radius becomes similar to the Compton wavelength. Both of these quantities are approximately equal to the Planck length. In this context, we have introduced a model that utilizes a combination of Schwarzschild’s radius and Compton length to quantify the gravitational length of an object. This model has provided a novel perspective in generalizing the uncertainty principle. Furthermore, it has elucidated the significance of the deforming linear parameter β and its range of variation from unity to its maximum value.
文摘We prove that the adjoint semigroup of an implicative BCK algebra is an upper semilattice, and the adjoint semigroup of an implicative BCK algebra with condition(s) is a generalized Boolean algebra. Moreover we prove the adjoint semigroup of a bounded implicative BCK algebra is a Boolean algebra.
基金Supported by a grant of National Natural Science Foundation of China(12001243,61976244,12171294,11961016)the Natural Science Basic Research Plan in Shaanxi Province of China(2020JQ-762,2021JQ-580)。
文摘In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic to the algebra of all Boolean additive(implicative)derivations. These results also give the negative answers to two open problems, which were proposed in [Fuzzy Sets and Systems, 303(2016), 97-113] and [Information Sciences, 178(2008),307-316].
文摘The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approaches are not necessarily mutually exclusive. The design of the present paper is to add one more approach by analyzing the mathematical structure of the Monty Hall problem in digital terms. The structure of the problem is described as much as possible in the tradition and the spirit—and as much as possible by means of the algebraic conventions—of George Boole’s Investigation of the Laws of Thought (1854), the Magna Charta of the digital age, and of John Venn’s Symbolic Logic (second edition, 1894), which is squarely based on Boole’s Investigation and elucidates it in many ways. The focus is not only on the digital-mathematical structure itself but also on its relation to the presumed digital nature of cognition as expressed in rational thought and language. The digital approach is outlined in part 1. In part 2, the Monty Hall problem is analyzed digitally. To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended and generalized in parts 3 and 4 to related cases in light of the axioms of probability theory. In the full mapping of the mathematical structure of the Monty Hall problem and any extensions thereof, a digital or non-quantitative skeleton is fleshed out by a quantitative component. The pertinent mathematical equations are developed and presented and illustrated by means of examples.
文摘The axioms of A ∞ algebras can be written as Maurer Cartan equation.Infi nitesimal multiplication of a graded associative algebra is defined and the integrability of infinitesimal multiplication is discussed through the Massey F product.
基金supported by the NNSF (10471035,10771056) of China
文摘Let （L, 〈, V, A） be a complete Heyting algebra. In this article, the linear system Ax = b over a complete Heyting algebra, where classical addition and multiplication operations are replaced by V and A respectively, is studied. We obtain： （i） the necessary and sufficient conditions for S（A,b）≠Ф; （ii） the necessary conditions for IS（A,b）｜ = 1. We also obtain the vector x ∈ Ln and prove that it is the largest element of S（A, b） if S（A, b）≠Ф.
文摘Boolean homomorphisms of a hypercube, which correspond to the morphisms in the category of finite Boolean algebras, coincide with the linear isometries of the category of finite binary metric vector spaces.
文摘In mathematics, physics, and engineering, abstract concepts are an indispensable foundation for the study and comprehension of concrete models. As concepts within these fields become increasingly detached from physical entities and more associated with mental events, thinking shifts from analytical to conceptual-abstract. Fundamental topics taken from the abstract algebra (aka: modern algebra) are unquestionably abstract. Historically, fundamental concepts taught from the abstract algebra are detached from physical reality with one exception: Boolean operations. Even so, many abstract algebra texts present Boolean operations from a purely mathematical operator perspective that is detached from physical entities. Some texts on the abstract algebra introduce logic gate circuits, but treat them as perceptual symbols. For majors of pure or applied mathematics, detachments from physical entities is not relevant. For students of Computer and Electrical Engineering (CpE/EE), mental associations of Boolean operations are essential, and one might argue that studying pure Boolean axioms are unnecessary mental abstractions. But by its nature, the CpE/EE field tends to be more mentally abstract than the other engineering disciplines. The depth of the mathematical abstractions that we teach to upper-division CpE/EE majors is certainly up for questioning.
