共查询到20条相似文献,搜索用时 15 毫秒
1.
Diane Maclagan 《Proceedings of the American Mathematical Society》2001,129(6):1609-1615
The main result of this paper is that all antichains are finite in the poset of monomial ideals in a polynomial ring, ordered by inclusion. We present several corollaries of this result, both simpler proofs of results already in the literature and new results. One natural generalization to more abstract posets is shown to be false.
2.
Edward Mosteig Moss Sweedler 《Proceedings of the American Mathematical Society》2004,132(12):3473-3483
Given a valuation on the function field , we examine the set of images of nonzero elements of the underlying polynomial ring under this valuation. For an arbitrary field , a Noetherian power series is a map that has Noetherian (i.e., reverse well-ordered) support. Each Noetherian power series induces a natural valuation on . Although the value groups corresponding to such valuations are well-understood, the restrictions of the valuations to underlying polynomial rings have yet to be characterized. Let denote the images under the valuation of all nonzero polynomials of at most degree in the variable . We construct a bound for the growth of with respect to for arbitrary valuations, and then specialize to valuations that arise from Noetherian power series. We provide a sufficient condition for this bound to be tight.
3.
Aldo Conca 《Proceedings of the American Mathematical Society》2003,131(4):1015-1020
The reduction number of a standard graded algebra is the least integer such that there exists a minimal reduction of the homogeneous maximal ideal of such that . Vasconcelos conjectured that where is the initial ideal of an ideal in a polynomial ring with respect to a term order. The goal of this note is to prove the conjecture.
4.
众所周知Gr\"obner基在很多领域都有着十分重要的应用.近些年来Gr\"obner基算法有了很大的改进,其中最著名的是Faug\`ere提出的F4和F5算法. 这两个算法具有很高的效率但通常需要消耗大量的内存.鉴于此,将给出一个布尔环上基于zdd数据结构的分支Gr\"obner基算法,该算法不仅可以大大降低对内存的消耗,还能有效的控制矩阵规模,从而提高算法的整体效率.详细阐述并证明了算法的基本理论,介绍该分支算法的数据结构及分支策略.最后通过实验数据可以发现,在很多例子中此算法都要优于Magma中的F4算法. 相似文献
5.
Polynomial interpolation in several variables 总被引:10,自引:0,他引:10
This is a survey of the main results on multivariate polynomial interpolation in the last twenty-five years, a period of time
when the subject experienced its most rapid development. The problem is considered from two different points of view: the
construction of data points which allow unique interpolation for given interpolation spaces as well as the converse. In addition,
one section is devoted to error formulas and another to connections with computer algebra. An extensive list of references
is also included.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
6.
Matthias Aschenbrenner Christopher J. Hillar 《Transactions of the American Mathematical Society》2007,359(11):5171-5192
Let be a commutative Noetherian ring, and let be the polynomial ring in an infinite collection of indeterminates over . Let be the group of permutations of . The group acts on in a natural way, and this in turn gives the structure of a left module over the group ring . We prove that all ideals of invariant under the action of are finitely generated as -modules. The proof involves introducing a certain well-quasi-ordering on monomials and developing a theory of Gröbner bases and reduction in this setting. We also consider the concept of an invariant chain of ideals for finite-dimensional polynomial rings and relate it to the finite generation result mentioned above. Finally, a motivating question from chemistry is presented, with the above framework providing a suitable context in which to study it.
7.
Christopher J. Hillar Troels Windfeldt 《Proceedings of the American Mathematical Society》2008,136(12):4135-4137
Let be the polynomial ring in infinitely many indeterminates over a field , and let be the symmetric group of . The group acts naturally on , and this in turn gives the structure of a module over the group ring . A recent theorem of Aschenbrenner and Hillar states that the module is Noetherian. We address whether submodules of can have any number of minimal generators, answering this question positively.
8.
In this paper we study the structure of Gröbner bases with respect to block orders. We extend Lazard's theorem and the Gianni-Kalkbrenner theorem to the case of a zero-dimensional ideal whose trace in the ring generated by the first block of variables is radical. We then show that they do not hold for general zero-dimensional ideals.
9.
Motivated by mirror symmetry, we study certain integral representations of solutions to the Gel´fand-Kapranov-Zelevinsky (GKZ) hypergeometric system. Some of these solutions arise as period integrals for Calabi-Yau manifolds in mirror symmetry. We prove that for a suitable compactification of the parameter space, there exist certain special boundary points, which we called maximal degeneracy points, at which all solutions but one become singular.
10.
Marí a Isabel Hartillo-Hermoso 《Transactions of the American Mathematical Society》2005,357(11):4633-4646
In this paper we study irregular hypergeometric systems defined by one row. Specifically, we calculate slopes of such systems. In the case of reduced semigroups, we generalize the case studied by Castro and Takayama. In all the cases we find that there always exists a slope with respect to a hyperplane of this system. Only in the case of an irregular system defined by a integer matrix we might need a change of coordinates to study slopes at infinity. In the other cases slopes are always at the origin, defined with respect to a hyperplane. We also compute all the -characteristic varieties of the system, so we have a section of the Gröbner fan of the module defined by the hypergeometric system.
11.
Let X and Y be two Banach spaces. In this short note we show that every weakly compact subset in the projective tensor product of X and Y can be written as the intersection of finite unions of sets of the form , where KX and KY are weakly compacts subsets of X and Y, respectively. If either X or Y has the Dunford–Pettis property, then any intersection of sets that are finite unions of sets of the form , where KX and KY are weakly compact sets in X and Y, respectively, is weakly compact. 相似文献
12.
Abdolali Basiri Andreas Enge Jean-Charles Faugè re Nicolas Gü rel. 《Mathematics of Computation》2005,74(249):389-410
We present two algorithms for the arithmetic of cubic curves with a totally ramified prime at infinity. The first algorithm, inspired by Cantor's reduction for hyperelliptic curves, is easily implemented with a few lines of code, making use of a polynomial arithmetic package. We prove explicit reducedness criteria for superelliptic curves of genus 3 and 4, which show the correctness of the algorithm. The second approach, quite general in nature and applicable to further classes of curves, uses the FGLM algorithm for switching between Gröbner bases for different orderings. Carrying out the computations symbolically, we obtain explicit reduction formulae in terms of the input data.
13.
Christer Glader Mikael Lindström 《Journal of Mathematical Analysis and Applications》2002,273(2):417-427
We show how to construct all finite Blaschke product solutions and the minimal scaled Blaschke product solution to the Nevanlinna-Pick interpolation problem in the open unit disc by solving eigenvalue problems of the interpolation data. Based on a result of Jones and Ruscheweyh we note that there always exists a finite Blaschke product of degree at most n−1 that maps n distinct points in the closed unit disc, of which at least one is on the unit circle, into n arbitrary points in the closed unit disc, provided that the points inside the unit circle form a positive semi-definite Pick matrix of full rank. Finally, we discuss a numerical limiting procedure. 相似文献
14.
Christophe Rabut 《Numerical Algorithms》2005,39(1-3):329-348
We present in this paper a family of functions which are tensor product functions in subdomains, while not having the usual drawback of functions which are tensor product functions in the whole domain. With these functions we can add more points in some region without adding points on lines parallel to the axes. These functions are linear combinations of tensor product polynomial B-splines, and the knots of different B-splines are less connected together than with usual polynomial B-splines. Approximation of functions, or data, with such functions gives satisfactory results, as shown by numerical experimentation.
AMS subject classification 41A15, 41A63, 65Dxx 相似文献
15.
Lorenzo Robbiano Moss Sweedler 《Proceedings of the American Mathematical Society》1998,126(8):2213-2219
For an ideal or -subalgebra of , consider subfields , where is generated - as ideal or -subalgebra - by polynomials in . It is a standard result for ideals that there is a smallest such . We give an algorithm to find it. We also prove that there is a smallest such for -subalgebras. The ideal results use reduced Gröbner bases. For the subalgebra results we develop and then use subduced SAGBI (bases), the analog to reduced Gröbner bases.
16.
Anton Betten 《Designs, Codes and Cryptography》2008,47(1-3):191-219
We present two families of constacyclic linear codes with large automorphism groups. The codes are obtained from the twisted
tensor product construction.
相似文献
17.
For a finite free and projective EI category, we prove that Gorenstein-projective modules over its category algebra are closed under the tensor product if and only if each morphism in the given category is a monomorphism. 相似文献
18.
Bang-yen Chen 《Annals of Global Analysis and Geometry》1993,11(4):345-359
In this article we obtain the best possible estimates of the type number of tensor product immersions and investigate tensor product immersions with lowest possible type. Several classification theorems in this respect are then proved. 相似文献
19.
20.
Jaume Gine Jaume Llibre Claudia Valls 《Journal of Applied Analysis & Computation》2017,7(4):1534-1548
For the polynomial differential system $\dot{x}=-y$, $\dot{y}=x +Q_n(x,y)$, where $Q_n(x,y)$ is a homogeneous polynomial of degree $n$ there are the following two conjectures done in 1999. (1) Is it true that the previous system for $n \ge 2$ has a center at the origin if and only if its vector field is symmetric about one of the coordinate axes? (2) Is it true that the origin is an isochronous center of the previous system with the exception of the linear center only if the system has even degree? We give a step forward in the direction of proving both conjectures for all $n$ even. More precisely, we prove both conjectures in the case $n = 4$ and for $n\ge 6$ even under the assumption that if the system has a center or an isochronous center at the origin, then it is symmetric with respect to one of the coordinate axes, or it has a local analytic first integral which is continuous in the parameters of the system in a neighborhood of zero in the parameters space. The case of $n$ odd was studied in [8]. 相似文献