Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 303 for “"Divisor"”.
-
Prime symmetric divisor functions
In this thesis, we study a new class of divisor-related functions: the prime symmetric functions. The elementary prime symmetric functions are denned on the nonnegative integers. They take the values of the elementary symmetric functions applied to the multi-set of prime factors with repetition of …
-
Planar Zero-Divisor Graphs
… is a graph whose vertices are the nonzero zero-divisors, and such that two distinct vertices x and y are adjacent if and only if xy = 0. this graph is called the zero-divisor graph of the ring. Now assume that the ring is not a field. A result of Akbari, Maimani, and Yassemi (Journal of Algebra …
-
Two Problems on Divisor Functions
Abstract Not Provided.
-
Divisor Graph and Factorization Type
… we associate a graph in a natural way with the divisors of a commutative ring. ii
-
Combinatorial divisor theory for graphs
… been employed in the development of a theory of divisors on graphs analogous to the classical theory for Riemann surfaces. In particular, Baker and Norin were able to use this set up to prove a combinatorial Riemann-Roch formula, whose classical counterpart is one of the cornerstones of modern …
-
The Congruence-Based Zero-Divisor Graph
… <em>R</em>. We define the congruence-based zero-divisor graph of R ito be the simple graph with vertices the nonzero zero-divisors of <em>R</em>/~ and with an edge between distinct vertices [<em>x</em>] and [<em>y</em>] if and only if [<em>x</em>][<em>y</em>] = [0]. Examples include the usual …
-
Zero Divisor Graphs and Poset Decomposition
… ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ordered sets. In this paper, we will discuss some known results on zero-divisor …
-
Weierstrass Vertices and Divisor Theory of Graphs
Chip-firing games and divisor theory on finite, connected, undirected and unweighted graphs have been studied as analogs of divisor theory on Riemann Surfaces. As part of this theory, a version of the one-dimensional Riemann-Roch theorem was introduced for graphs by Matt Baker in 2007. Properties …
-
Divisor Class Group Arithmetic on C3,4 Curves
Computing in the divisor class group of an algebraic curve is a non-trivial component in computing L-series. L-series in turn are at the heart of the Sato-Tate conjecture and related conjectures. The Sato-Tate conjecture has been proven for elliptic curves with complex multiplication, but remains …
-
Analytic versions of the zero divisor conjecture
… and frustrating problems in algebra is the zero divisor conjecture. In this work we study some analytical versions of this conjecture. We will give sufficient conditions to determine when elements of CG are uniform non zero divisors, we also give sufficient conditions to determine when elements …
-
Generalizations and Variations of the Zero-Divisor Graph
… generalizations and variations of the zero-divisor graph on commutative rings with identity. A zero-divisor graph is a graph whose vertex set is the nonzero zero-divisors of a ring, wherein two distinct vertices are adjacent if their product is zero. Variations of the zero-divisor graph are …
-
Structure in Zero-Divisor Graphs of Commutative Rings
… associate a graph in a natural way with the zero-divisors of a commutative ring. We endeavor to characterize various attributes of the graph, including connectivity, diameter, and symmetry. In exploring symmetry in the graph, we examine the automorphism group of the graph, and provide a complete …
-
Partitions into prime powers and related divisor functions
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are polynomials over Q in the so-called elementary prime symmetric functions, whose values lie in Z. The latter are defined on the nonnegative integers and take the values of the elementary symmetric …
-
Colorings of Zero-Divisor Graphs of Commutative Rings
… conjecture that the chromatic number of a zero-divisor graph of a ring R is equal to the clique number of the ring R. We begin by calculating the chromatic number of the zero-divisor graphs for some finite rings and characterizing rings whose zero-divisor graphs have finite chromatic number, …
-
On the distributions of prime divisor counting functions
Let k and n be natural numbers. Let ω(n) denote the number of distinct prime factors of n, Ω(n) denote the total number of prime factors of n counted with multiplicity, and ω_k(n) denote the number of distinct prime factors of n that occur with multiplicity exactly k. Let h ≥ 2 be a natural number. …
-
Improvements to Divisor Class Arithmetic on Hyperelliptic Curves
The divisor class group of a hyperelliptic curve over a field is a finite abelian group at the center of many open questions in algebraic geometry and number theory. Sutherland surveys some of these, including the computation of the associated L-functions and zeta functions used in his …
-
Three Dimensional Jacobian Derivations And Divisor Class Groups
… inseparable descent methods to investigate the divisor class groups of the intersections of pairs of hypersurfaces of the form $w_1^p=f$, $w_2^p=g$ in affine $5$-space with $f$, $g$ in $A=k[x,y,z]$; $k$ is an algebraically closed field of characteristic $p$ $$ $0$. This corresponds to studying …
-
Elasticity of Krull Domains with Infinite Divisor Class Group
… of the block monoid B(G,S), where G is the divisor class group of R and S is the set of elements of G containing a height-one prime ideal of R. Therefore the elasticity of R can by studied using the divisor class group. In this dissertation, we will study infinite divisor class groups to …
-
Generalizations of the Zero-Divisor Graph of a Ring
… <em>Z</em>(<em>R</em>) denote the set of zerodivisors of R. We define an undirected graph Γ(<em>R</em>) with vertices <em>Z</em>(<em>R</em>)* = <em>Z</em>(<em>R</em>) - {0}, where distinct vertices <em>x</em> and <em>y</em> of R are connected if and only if <em>xy</em> = 0. This graph is …
Page 1 of 16