Comparison ofn-decane hydroconversion with Pt/SAPO-5 and Pt/SAPO-11 catalysts

The product distributions from bifunctional conversion ofn-decane over Pt/SAPO-5 and Pt/SAPO-11 catalysts are compared in detail. Selectivities in decane reaction vary largely with the catalyst employed: Pt/SAPO-11 produces high yields of feed isomers, whereas Pt/SAPO-5 gives high yields of cracked products and only under mild reaction conditions are isodecanes the main products obtained. These selectivities seem to be determined by the structure of the catalyst.     

SAPO—11分子筛用i—Pr2NH导向合成及其酸性研究

以ＡｌＰＯ４、Ｈ３ＰＯ４、ＳｉＯ２等为原料采用单一模板剂ｉＰｒ２ＮＨ合成了ＳＡＰＯ１１分子筛，利用Ａｖｒａｍｉ方程等对合成过程进行了定量描述。还利用红外（ＩＲ）、程序升温脱附（ＴＰＤ）、线性丁烯骨架异构反应催化活性测试等手段表征了ＳＡＰＯ１１的酸性。结果表明，合成过程随温度有明显变化，晶化阶段的活化能远高于核化阶段的值。可用Ａｖｒａｍｉ方程的参数来表征合成过程的难易程度。分子筛中存在Ｂ酸和Ｌ酸位，主要在中等强度范围，从而对线性丁烯骨架异构反应有较好的催化活性。提高分子筛中硅含量可明显增大酸位浓度，酸强度也有轻度增强。     

A lower bound for the <Emphasis Type="Italic">r</Emphasis>-order of a matrix modulo <Emphasis Type="Italic">N</Emphasis>

For a positive integer N, we define the N-rank of a non singular integer d × d matrix A to be the maximum integer r such that there exists a minor of order r whose determinant is not divisible by N. Given a positive integer r, we study the growth of the minimum integer k, such that A ^k − I has N-rank at most r, as a function of N. We show that this integer k goes to infinity faster than log N if and only if for every eigenvalue λ which is not a root of unity, the sum of the dimensions of the eigenspaces relative to eigenvalues which are multiplicatively dependent with λ and are not roots of unity, plus the dimensions of the eigenspaces relative to eigenvalues which are roots of unity, does not exceed d − r − 1. This result will be applied to recover a recent theorem of Luca and Shparlinski [6] which states that the group of rational points of an ordinary elliptic curve E over a finite field with q ⁿ elements is almost cyclic, in a sense to be defined, when n goes to infinity. We will also extend this result to the product of two elliptic curves over a finite field and show that the orders of the groups of rational points of two non isogenous elliptic curves are almost coprime when n approaches infinity. Author’s address: Dipartimento di Matematica e Informatica, Via Delle Scienze 206, 33100 Udine, Italy     

On the lattice discrepancy of bodies of rotation with boundary points of curvature zero

This article gives an asymptotic result for the lattice point discrepancy of a large body of rotation in , whose boundary is piecewise smooth and contains points of vanishing Gaussian curvature. Received: 2 November 2006     

On the residue classes of integer sequences satisfying a linear three term recurrence formula

In this paper we investigate linear three-term recurrence formulae with sequences of integers (T(n))_n?0 and (U(n))_n?0, which are ultimately periodic modulo m, e.g.

     

On the supremum of the pseudocompact group topologies

P is the class of pseudocompact Hausdorff topological groups, and P^′ is the class of groups which admit a topology T such that (G,T)∈P. It is known that every G=(G,T)∈P is totally bounded, so for G∈P^′ the supremum T^∨(G) of all pseudocompact group topologies on G and the supremum T#(G) of all totally bounded group topologies on G satisfy T^∨⊆T#.The authors conjecture for abelian G∈P^′ that T^∨=T#. That equality is established here for abelian G∈P^′ with any of these (overlapping) properties. (a) G is a torsion group; (b) |G|?c²; (c) r₀(G)=|G|=ω|G|; (d) |G| is a strong limit cardinal, and r₀(G)=|G|; (e) some topology T with (G,T)∈P satisfies w(G,T)?c; (f) some pseudocompact group topology on G is metrizable; (g) G admits a compact group topology, and r₀(G)=|G|. Furthermore, the product of finitely many abelian G∈P^′, each with the property T^∨(G)=T#(G), has the same property.     

On the linearity of ω-primality in numerical monoids

In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.     

Strong Krull primes and flat modules

There are several theorems describing the intricate relationship between flatness and associated primes over commutative Noetherian rings. However, associated primes are known to act badly over non-Noetherian rings, so one needs a suitable replacement. In this paper, we show that the behavior of strong Krull primes most closely resembles that of associated primes over a Noetherian ring. We prove an analogue of a theorem of Epstein and Yao characterizing flat modules in terms of associated primes by replacing them with strong Krull primes. Also, we partly generalize a classical equational theorem regarding flat base change and associated primes in Noetherian rings. That is, when associated primes are replaced by strong Krull primes, we show containment in general and equality in many special cases. One application is of interest over any Noetherian ring of prime characteristic. We also give numerous examples to show that our results fail if other popular generalizations of associated primes are used in place of strong Krull primes.     

Asymptotic Behavior of Solutions to the Difference Equation Using the Second Differences of a Liapunov Function

We introduce the concept of the second Liapunov differences in difference equations and show that, in the autonomous case, the second variations can guarantee the existence of solutions tending to zero while others starting arbitrarily near 0 go to ∞. These are based on Yorke's results for ordinary differential equations.     

The projected newton method for solving inverse eigenvalue problems - the case of multiple eigenvaues

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our main result is that algorithms having finite error (for a given setting) exist if and only if the solution operator is bounded (in that setting). In the worst-case setting, this means that there is no algorithm for solving ill-posed problems having finite error. In the average-case setting, this means that algorithms having finite error exist if and only lf the solution operator is bounded on the average. If the solution operator is bounded on the average, we find average-case optimal information of cardinality n and optimal algorithms using this information, and show that the average error of these algorithms tends to zero as n→∞. These results are then used to determine the [euro]-complexity, i.e., the minimal costof finding an [euro]-accurate approximation. In the worst-case setting, the [euro]comp1exity of an illposed problem is infinite for all [euro]>0; that is, we cannot find an approximation having finite error and finite cost. In the average-case setting, the [euro]-complexity of an ill-posed problem is infinite for all [euro]>0 iff the solution operator is not bounded on the average, moreover, if the the solutionoperator is bounded on the average, then the [euro]-complexity is finite for all [euro]>0.