作者: CAPE 時間: 2025-3-21 22:36 作者: goodwill 時間: 2025-3-22 04:03
Locally effective objects and algebraic topology,ll if and only if the space . is ..; in another case, the group measures the lack of simple connectivity. Many other groups can be associated to a topological space, evaluating certain properties of this space: homology groups,.-theory groups,etc.作者: 咽下 時間: 2025-3-22 04:41
,Complexity of Bezout’s Theorem II Volumes and Probabilities,systems is .. where . = Π .. is the Be zout number. We estimate the volume of the subspace of badly conditioned problems and show that volume is bounded by a small degree polynomial in ., . and . times the reciprocal of the condition number to the fourth power. Here . is the dimension of the space of systems.作者: 努力趕上 時間: 2025-3-22 12:48 作者: 黃油沒有 時間: 2025-3-22 14:35
,Decision of Algebra Isomorphisms Using Gr?bner Bases, problem. One is to compute the radical of . directly and then to rewrite the above determinant . modulo this radical. The other method is to judge solvability of a certain system of algebraic equations: the union of . and a new polynomial. As a result, it is shown that the isomorphism problem for finitely presented algebras is decidable.作者: 黃油沒有 時間: 2025-3-22 18:33
The Resultant via a Koszul Complex,ou, however from a rather different point of view). So, I will give here elementary and short proofs of the theorems needed—except the well-known acyclicity of the Koszul complex and the “Principal Theorem of Elimination”—and present some useful remarks leading to the subsequent algorithm. In fact, 作者: 失眠癥 時間: 2025-3-23 00:11 作者: 固執(zhí)點好 時間: 2025-3-23 03:00 作者: jumble 時間: 2025-3-23 06:27
Damped Motion of Shear Buildings show how the information provided by the individual quadratic forms may be combined to determine the number of real points satisfying a conjunction of constraints. The complexity of the computation is polynomial in the dimension as a vector space of the quotient ring associated to the defining equa作者: circumvent 時間: 2025-3-23 13:00
https://doi.org/10.1007/978-1-4612-2752-6Mathematica; Volume; algebra; algebraic geometry; algebraic number theory; commutative algebra; commutativ作者: Goblet-Cells 時間: 2025-3-23 16:19 作者: Commission 時間: 2025-3-23 20:09
,Gr?bner Bases and Standard Monomial Theory,hadri et al. can be used to compute Gr?bner bases. This generalizes results of Sturmfels and White in which straightening has been interpreted as a normal form computation with respect to a Gr?bner basis.作者: Diuretic 時間: 2025-3-24 00:50
Versal deformations of powers of volume forms,. has a μ-parameter versal deformation for almost every value of .. Exceptional values of . form a discrete set of negative rational numbers. Given ., the versal deformation can be obtained algorithmically. For non-exceptional values of . it is the same as the versal deformation of the germ of a function ..作者: 半身雕像 時間: 2025-3-24 03:45
Applications of Algebraic Geometry to Computer Vision,in vision problems naturally involve polynomial equations; ii) with the increase in available computing power it is easier to implement algorithms which stay close to the geometry underlying vision; and iii) algebraic geometry may in future provide methods for assessing the stability of algorithms against small perturbations in the data.作者: paleolithic 時間: 2025-3-24 09:16
,Disproving Hibi’s Conjecture with CoCoA or Projective Curves with bad Hilbert Functions,ly CoCoA (see [G-N] and [A-G-N])) in order to explicitly construct Cohen-Macaulay domains, which are standard .-algebras and whose Hilbert function is “bad”. In particular we disprove a well-known conjecture by Hibi.作者: conflate 時間: 2025-3-24 11:36 作者: cultivated 時間: 2025-3-24 15:21
Progress in Mathematicshttp://image.papertrans.cn/c/image/232088.jpg作者: COUCH 時間: 2025-3-24 21:44 作者: BLANC 時間: 2025-3-24 23:27
Sorin Adam Matei,Brian C. BrittWe prove some new facts concerning metric properties of semi algebraic sets and on this base establish some geometric properties of nearcritical trajectories in polynomial control problems.作者: 吞吞吐吐 時間: 2025-3-25 07:00 作者: osculate 時間: 2025-3-25 07:40
M. Geradin,A. Huck,B. Fraeijs de VeubekeLet . be an algebraically closed field and let . ? A. stand for a quasi homogeneous surface admitting a rational parametrization given by monomials. Consider the blowing-up A. of A. with center . and look at the fibre of the structural morphism.over the origin 0 (the . of the blowing-up).作者: Spinal-Tap 時間: 2025-3-25 12:20 作者: 剝皮 時間: 2025-3-25 19:23
https://doi.org/10.1007/978-1-4615-0481-8We shall motivate the use of geometric cues in intelligent vision, then explain how mathematics can be used to define and unify treatment of these cues...作者: SPURN 時間: 2025-3-25 22:41 作者: 牲畜欄 時間: 2025-3-26 01:57
Dynamic Analysis of Plane FramesWe describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals..This appears to be a fundamental tool for the simplification of algebraic numbers.作者: fulmination 時間: 2025-3-26 05:35 作者: 改正 時間: 2025-3-26 10:34 作者: DAMP 時間: 2025-3-26 14:42 作者: 肉身 時間: 2025-3-26 19:13 作者: 小溪 時間: 2025-3-27 00:59
The analytic spread of the ideal of a monomial curve in projective 3-space,Let . be an algebraically closed field and let . ? A. stand for a quasi homogeneous surface admitting a rational parametrization given by monomials. Consider the blowing-up A. of A. with center . and look at the fibre of the structural morphism.over the origin 0 (the . of the blowing-up).作者: Petechiae 時間: 2025-3-27 04:31
Computational Complexity of Sparse Real Algebraic Function Interpolation,We analyze the computational complexity of the problem of interpolating real algebraic functions given by a black box for their evaluations, extending the results of [GKS 90b, GKS 91b] on interpolation of sparse rational functions.作者: machination 時間: 2025-3-27 05:34
Shade, Shadow and Shape,We shall motivate the use of geometric cues in intelligent vision, then explain how mathematics can be used to define and unify treatment of these cues...作者: 審問 時間: 2025-3-27 09:49 作者: 身體萌芽 時間: 2025-3-27 16:57
Computing subfields: Reverse of the primitive element problem,We describe an algorithm which computes all subfields of an effectively given finite algebraic extension. Although the base field can be arbitrary, we focus our attention on the rationals..This appears to be a fundamental tool for the simplification of algebraic numbers.作者: Audiometry 時間: 2025-3-27 18:53 作者: 小丑 時間: 2025-3-28 00:09
Computational Algebraic Geometry978-1-4612-2752-6Series ISSN 0743-1643 Series E-ISSN 2296-505X 作者: landfill 時間: 2025-3-28 02:41
0743-1643 Overview: 978-1-4612-7652-4978-1-4612-2752-6Series ISSN 0743-1643 Series E-ISSN 2296-505X 作者: SOW 時間: 2025-3-28 09:42
https://doi.org/10.1007/978-3-030-48173-5hadri et al. can be used to compute Gr?bner bases. This generalizes results of Sturmfels and White in which straightening has been interpreted as a normal form computation with respect to a Gr?bner basis.作者: 裝勇敢地做 時間: 2025-3-28 14:23 作者: Ancestor 時間: 2025-3-28 18:32
https://doi.org/10.1007/978-1-4615-7918-2in vision problems naturally involve polynomial equations; ii) with the increase in available computing power it is easier to implement algorithms which stay close to the geometry underlying vision; and iii) algebraic geometry may in future provide methods for assessing the stability of algorithms against small perturbations in the data.作者: 賞心悅目 時間: 2025-3-28 22:45 作者: 松緊帶 時間: 2025-3-28 22:55
Damped Motion of Shear Buildings where . is large. The computation time depends only poly normally on the . of the problem, where this is defined to be the maximum of ., .(.) and .(.), where . is the total degree of p(., .), assumed to be small relative to ., and . is the maximum of the absolute values of the coefficients.作者: 巧思 時間: 2025-3-29 03:50
Influencing Factors for Fatigue Strength,homogeneous) polynomials is less than or equal to the number of variables.. It was known around 1930 that resultants may be calculated as a Mc Rae invariant of this complex. This expresses the resultant as an alternate product of determinants coming from the differentials of this complex. Demazure e作者: 能夠支付 時間: 2025-3-29 09:58
https://doi.org/10.1007/978-3-030-48173-5hadri et al. can be used to compute Gr?bner bases. This generalizes results of Sturmfels and White in which straightening has been interpreted as a normal form computation with respect to a Gr?bner basis.作者: CAND 時間: 2025-3-29 14:10
Dynamic Analysis of Plane Frames. has a μ-parameter versal deformation for almost every value of .. Exceptional values of . form a discrete set of negative rational numbers. Given ., the versal deformation can be obtained algorithmically. For non-exceptional values of . it is the same as the versal deformation of the germ of a fun作者: 吸引力 時間: 2025-3-29 16:10 作者: Fillet,Filet 時間: 2025-3-29 22:23 作者: 繁殖 時間: 2025-3-30 01:46
Damped Motion of Shear Buildingsalgebraic set which lie within some algebraic constraint region. We introduce a family of quadratic forms determined by the algebraic constraints and defined in terms of the trace from the coordinate ring of the variety to the ground field, and we show that the rank and signature of these forms are 作者: Insatiable 時間: 2025-3-30 07:32
Damped Motion of Shear Buildings where . is large. The computation time depends only poly normally on the . of the problem, where this is defined to be the maximum of ., .(.) and .(.), where . is the total degree of p(., .), assumed to be small relative to ., and . is the maximum of the absolute values of the coefficients.作者: Gastric 時間: 2025-3-30 08:43
https://doi.org/10.1007/978-1-4615-7918-2ociate the group π.(.,.. to a topological space . and to one of its points ..; this group is called the . of the space . based on ... This group is null if and only if the space . is ..; in another case, the group measures the lack of simple connectivity. Many other groups can be associated to a top作者: Introvert 時間: 2025-3-30 15:20 作者: CHOP 時間: 2025-3-30 19:52 作者: Pathogen 時間: 2025-3-30 21:53
The Resultant via a Koszul Complex,homogeneous) polynomials is less than or equal to the number of variables.. It was known around 1930 that resultants may be calculated as a Mc Rae invariant of this complex. This expresses the resultant as an alternate product of determinants coming from the differentials of this complex. Demazure e作者: Agronomy 時間: 2025-3-31 02:24
,Gr?bner Bases and Standard Monomial Theory,hadri et al. can be used to compute Gr?bner bases. This generalizes results of Sturmfels and White in which straightening has been interpreted as a normal form computation with respect to a Gr?bner basis.作者: B-cell 時間: 2025-3-31 06:55
Versal deformations of powers of volume forms,. has a μ-parameter versal deformation for almost every value of .. Exceptional values of . form a discrete set of negative rational numbers. Given ., the versal deformation can be obtained algorithmically. For non-exceptional values of . it is the same as the versal deformation of the germ of a fun作者: 與野獸博斗者 時間: 2025-3-31 10:26
Applications of Algebraic Geometry to Computer Vision,in vision problems naturally involve polynomial equations; ii) with the increase in available computing power it is easier to implement algorithms which stay close to the geometry underlying vision; and iii) algebraic geometry may in future provide methods for assessing the stability of algorithms a作者: 有幫助 時間: 2025-3-31 13:41
,Disproving Hibi’s Conjecture with CoCoA or Projective Curves with bad Hilbert Functions,ly CoCoA (see [G-N] and [A-G-N])) in order to explicitly construct Cohen-Macaulay domains, which are standard .-algebras and whose Hilbert function is “bad”. In particular we disprove a well-known conjecture by Hibi.作者: Constitution 時間: 2025-3-31 18:08
Counting real zeros in the multivariate case,algebraic set which lie within some algebraic constraint region. We introduce a family of quadratic forms determined by the algebraic constraints and defined in terms of the trace from the coordinate ring of the variety to the ground field, and we show that the rank and signature of these forms are 作者: endarterectomy 時間: 2025-3-31 23:13
Finding the number of distinct real roots of sparse polynomials of the form ,,), where . is large. The computation time depends only poly normally on the . of the problem, where this is defined to be the maximum of ., .(.) and .(.), where . is the total degree of p(., .), assumed to be small relative to ., and . is the maximum of the absolute values of the coefficients.
