نتایج جستجو برای: prüfer rank

تعداد نتایج: 72646  

Journal: :Journal of Algebra 1990

Journal: :Czechoslovak Mathematical Journal 1978

2009
C. Vanniarajan Kamala Krithivasan

Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from end-to-end path metrics between OD (Origin – Destination) pairs. The approac...

2009
B. Olberding

The class of Matlis domain, those integral domains whose quotient field has projective dimension 1, is surprisingly broad. However, whether every domain of Krull dimension 1 is a Matlis domain does not appear to have been resolved in the literature. In this note we construct a class of examples of one-dimensional domains (in fact, almost Dedekind domains) that are overrings of K[X, Y ] but are ...

Journal: :J. Symb. Comput. 2010
Thierry Coquand Henri Lombardi Claude Quitté

Usual definitions of Dedekind domain are not well suited for an algorithmic treatment. Indeed, the notion of Noetherian rings is subtle from a constructive point of view, and to be able to get prime ideals involve strong hypotheses. For instance, if k is a field, even given explicitely, there is in general no method to factorize polynomials in k[X]. The work [2] analyses the notion of Dedekind ...

2012
K. Alan Loper Nicholas J. Werner

The classical ring of integer-valued polynomials Int(Z) consists of the polynomials in Q[X] that map Z into Z. We consider a generalization of integervalued polynomials where elements of Q[X] act on sets such as rings of algebraic integers or the ring of n× n matrices with entries in Z. The collection of polynomials thus produced is a subring of Int(Z), and the principal question we consider is...

2001
Narsingh Deo Paulius Micikevicius

In 1918 Prüfer showed a one-to-one correspondence between n-node labeled trees and (n – 2)-tuples of node labels. The proof employed a tree code, computed by iteratively deleting the leaf with the smallest label and recording its neighbor. Since then other tree codes have been proposed, based on different node deletion sequences. These codes have different properties, interesting and useful in ...

Journal: :Journal of Algebra 1987

2007

We prove that each almost local-global semihereditary ring R has the stacked bases property and is almost Bézout. More precisely, if M is a finitely presented module, its torsion part tM is a direct sum of cyclic modules where the family of annihilators is an ascending chain of invertible ideals. These ideals are invariants of M. Moreover M/tM is a projective module which is isomorphic to a dir...

2004
Francois Couchot

We prove that each almost local-global semihereditary ring R has the stacked bases property and is almost Bézout. More precisely, if M is a finitely presented module, its torsion part tM is a direct sum of cyclic modules where the family of annihilators is an ascending chain of invertible ideals. These ideals are invariants of M . Moreover M/tM is a projective module which is isomorphic to a di...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید