Spelling suggestions: "subject:"commutative"" "subject:"kommutative""
41 |
Intersection Algebras and Pointed Rational ConesMalec, Sara 13 August 2013 (has links)
In this dissertation we study the algebraic properties of the intersection algebra of two ideals I and J in a Noetherian ring R. A major part of the dissertation is devoted to the finite generation of these algebras and developing methods of obtaining their generators when the algebra is finitely generated.
We prove that the intersection algebra is a finitely generated R-algebra when R is a Unique Factorization Domain and the two ideals are principal, and use fans of cones to find the algebra generators. This is done in Chapter 2, which concludes with introducing a new class of algebras called fan algebras.
Chapter 3 deals with the intersection algebra of principal monomial ideals in a polynomial ring, where the theory of semigroup rings and toric ideals can be used. A detailed investigation of the intersection algebra of the polynomial ring in one variable is obtained. The intersection algebra in this case is connected to semigroup rings associated to systems of linear diophantine equations with integer coefficients, introduced by Stanley.
In Chapter 4, we present a method for obtaining the generators of the intersection algebra for arbitrary monomial ideals in the polynomial ring.
|
42 |
Obstructions to the Concordance of Satellite KnotsFranklin, Bridget 05 September 2012 (has links)
Formulas which derive common concordance invariants for satellite knots tend to lose information regarding the axis a of the satellite operation R(a,J). The Alexander polynomial, the Blanchfield linking form, and Casson-Gordon invariants all fail to distinguish concordance classes of satellites obtained by slightly varying the axis. By applying higher-order invariants and using filtrations of the knot concordance group, satellite concordance may be distinguished by determining which term of the derived series of the fundamental group of the knot complement the axes lie. There is less hope when the axes lie in the same term. We introduce new conditions to distinguish these latter classes by considering the axes in higher-order Alexander modules in three situations. In the first case, we find that R(a,J) and R(b,J) are non-concordant when a and b have distinct orders viewed as elements of the classical Alexander module of R. In the second, we show that R(a,J) and R(b,J) may be distinguished when the classical Blanchfield form of a with itself differs from that of b with itself. Ultimately, this allows us to find infinitely many concordance classes of R(-,J) whenever R has nontrivial Alexander polynomial. Finally, we find sufficient conditions to distinguish these satellites when the axes represent equivalent elements of the classical Alexander module by analyzing higher-order Alexander modules and localizations thereof.
|
43 |
Immediacy : a technique for reasoning about asynchrony /Joshi, Rejeev, January 1999 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1999. / Vita. Includes bibliographical references (leaves 152-155) and index. Available also in a digital version from Dissertation Abstracts.
|
44 |
Classification des objets galoisiens d'une algèbre de HopfAubriot, Thomas Kassel, Christian. January 2007 (has links) (PDF)
Thèse de doctorat : Mathématiques : Strasbourg 1 : 2007. / Titre provenant de l'écran-titre. Bibliogr. p. 107-109.
|
45 |
Symmetric ideals and numerical primary decompositionKrone, Robert Carlton 21 September 2015 (has links)
The thesis considers two distinct strategies for algebraic computation with polynomials in high dimension.
The first concerns ideals and varieties with symmetry, which often arise in applications from areas such as algebraic statistics and optimization. We explore the commutative algebra properties of such objects, and work towards classifying when symmetric ideals admit finite descriptions including equivariant Gröbner bases and generating sets. Several algorithms are given for computing such descriptions. Specific focus is given to the case of symmetric toric ideals.
A second area of research is on problems in numerical algebraic geometry. Numerical algorithms such as homotopy continuation can efficiently compute the approximate solutions of systems of polynomials, but generally have trouble with multiplicity. We develop techniques to compute local information about the scheme structure of an ideal at approximate zeros. This is used to create a hybrid numeric-symbolic algorithm for computing a primary decomposition of the ideal.
|
46 |
Hilbert Functions in Monomial AlgebrasHoefel, Andrew Harald 25 July 2011 (has links)
In this thesis, we study Hilbert functions of monomial ideals in the polynomial ring and the Kruskal-Katona ring. In particular, we classify Gotzmann edge ideals and, more generally, Gotzmann squarefree monomial ideals. In addition, we discuss Betti numbers of Gotzmann ideals and measure how far certain edge ideals are from Gotzmann. This thesis also contains a thorough account the combinatorial relationship between lex segments and Macaulay representations of their dimensions and codimensions.
|
47 |
Monoid Congruences, Binomial Ideals, and Their DecompositionsONeill, Christopher David January 2014 (has links)
<p>This dissertation refines and extends the theory of mesoprimary decomposition, as introduced by Kahle and Miller. We begin with an overview of the existing theory of mesoprimary decomposition </p><p>in both the combinatorial setting of monoid congruences and the arithmetic setting of binomial ideals. We state all definitions and results that are relevant for subsequent chapters. </p><p>We classify redundant mesoprimary components in both the combinatorial and arithmetic settings. Kahle and Miller give a class of redundant components in each setting that are redundant in every mesoprimary decomposition. After identifying a further class of redundant components at the level of congruences, we give a condition on the associated monoid primes that guarantees the existence of unique irredundant mesoprimary decompositions in both settings. </p><p>We introduce soccular congruences as combinatorial approximations of irreducible binomial quotients and use the theory of mesoprimary decomposition to give a combinatorial method of constructing irreducible decompositions of binomial ideals. We also demonstrate a binomial ideal which does not admit a binomial irreducible decomposition, answering a long-standing problem of Eisenbud and Sturmfels. </p><p>We extend mesoprimary decomposition of monoid congruences to congruences on monoid modules. Much of the theory for monoid congruences extends to this new setting, including a characterization of mesoprimary monoid module congruences in terms of associated prime monoid congruences and a method for constructing coprincipal decompositions of monoid module congruences using key witnesses. </p><p>We conclude with a collection of open problems for future study.</p> / Dissertation
|
48 |
The non-commutative standard modelAsquith, Rebecca January 1996 (has links)
In this work aspects of the classical Connes-Lott non-commutative standard model are examined. In particular the relationship between the chiral structure of the standard model and the condition of Poincaré Duality is investigated. Then the natural prediction of an additional force in the non-commutative standard model is explained and the consequences calculated. Finally the attempts at grand unification within the non-commutative framework are reviewed and extended.
|
49 |
Classes of normal monomial ideals /Coughlin, Heather, January 2004 (has links)
Thesis (Ph. D.)--University of Oregon, 2004. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 85-86). Also available for download via the World Wide Web; free to University of Oregon users.
|
50 |
The Euler class group of a line bundle on an affine algebraic variety over a real closed field /Robertson, Ian. January 2000 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, June 2000. / Includes bibliographical references. Also available on the Internet.
|
Page generated in 0.0444 seconds