標題: Titlebook: Computational Algebra and Number Theory; Wieb Bosma,Alf Poorten Book 1995 Springer Science+Business Media Dordrecht 1995 Category theory.G [打印本頁] 作者: CHAFF 時間: 2025-3-21 19:57
書目名稱Computational Algebra and Number Theory影響因子(影響力)
書目名稱Computational Algebra and Number Theory影響因子(影響力)學(xué)科排名
書目名稱Computational Algebra and Number Theory網(wǎng)絡(luò)公開度
書目名稱Computational Algebra and Number Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Algebra and Number Theory被引頻次
書目名稱Computational Algebra and Number Theory被引頻次學(xué)科排名
書目名稱Computational Algebra and Number Theory年度引用
書目名稱Computational Algebra and Number Theory年度引用學(xué)科排名
書目名稱Computational Algebra and Number Theory讀者反饋
書目名稱Computational Algebra and Number Theory讀者反饋學(xué)科排名
作者: 易改變 時間: 2025-3-21 22:39 作者: 都相信我的話 時間: 2025-3-22 02:38 作者: 突襲 時間: 2025-3-22 08:34
Judith J. Stalnaker,Ernest C. HarrisA finite soluble quotient algorithm which computes power conjugate presentations for finite soluble quotients of finitely presented groups is described. A version of this algorithm has been implemented in C and is available as the ANU Soluble Quotient Program.作者: 北極人 時間: 2025-3-22 12:35
Plywood and Similar Wood Products,We describe an algorithm to compute the automorphism group of a finite .-group. A description of the automorphism group is built up by working down successive terms of the lower exponent-. central series of the group. The algorithm is a significant improvement over existing techniques. An implementation of the algorithm is publicly available.作者: insurgent 時間: 2025-3-22 14:37
Built-Up and Composite Members,This paper describes general approaches and some specific techniques that enable researchers to perform computations in groups too large for general-purpose software and algorithms.作者: insurgent 時間: 2025-3-22 20:01 作者: LATER 時間: 2025-3-22 21:12
Metsec Purlin Piercings, Sleeves And CleatsThe work of the second author was supported in part by grants from the Australian Research Council and by a research agreement with Digital Equipment Corporation.作者: 卡死偷電 時間: 2025-3-23 03:26 作者: considerable 時間: 2025-3-23 08:18
Calculating Growth Functions for Groups Using Automata,Much of the research for this paper was conducted while I was working on my PhD thesis. I am grateful to my supervisor, Dr. Gary Davis, for first kindling my interest in this area and offering me invaluable encouragement and advice.作者: medieval 時間: 2025-3-23 12:32 作者: Figate 時間: 2025-3-23 14:53
Computing Finite Soluble Quotients,A finite soluble quotient algorithm which computes power conjugate presentations for finite soluble quotients of finitely presented groups is described. A version of this algorithm has been implemented in C and is available as the ANU Soluble Quotient Program.作者: Definitive 時間: 2025-3-23 20:44 作者: 無畏 時間: 2025-3-24 01:21 作者: 宇宙你 時間: 2025-3-24 03:41
An Implementation of the Elliptic Curve Integer Factorization Method,This paper describes the second author’s implementation of the elliptic curve method for the factorization of integers as it is currently available in the computational algebra package Magma, which is under development at the University of Sydney.作者: Cacophonous 時間: 2025-3-24 09:07 作者: FLUSH 時間: 2025-3-24 13:58 作者: ensemble 時間: 2025-3-24 17:25
Generalisations of the Todd-Coxeter Algorithm,. Recently the author has developed two related algorithms, the double coset enumeration algorithm and the vector enumeration algorithm. This paper establishes a common framework for the three algorithms, based on a related algorithm for constructing transformation representations of monoids.作者: 半圓鑿 時間: 2025-3-24 21:41 作者: ineluctable 時間: 2025-3-24 23:26 作者: Oafishness 時間: 2025-3-25 05:17
Series Expansions of Algebraic Functions,raic functions. From the algorithm we show why the series developed over fields of finite characteristic will not necessarily be Puiseux..The series . = 1 + .. + .. + .. + ... satisfies .. + . + 1+ . = 0 over ... The shape of such series, which satisfy algebraic functions but which are not Puiseux series, is explored.作者: 樂器演奏者 時間: 2025-3-25 10:36 作者: 彎曲的人 時間: 2025-3-25 13:02
https://doi.org/10.1007/978-1-4615-4082-3thin group theory (see the examples in Coxeter and Moser [4]). Carmody and Walters [2, 3] gave a generalised procedure relating to the construction of certain left Kan extensions. Of this procedure, the Todd-Coxeter method is a special case. This paper describes a further generalisation, extending t作者: ASTER 時間: 2025-3-25 19:27 作者: recession 時間: 2025-3-25 20:36 作者: 載貨清單 時間: 2025-3-26 02:47 作者: 要塞 時間: 2025-3-26 06:09
https://doi.org/10.1007/978-1-349-12448-0(.) and ..(.) are monic polynomials with integer coefficients. These coefficients can be computed by simple algorithms which require .(..) arithmetic operations over the integers. Also, there are explicit formulas and generating functions for ..(.) and ..(.). This paper is a preliminary report which作者: 休息 時間: 2025-3-26 10:55
https://doi.org/10.1007/978-1-349-12448-0o illustrate many of the tools and features available in Magma for elementary number theory, on the other hand it provides an opportunity to present the results of some computations extending previously published tables about the first occurrence of integers as coefficients of cyclotomic polynomials作者: 不容置疑 時間: 2025-3-26 14:27
https://doi.org/10.1007/978-1-349-12448-0veral classical measures such as discrepancy and exponential sums. They are connected to several problems from quite different areas such as choosing parameters of linear iteration processes for solving system of linear equations, choosing knots for polynomial interpolation, estimating the size of V作者: Abjure 時間: 2025-3-26 19:12
https://doi.org/10.1007/978-1-349-12448-0tate some recent results on the computational complexity of this problem. We describe how the cylindrical algebraic decomposition (.) algorithm [2] can be used to solve this problem. We describe improvements to the efficiency of the cad-based approach to the consistency problem, some being applicabl作者: 縮影 時間: 2025-3-26 22:58
Sorin Adam Matei,Brian C. Brittli number of Leopoldt and (.) is the binomial coefficient operator. This congruence is best possible in the sense that there does not exist a pair (.), where .. (≠1) is even, such that ..(.., .) ∈ ... for all . ≥ 0..The classical generalisation of the Kummer congruence is . It will be shown that thi作者: 他姓手中拿著 時間: 2025-3-27 01:57 作者: BRACE 時間: 2025-3-27 07:51
Reports of China’s Basic Research. Recently the author has developed two related algorithms, the double coset enumeration algorithm and the vector enumeration algorithm. This paper establishes a common framework for the three algorithms, based on a related algorithm for constructing transformation representations of monoids.作者: 果核 時間: 2025-3-27 10:25 作者: 征服 時間: 2025-3-27 16:55 作者: 因無茶而冷淡 時間: 2025-3-27 18:01 作者: 不給啤 時間: 2025-3-27 22:28
https://doi.org/10.1007/978-94-017-1108-1Category theory; Group theory; algebra; algorithms; automata; computer; computer science; number theory; com作者: 一小塊 時間: 2025-3-28 04:48
978-90-481-4560-7Springer Science+Business Media Dordrecht 1995作者: Bucket 時間: 2025-3-28 08:02 作者: Digest 時間: 2025-3-28 13:35 作者: 使隔離 時間: 2025-3-28 14:37 作者: BROTH 時間: 2025-3-28 22:39
Does the Set of Points of an Elliptic Curve Determine the Group?,natural way, the point at infinity being the zero element. It is often heard that the group structure on .(.) is “determined” by the fact that three points of .(.) add up to zero if they lie on a line. In this paper we investigate whether this statement is correct if taken literally. We find that it作者: 不能和解 時間: 2025-3-29 00:18
Bounds for Class Numbers of Quadratic Orders,+ . : ., . ∈ .}, and a . in .. is one which can be written as [., . + ..] where . = .(.) is the . of . and .. = .. + . for integers . and . with .. Here .. is the ., i.e. the square-free kernel of Δ, and we have that . = 2 if .. ≡ 1 mod 4 or . = 1 otherwise.作者: 我怕被刺穿 時間: 2025-3-29 07:08
Short Representation of Quadratic Integers, in log log H(.), log N(.) and log Δ where H(.) is the height of . and N(.) is the norm of .. We show that using compact representations we can in polynomial time compute norms, signs, products, and inverses of numbers in . and principal ideals generated by numbers in .. We also show how to compare 作者: 虛假 時間: 2025-3-29 08:57
Computing Aurifeuillian Factors,(.) and ..(.) are monic polynomials with integer coefficients. These coefficients can be computed by simple algorithms which require .(..) arithmetic operations over the integers. Also, there are explicit formulas and generating functions for ..(.) and ..(.). This paper is a preliminary report which作者: athlete’s-foot 時間: 2025-3-29 12:08
Computation of Cyclotomic Polynomials with Magma,o illustrate many of the tools and features available in Magma for elementary number theory, on the other hand it provides an opportunity to present the results of some computations extending previously published tables about the first occurrence of integers as coefficients of cyclotomic polynomials作者: IVORY 時間: 2025-3-29 17:21
On Some Characteristics of Uniformity of Distribution and Their Applications,veral classical measures such as discrepancy and exponential sums. They are connected to several problems from quite different areas such as choosing parameters of linear iteration processes for solving system of linear equations, choosing knots for polynomial interpolation, estimating the size of V作者: Cytology 時間: 2025-3-29 22:16 作者: Tartar 時間: 2025-3-30 03:43
A New Generalisation of the Kummer Congruence,li number of Leopoldt and (.) is the binomial coefficient operator. This congruence is best possible in the sense that there does not exist a pair (.), where .. (≠1) is even, such that ..(.., .) ∈ ... for all . ≥ 0..The classical generalisation of the Kummer congruence is . It will be shown that thi作者: Abutment 時間: 2025-3-30 06:30 作者: 不規(guī)則的跳動 時間: 2025-3-30 10:56 作者: 咒語 時間: 2025-3-30 16:14 作者: Anonymous 時間: 2025-3-30 17:42 作者: 不能約 時間: 2025-3-31 00:46
Sorin Adam Matei,Brian C. Britt, where .. (≠1) is even, such that ..(.., .) ∈ ... for all . ≥ 0..The classical generalisation of the Kummer congruence is . It will be shown that this is periodic in the sense that ..(.., .) ≡ ..(.., .) mod ... if . ≡ . mod (. ? 1) with . > 0 and . ≡ . mod (. ? 1).作者: 出處 時間: 2025-3-31 03:54
Short Representation of Quadratic Integers,ynomial time compute norms, signs, products, and inverses of numbers in . and principal ideals generated by numbers in .. We also show how to compare numbers given in compact representation in polynomial time.作者: Adjourn 時間: 2025-3-31 05:19 作者: 取回 時間: 2025-3-31 11:47 作者: Cerumen 時間: 2025-3-31 15:31 作者: HEAVY 時間: 2025-3-31 20:26
https://doi.org/10.1007/978-1-349-12448-0 states the results for the case . ≡ 1 mod 4, and gives some numerical examples. The proofs, generalisations to other square-free ., and similar results for the identities of Gauss and Dirichlet, appear elsewhere[1].作者: 我不明白 時間: 2025-3-31 22:30
https://doi.org/10.1007/978-1-349-12448-0e also to .-based approaches to more general quantifier elimination problems. We present a version of the . algorithm which solves the consistency problem for conjunctions of strict inequalities, and which runs faster than the original method applied to this problem.作者: podiatrist 時間: 2025-4-1 02:22
Book 1995new and traditional algorithms, the creation ofnew paradigms for implementing computational methods, the viewing ofold techniques from a concrete algorithmic vantage point, to name buta few. ..Computational Algebra and Number Theory. lies at the livelyintersection of computer science and mathematics作者: GOAD 時間: 2025-4-1 09:09 作者: Flawless 時間: 2025-4-1 14:02 作者: outset 時間: 2025-4-1 17:54
Does the Set of Points of an Elliptic Curve Determine the Group?,rojective plane over ., but have different group structures. Our main result states that this is a rare phenomenon: it occurs if and only if . has characteristic 2 and .(.) has order 5. We also encounter an elliptic curve . for which .(.) has a .[.]-module structure for many fields ., even though . does not have complex multiplication by .[.].作者: nonplus 時間: 2025-4-1 20:29 作者: Triglyceride 時間: 2025-4-2 00:21
