共查询到20条相似文献,搜索用时 515 毫秒
1.
Let D be an integral domain such that Int(D) ≠ K[X] where K is the quotient field of D. There is no known example of such a D so that Int(D) has finite elasticity. If E is a finite nonempty subset of D, then it is known that Int(E, D) = {f(X) ∈ K[X] | f(e) ∈ D for all e ∈ E} is not atomic. In this note, we restrict the notion of elasticity so that it is applicable to nonatomic domains. For each
real number r ≥ 1, we produce a ring of integer-valued polynomials with restricted elasticity r. We further show that if D is a unique factorization domain and E is finite with |E| > 1, then the restricted elasticity of Int(E, D) is infinite. 相似文献
2.
Let D be an integral domain and E a non-empty finite subset of D. For n ≧ 2, we show that D has the n-generator property if and only if Int(E, D) has the n-generator property if and only if Int(E, D) has the strong (n + 1)-generator property. Thus, iterating the Int(E, D) construction cannot produce Prüfer domains whose finitely generated ideals require an ever larger number of generators.
We also show that, for n ≧ 2, a non-zero polynomial f ∈Int(E, D) is a strong n-generator in Int(E, D) if and only if f (a) is a strong n-generator in D for all a ∈E.
Received: 15 July 2004 相似文献
3.
Zoltán Füredi 《Combinatorica》1981,1(2):155-162
Let ℋ be a family ofr-subsets of a finite setX. SetD(ℋ)=
|{E:x∈E∈ℋ}|, (maximum degree). We say that ℋ is intersecting if for anyH,H′ ∈ ℋ we haveH ∩H′ ≠ 0. In this case, obviously,D(ℋ)≧|ℋ|/r. According to a well-known conjectureD(ℋ)≧|ℋ|/(r−1+1/r). We prove a slightly stronger result. Let ℋ be anr-uniform, intersecting hypergraph. Then either it is a projective plane of orderr−1, consequentlyD(ℋ)=|ℋ|/(r−1+1/r), orD(ℋ)≧|ℋ|/(r−1). This is a corollary to a more general theorem on not necessarily intersecting hypergraphs. 相似文献
4.
Katarzyna Jesse-Józefczyk 《Central European Journal of Mathematics》2012,10(3):1113-1124
Let G = (V, E) be a graph. A global secure set SD ⊆ V is a dominating set which satisfies the condition: for all X ⊆ SD, |N[X] ∩ SD| ≥ | N[X] − SD|. A global defensive alliance is a set of vertices A that is dominating and satisfies a weakened condition: for all x ∈ A, |N[x] ∩ A| ≥ |N[x] − A|. We give an upper bound on the cardinality of minimum global secure sets in cactus trees. We also present some results for
trees, and we relate them to the known bounds on the minimum cardinality of global defensive alliances. 相似文献
5.
Masahiro Yasumoto 《manuscripta mathematica》1990,66(1):227-235
LetK be an algebraic number field of finite degree andf(X,T) a polynomial overK. For eachφ(X)∈Z[X], we denote byE(φ) the set of all integersa with φ
m
(a) =φ
n
(a) for somem≠n. In this paper, we give a condition for a polynomialφ(X)∈Z[X] to satisfy the following; If forn∈N, there existr∈K anda∈Z−E(φ) such thatf r, φ
m
(a)=0, then there exists a rational functiong(X) overK andk∈N such thatf(g(T)), φ
k
(T))=0 . 相似文献
6.
《Quaestiones Mathematicae》2013,36(6):823-830
AbstractRecall that an integral domain R is said to be a non-D-ring if there exists a non-constant polynomial f (X) in R[X] (called a uv-polynomial) such that f (a) is a unit of R for every a in R. In this note we generalize this notion to commutative rings (that are not necessarily integral domains) as follows: for a positive integer n, we say that R is an n-non-D-ring if there exists a polynomial f of degree n in R[X] such that f (a) is a unit of R for every a in R. We then investigate the properties of this notion in di?erent contexts of commutative rings. 相似文献
7.
We fix a prime p and let f(X) vary over all monic integer polynomials of fixed degree n. Given any possible shape of a tamely ramified splitting of p in an extension of degree n, we prove that there exists a rational function φ(X)∈ℚ(X) such that the density of the monic integer polynomials f(X) for which the splitting of p has the given shape in ℚ[X]/f(X) is φ(p) (here reducible polynomials can be neglected). As a corollary, we prove that, for p≥n, the density of irreducible monic polynomials of degree n in ℤ
p
[X] is the value at p of a rational function φ
n
(X)∈ℚ(X). All rational functions involved are effectively computable.
Received: 15 September 1998 / Revised version: 21 October 1999 相似文献
8.
Chun-Yen Shen 《Israel Journal of Mathematics》2012,188(1):123-130
We classify the polynomials f(x, y) ∈ ℝ[x, y] such that, given any finite set A ⊂ ℝ, if |A + A| is small, then |f(A,A)| is large. In particular, the following bound holds: |A + A‖f(A,A)| ≳ |A|5/2. The Bezout theorem and a theorem by Y. Stein play an important role in our proof. 相似文献
9.
Parviz Sahandi 《Ricerche di matematica》2009,58(2):219-242
Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type ⋆[X] on the polynomial ring D[X], such that, if n := ⋆-dim(D), then n+1 ≤ ⋆[X]-dim(D[X]) ≤ 2n+1. We also establish that if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain, then ⋆[X]-dim(D[X]) = ⋆- dim(D)+1. Moreover we define the semistar valuative dimension of the domain D, denoted by ⋆-dim
v
(D), to be the maximal rank of the ⋆-valuation overrings of D. We show that ⋆-dim
v
(D) = n if and only if ⋆[X
1, . . . , X
n
]-dim(D[X
1, . . . , X
n
]) = 2n, and that if ⋆-dim
v
(D) < ∞ then ⋆[X]-dim
v
(D[X]) = ⋆-dim
v
(D) + 1. In general ⋆-dim(D) ≤ ⋆-dim
v
(D) and equality holds if D is a ⋆-Noetherian domain or is a Prüfer ⋆-multiplication domain. We define the ⋆-Jaffard domains as domains D such that ⋆-dim(D) < ∞ and ⋆-dim(D) = ⋆-dim
v
(D). As an application, ⋆-quasi-Prüfer domains are characterized as domains D such that each (⋆, ⋆′)-linked overring T of D, is a ⋆′-Jaffard domain, where ⋆′ is a stable semistar operation of finite type on T. As a consequence of this result we obtain that a Krull domain D, must be a w
D
-Jaffard domain. 相似文献
10.
For a scale of spaces X of functions analytic in the unit disc, including the Korenblum space, and for some natural families ɛ of uniqueness subsets
for X, we describe minorants for (X, ɛ), that is, non-decreasing functions M: (0, 1) → (0, ∞) such that f ∈ X, E ∈ ɛ, and log |f(z)| ≤ −M(|z|) on E imply f = 0. We give an application of this result to approximation by simple fractions with restrictions on the coefficients.
The first author was partially supported by the ANR project DYNOP.
The second author was partially supported by the Research Council of Norway, grant 160192/V30. 相似文献
11.
Yossi Moshe 《Journal d'Analyse Mathématique》2006,99(1):267-294
Let λ be the upper Lyapunov exponent corresponding to a product of i.i.d. randomm×m matrices (X
i)
i
0/∞
over ℂ. Assume that theX
i's are chosen from a finite set {D
0,D
1...,D
t-1(ℂ), withP(X
i=Dj)>0, and that the monoid generated byD
0, D1,…, Dq−1 contains a matrix of rank 1. We obtain an explicit formula for λ as a sum of a convergent series. We also consider the case
where theX
i's are chosen according to a Markov process and thus generalize a result of Lima and Rahibe [22].
Our results on λ enable us to provide an approximation for the numberN
≠0(F(x)n,r) of nonzero coefficients inF(x)
n.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN
≠0(F(x)n,r) ≈n
α for “almost” everyn.
Supported in part by FWF Project P16004-N05 相似文献
12.
Let S° be an inverse semigroup with semilattice biordered set E° of idempotents and E a weakly inverse biordered set with a subsemilattice Ep = { e ∈ E | arbieary f ∈ E, S(f , e) loheain in w(e)} isomorphic to E° by θ:Ep→E°. In this paper, it is proved that if arbieary f, g ∈E, f ←→ g→→ f°θD^s° g°θand there exists a mapping φ from Ep into the symmetric weakly inverse semigroup P J(E∪ S°) satisfying six appropriate conditions, then a weakly inverse semigroup ∑ can be constructed in P J(S°), called the weakly inverse hull of a weakly inverse system (S°, E, θ, φ) with I(∑) ≌ S°, E(∑) ∽- E. Conversely, every weakly inverse semigroup can be constructed in this way. Furthermore, a sufficient and necessary condition for two weakly inverse hulls to be isomorphic is also given. 相似文献
13.
Jesse Elliott 《代数通讯》2013,41(11):4128-4147
Given an integral domain D with quotient field K, the ring of integer-valued polynomials on D is the subring {f(X) ∈ K[X]: f(D) ? D} of the polynomial ring K[X]. Using the tools of t-closure and associated primes, we generalize some known results on integer-valued polynomial rings over Krull domains, Prüfer v-multiplication domains, and Mori domains. 相似文献
14.
Inder Bir S. Passi 《印度理论与应用数学杂志》2012,43(2):89-106
Given a group G and a commutative ring k with identity, one can define an k-algebra k[G] called the group algebra of G over k. An element α ∈ k[G] is said to be algebraic if f(α) = 0 for some non-zero polynomial f(X) ∈ k[X]. We will discuss some of the developments in the study of algebraic elements in group algebras. 相似文献
15.
Adam Osękowski 《Journal of Theoretical Probability》2011,24(3):849-874
In the paper we determine, for any K>0 and α∈[0,1], the optimal constant L(K,α)∈(0,∞] for which the following holds: If X is a nonnegative submartingale and Y is α-strongly differentially subordinate to X, then
supt\mathbbE|Yt| £ Ksupt\mathbbEXtlog+Xt+L(K,a).\sup_t\mathbb{E}|Y_t|\leq K\sup_t\mathbb{E}X_t\log^+X_t+L(K,\alpha). 相似文献
16.
David F. Anderson 《Journal of Pure and Applied Algebra》2007,208(1):351-359
Let D be an integral domain. A saturated multiplicative subset S of D is an almost splitting set if, for each 0≠d∈D, there exists a positive integer n=n(d) such that dn=st for some s∈S and t∈D which is v-coprime to each element of S. We show that every upper to zero in D[X] contains a primary element if and only if D?{0} is an almost splitting set in D[X], if and only if D is a UMT-domain and Cl(D[X]) is torsion. We also prove that D[X] is an almost GCD-domain if and only if D is an almost GCD-domain and Cl(D[X]) is torsion. Using this result, we construct an integral domain D such that Cl(D) is torsion, but Cl(D[X]) is not torsion. 相似文献
17.
Francesca Tartarone 《代数通讯》2013,41(10):4647-4663
Let Dbe a domain with quotient field K. The ring of integer-valued polynomials over Dis Int (D):={f? K[X];f(4D) ? D}.We describe the divisorial prime ideals of Int(D) when Dis a domain of Krull-type and, in particular, when Dis also a d-ring. 相似文献
18.
Suppose Γ is a group acting on a set X, written as (Γ,X). An r-labeling f: X→{1,2, ..., r} of X is called distinguishing for (Γ,X) if for all σ∈Γ,σ≠1, there exists an element x∈X such that f(x)≠f(x
σ
). The distinguishing number d(Γ,X) of (Γ,X) is the minimum r for which there is a distinguishing r-labeling for (Γ,X). If Γ is the automorphism group of a graph G, then d(Γ,V (G)) is denoted by d(G), and is called the distinguishing number of the graph G. The distinguishing set of Γ-actions is defined to be D*(Γ)={d(Γ,X): Γ acts on X}, and the distinguishing set of Γ-graphs is defined to be D(Γ)={d(G): Aut(G)≅Γ}. This paper determines the distinguishing set of Γ-actions and the distinguishing set of Γ-graphs for almost simple groups Γ. 相似文献
19.
Let G =(V, E) be a connected simple graph. A labeling f : V → Z2 induces an edge labeling f* : E → Z2 defined by f*(xy) = f(x) +f(y) for each xy ∈ E. For i ∈ Z2, let vf(i) = |f^-1(i)| and ef(i) = |f*^-1(i)|. A labeling f is called friendly if |vf(1) - vf(0)| ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if(G) = e(1) - el(0). The set [if(G) | f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI(G). In this paper, we will determine the full friendly index set of every Cartesian product of two cycles. 相似文献
20.
LetX be a real linear normed space, (G, +) be a topological group, andK be a discrete normal subgroup ofG. We prove that if a continuous at a point or measurable (in the sense specified later) functionf:X →G fulfils the condition:f(x +y) -f(x) -f(y) ∈K whenever ‖x‖ = ‖y‖, then, under some additional assumptions onG,K, andX, there esists a continuous additive functionA :X →G such thatf(x) -A(x) ∈K. 相似文献
|