Restricted Elasticity and Rings of Integer-Valued Polynomials Determined by Finite Subsets

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. Part of this work was completed while the first author was on an Academic Leave granted by the Trinity University Faculty Development Committee.     

Nonstandard arithmetic of iterated polynomials

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) =φ ⁿ (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 .     

The n-generator property in rings of integer-valued polynomials determined by finite sets

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     

Algebraic methods in sum-product phenomena

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.     

Bounds on global secure sets in cactus trees

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.     

Semistar-Krull and valuative dimension of integral domains

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 ₁, . . . , X _n ]-dim(D[X ₁, . . . , 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.     

Uniformity over primes of tamely ramified splittings

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     

Random matrix products and applications to cellular automata

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 ₀,D ₁...,D _t-1(ℂ), withP(X _i=D_j)>0, and that the monoid generated byD ₀, D₁,…, D_q−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)ⁿ,r) of nonzero coefficients inF(x) ⁿ.(modr), whereF(x) ∈ ℤ[x] andr≥2. We prove the existence of and supply a formula for a constant α (<1) such thatN _≠0(F(x)ⁿ,r) ≈n ^α for “almost” everyn. Supported in part by FWF Project P16004-N05     

On product-cordial index sets and friendly index sets of 2-regular graphs and generalized wheels

A vertex labeling f : V → Z2 of a simple graph G = (V, E) induces two edge labelings f+ , f*: E → Z2 defined by f+ (uv) = f(u)+f(v) and f*(uv) = f(u)f(v). For each i∈Z2 , let vf(i) = |{v ∈ V : f(v) = i}|, e+f(i) = |{e ∈ E : f+(e) = i}| and e*f(i)=|{e∈E:f*(e)=i}|. We call f friendly if |vf(0)-vf(1)|≤ 1. The friendly index set and the product-cordial index set of G are defined as the sets{|e+f(0)-e+f(1)|:f is friendly} and {|e*f(0)-e*f(1)| : f is friendly}. In this paper we study and determine the connection between the friendly index sets and product-cordial index sets of 2-regular graphs and generalized wheel graphs.     

Full friendly index sets of Cartesian products of two cycles

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.     

Integer-Valued Polynomial Rings,t-Closure,and Associated Primes

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.     

On the Cauchy difference on normed spaces

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.     

Logarithmic Estimates for Submartingales and Their Differential Subordinates

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

Group algebras

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.     

Uniqueness theorems for Korenblum type spaces

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.     

Distinguishing labeling of the actions of almost simple groups

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 Γ.     

A construction of weakly inverse semigroups

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.     

Further Results on Finitely Generated Projective Modules

In this paper, the exchange rings R whose primitive factor rings are artinian are studied. The following results are proved: for any exchange ring R and any two-sided ideal I of R, K ₀(π) : K ₀(R)→K ₀(R/I) is a group epimorphism with the kernel {[P]−[Q] |P = PI, Q = QI}; there is an isomorphism of ordered groups from K ₀(R) to the gorup of all such functions ƒ _P : X→Q(P∈p(R)), where X is the set of all primitive ideals of R and Q, the rational integers. Received February 2, 1999, Accepted December 9, 1999     

Maximum degree and fractional matchings in uniform hypergraphs

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.     

Quantitative form of the Luzin <Emphasis Type="Italic">C</Emphasis>-property

We prove the following statement, which is a quantitative form of the Luzin theorem on C-property: Let (X, d, μ) be a bounded metric space with metric d and regular Borel measure μ that are related to one another by the doubling condition. Then, for any function f measurable on X, there exist a positive increasing function η ∈ Ω (η(+0) = 0 and η(t)t ^−a decreases for a certain a > 0), a nonnegative function g measurable on X, and a set E ⊂ X, μE = 0 , for which