標(biāo)題: Titlebook: Computers and Mathematics; Erich Kaltofen,Stephen M. Watt Conference proceedings 1989 Springer-Verlag New York Inc. 1989 Permutation.algeb [打印本頁(yè)] 作者: 債務(wù)人 時(shí)間: 2025-3-21 18:20
書目名稱Computers and Mathematics影響因子(影響力)
書目名稱Computers and Mathematics影響因子(影響力)學(xué)科排名
書目名稱Computers and Mathematics網(wǎng)絡(luò)公開度
書目名稱Computers and Mathematics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computers and Mathematics被引頻次
書目名稱Computers and Mathematics被引頻次學(xué)科排名
書目名稱Computers and Mathematics年度引用
書目名稱Computers and Mathematics年度引用學(xué)科排名
書目名稱Computers and Mathematics讀者反饋
書目名稱Computers and Mathematics讀者反饋學(xué)科排名
作者: WAX 時(shí)間: 2025-3-21 22:14 作者: Aviary 時(shí)間: 2025-3-22 01:39
Fast Group Membership Using a Strong Generating Test for Permutation Groupsn is an element of a permutation group . specified by a set of generators. Sims [8] developed an elegant solution to this problem. His method relies on the construction of an alternative generating set for . known as a . which can be easily used to test membership of an arbitrary permutation in .. T作者: 安撫 時(shí)間: 2025-3-22 05:25
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolationthe . of polynomial-time decision algorithms. The finite-basis theorems that are the engine of these developments are inherently ., providing no effective means for capturing the obstruction sets on which these polynomial-time algorithms are based. In this paper, we use a well-studied matrix permuta作者: 作嘔 時(shí)間: 2025-3-22 11:16 作者: febrile 時(shí)間: 2025-3-22 13:55
Classicality of Trigonal Curves of Genus Fiveis, the vanishing sequence of the canonical line bundle is the classical sequence 0,1,2,3,4. Nonclassical curves are only possible if the characteristic of the field of definition does not exceed . — 2 , where . is the genus of the curve, and non-classical curves up to genus 4 were classified by Kom作者: febrile 時(shí)間: 2025-3-22 18:21 作者: 梯田 時(shí)間: 2025-3-23 00:39 作者: 來自于 時(shí)間: 2025-3-23 02:11
Computer Algebraic Methods for Investigating Plane Differential Systems of Center and Focus Type implemented a program DEMS for computing the Liapunov function and Liapunov constants. This function and these constants are used in the study of stability criteria, differentiation between center and focus and the construction of limit cycles. The solutions of the problems concerning the investiga作者: Intuitive 時(shí)間: 2025-3-23 06:15 作者: 不真 時(shí)間: 2025-3-23 10:13 作者: PRO 時(shí)間: 2025-3-23 17:32 作者: Arb853 時(shí)間: 2025-3-23 21:55
Efficient Reduction of Quadratic Formseful in factorization of large integers. For many applications it is important to be able to recognize when two quadratic forms are equivalent, so it is useful to be able to reduce these quadratic forms to a canonical representation..For applications in factorization, the quadratic forms used have l作者: 興奮過度 時(shí)間: 2025-3-24 00:54
A Story About Computing with Roots of Unityw how we obtained new unexpected results trough computer algebra experiments. This was the direct result of computing in the ring of polynomials modulo the cyclotomic polynomial, instead of computing with roots of unity.作者: CANE 時(shí)間: 2025-3-24 04:45 作者: 無節(jié)奏 時(shí)間: 2025-3-24 07:07
http://image.papertrans.cn/c/image/234651.jpg作者: 嚴(yán)峻考驗(yàn) 時(shí)間: 2025-3-24 13:23
https://doi.org/10.1007/978-1-4020-6558-3lgebra can be solved. The approach follows Buchberger’s approach for computing a Grobner basis for a polynomial ideal and is based on rewriting concepts. A canonical basis produced by the completion procedure shares many properties of a Gr?bner basis such as reducing an element of a .-subalgebra to 作者: gonioscopy 時(shí)間: 2025-3-24 17:06 作者: TEM 時(shí)間: 2025-3-24 20:20
Health, Disease, and Productivityn is an element of a permutation group . specified by a set of generators. Sims [8] developed an elegant solution to this problem. His method relies on the construction of an alternative generating set for . known as a . which can be easily used to test membership of an arbitrary permutation in .. T作者: 薄膜 時(shí)間: 2025-3-24 23:39 作者: 公豬 時(shí)間: 2025-3-25 06:03
https://doi.org/10.1007/978-1-4020-4362-8jective, this can be made through the computation of the Hilbert polynomial; if it is affine, consider a completion of the affine variety; the completion may have larger dimension than the affine variety, but in this case it may have irreducible components contained in the hyperplane at infinity. Th作者: peptic-ulcer 時(shí)間: 2025-3-25 09:22 作者: inquisitive 時(shí)間: 2025-3-25 12:57
https://doi.org/10.1007/978-1-4020-4362-8ioned in the title. It is shown how these matrices can be built from a finite number of small matrices. It is reported how these small matrices, of which the largest is a 25 by 25 matrix, were found using computer algebra systems.作者: ECG769 時(shí)間: 2025-3-25 16:07
https://doi.org/10.1007/978-1-4020-4362-8per nucleus of an arbitrary configuration of nuclei and electrons. Such a lower bound provides a theoretical explanation of why the electrons do not simply collapse into the nuclei. The existence of a lower bound for the energy was originally proved by Dyson and Lenard in [1]. Lieb and Thirring [4,3作者: 慎重 時(shí)間: 2025-3-25 23:48
https://doi.org/10.1007/978-1-4020-4362-8 implemented a program DEMS for computing the Liapunov function and Liapunov constants. This function and these constants are used in the study of stability criteria, differentiation between center and focus and the construction of limit cycles. The solutions of the problems concerning the investiga作者: 敬禮 時(shí)間: 2025-3-26 00:29
https://doi.org/10.1007/978-1-4020-4362-8c solution of the equation is determined, a surprising bifurcation phenomenon is discovered via computer graphics. This “computer-discovered” bifurcation, in turn, leads to further mathematical analysis and deeper geometric understanding of the solution. Indeed, this is a simple example of an elemen作者: 夾克怕包裹 時(shí)間: 2025-3-26 04:59
https://doi.org/10.1007/978-1-4020-4362-8s not to carry out a direct symbolic algebraic manipulation of formulae characterizing this bifurcation (direction, stability and amplitudes of bifurcating periodic orbits, ...). It is planned to develop a recursive algorithm well suited to symbolic computation implementation, which is based upon th作者: 脖子 時(shí)間: 2025-3-26 11:34
https://doi.org/10.1007/978-1-4020-4362-8puter algebra system REDUCE and numerical methods for polynomial roots location. The stability analysis is performed by the Fourier method and polynomial root location is based on the Routh algorithm. Several practical examples show the usefulness of the programs described.作者: 文字 時(shí)間: 2025-3-26 16:06
John E. Cooper,Margaret E. Coopereful in factorization of large integers. For many applications it is important to be able to recognize when two quadratic forms are equivalent, so it is useful to be able to reduce these quadratic forms to a canonical representation..For applications in factorization, the quadratic forms used have l作者: antipsychotic 時(shí)間: 2025-3-26 20:14
https://doi.org/10.1007/978-94-011-9574-4w how we obtained new unexpected results trough computer algebra experiments. This was the direct result of computing in the ring of polynomials modulo the cyclotomic polynomial, instead of computing with roots of unity.作者: Lime石灰 時(shí)間: 2025-3-26 22:52
Current Topics in Veterinary Medicineence (prs). This method is based on our generalization of a theorem by Van Vleck (1899)[12] and uniformly treats both normal and abnormal prs’s, making use of Bareiss’s (1968)[4] integer-preserving transformation algorithm for Gaussian elimination; moreover, for the polynomials of the prs’s, this me作者: 大罵 時(shí)間: 2025-3-27 04:10
https://doi.org/10.1007/978-1-4613-9647-5Permutation; algebra; calculus; geometry; logic; mathematics; number theory作者: slipped-disk 時(shí)間: 2025-3-27 08:22
978-0-387-97019-6Springer-Verlag New York Inc. 1989作者: VEST 時(shí)間: 2025-3-27 12:32 作者: Hyaluronic-Acid 時(shí)間: 2025-3-27 15:49 作者: CAGE 時(shí)間: 2025-3-27 20:07 作者: Exclaim 時(shí)間: 2025-3-27 22:30
https://doi.org/10.1007/978-1-4020-4362-8puter algebra system REDUCE and numerical methods for polynomial roots location. The stability analysis is performed by the Fourier method and polynomial root location is based on the Routh algorithm. Several practical examples show the usefulness of the programs described.作者: 同義聯(lián)想法 時(shí)間: 2025-3-28 02:36 作者: 群居男女 時(shí)間: 2025-3-28 09:54 作者: 鋼盔 時(shí)間: 2025-3-28 11:19 作者: 小口啜飲 時(shí)間: 2025-3-28 15:21
https://doi.org/10.1007/978-1-4020-4362-8Our purpose is to interest people to calculate (co)homology with help of a computer, in particular, (co)homology of Lie algebras and Lie superalgebras.作者: Folklore 時(shí)間: 2025-3-28 19:23 作者: hermitage 時(shí)間: 2025-3-29 02:24 作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-29 03:29
A Computer Generated Census of Cusped Hyperbolic 3-ManifoldsIn this paper, we describe how we used a computer to produce a census of cusped hyperbolic 3-manifolds obtained from 5 or fewer ideal tetrahedra. We note some of the techniques involved in writing and debugging the programs and give a brief summary of the results.作者: 北極人 時(shí)間: 2025-3-29 10:50 作者: 陶器 時(shí)間: 2025-3-29 14:20 作者: Offstage 時(shí)間: 2025-3-29 15:37
Summation of Harmonic Numbersnd ∑.=1 H./(i+m), where m is an integer, are given. A method to automate these results is presented. This is achieved by using Moenck’s algorithm and by exploiting the relationship between polygamma functions and harmonic numbers.作者: OGLE 時(shí)間: 2025-3-29 21:26 作者: AIL 時(shí)間: 2025-3-30 03:30
Symmetric Matrices with Alternating Blocksioned in the title. It is shown how these matrices can be built from a finite number of small matrices. It is reported how these small matrices, of which the largest is a 25 by 25 matrix, were found using computer algebra systems.作者: boisterous 時(shí)間: 2025-3-30 04:22
Application of the REDUCE Computer Algebra System to Stability Analysis of Difference Schemesputer algebra system REDUCE and numerical methods for polynomial roots location. The stability analysis is performed by the Fourier method and polynomial root location is based on the Routh algorithm. Several practical examples show the usefulness of the programs described.作者: confide 時(shí)間: 2025-3-30 09:14 作者: 蒙太奇 時(shí)間: 2025-3-30 15:26
Health, Disease, and Productivitynerating set. Each call to this last test has worst case time .(..). A further reduction in time is achieved by using a fast algorithm for finding reduced generating sets. For groups with small bases, the running running time is .(..), which is optimal for the data structure used.作者: 男生戴手銬 時(shí)間: 2025-3-30 18:07
https://doi.org/10.1007/978-1-4020-4362-8ins no nuclei to assign its energy to the nearest nucleus. The lowest energy assigned to any nucleus is obviously a lower bound for the average energy per nucleus. Arguments given in [2] provide bounds for the energy contributed to a nucleus by all balls except those that are contained within a sphe作者: 口訣法 時(shí)間: 2025-3-30 21:08
https://doi.org/10.1007/978-1-4020-4362-8her conditions. In particular, we discovered that Kukles’ conditions for the existence of a center for a type of cubic differential systems are possibly incomplete, and presented a class of cubic differential systems with the origin as a 6-tuple focus from which one can create 6 limit cycles by a sm作者: 離開就切除 時(shí)間: 2025-3-31 02:40 作者: Wordlist 時(shí)間: 2025-3-31 07:29 作者: FLASK 時(shí)間: 2025-3-31 12:19
Computer Algebraic Methods for Investigating Plane Differential Systems of Center and Focus Typeher conditions. In particular, we discovered that Kukles’ conditions for the existence of a center for a type of cubic differential systems are possibly incomplete, and presented a class of cubic differential systems with the origin as a 6-tuple focus from which one can create 6 limit cycles by a sm作者: narcotic 時(shí)間: 2025-3-31 16:31
https://doi.org/10.1007/978-1-4020-4362-8ch based on a computational “l(fā)earning” paradigm that incorporates a fundamental component of computer-aided obstruction identification with self-reduction to obtain known polynomial-time algorithms that do not depend on the knowledge of an entire obstruction set.作者: 撫慰 時(shí)間: 2025-3-31 20:03
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolationch based on a computational “l(fā)earning” paradigm that incorporates a fundamental component of computer-aided obstruction identification with self-reduction to obtain known polynomial-time algorithms that do not depend on the knowledge of an entire obstruction set.作者: 愛社交 時(shí)間: 2025-3-31 22:50
Exact Algorithms for the Matrix-Triangularization Subresultant PRS Methodthod provides the smallest coefficients that can be expected without coefficient gcd computations. In this paper we present efficient, exact algorithms for the implementation of this new method, along with an example where bubble pivot is needed.作者: 脫水 時(shí)間: 2025-4-1 04:48
Conference proceedings 1989tions on topics ranging from computational algebra, and parallel computing, to mathematics education. Mathematicians interested in the computational aspects of their discipline as well as computer scientists interested in mathematical applications will enjoy the integrative view provided by this book.作者: 埋伏 時(shí)間: 2025-4-1 06:23 作者: GULLY 時(shí)間: 2025-4-1 11:18
https://doi.org/10.1007/978-1-4020-6558-3 variables, this approach is direct. One of the limitations of the approach however is that the procedure may not terminate for some orderings thus giving an infinite canonical basis. The procedure is illustrated using examples.
