Higher-order Carmichael numbers

We define a Carmichael number of order to be a composite integer such that th-power raising defines an endomorphism of every -algebra that can be generated as a -module by elements. We give a simple criterion to determine whether a number is a Carmichael number of order , and we give a heuristic argument (based on an argument of Erdos for the usual Carmichael numbers) that indicates that for every there should be infinitely many Carmichael numbers of order . The argument suggests a method for finding examples of higher-order Carmichael numbers; we use the method to provide examples of Carmichael numbers of order .

     

Density of Carmichael numbers with three prime factors

We get an upper bound of on the number of Carmichael numbers with exactly three prime factors.

     

Square-free values of the Carmichael function

We obtain an asymptotic formula for the number of square-free values among p−1, for primes p?x, and we apply it to derive the following asymptotic formula for L(x), the number of square-free values of the Carmichael function λ(n) for 1?n?x,

     

Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm

We prove that prime witnesses in the Miller-Rabin algorithm coincide with those in the Shor algorithm which satisfy the condition of Fermat’s little theorem. We describe the set of natural numbers, whose prime witnesses in the Miller-Rabin algorithm coincide with those in the Shor algorithm. We find all such numbers less than 100,000,000 and experimentally study the rate of increase of the ratio of the quantity of such numbers to the quantity of Carmichael numbers.     

A compositeness test that never fails for Carmichael numbers

Paper withdrawn by author after original electronic posting date of September 19, 2006 and prior to preparation of the printed issue.

     

A new constructing auxiliary function method for global optimization

A new auxiliary function method based on the idea which executes a two-stage deterministic search for global optimization is proposed. Specifically, a local minimum of the original function is first obtained, and then a stretching function technique is used to modify the objective function with respect to the obtained local minimum. The transformed function stretches the function values higher than the obtained minimum upward while it keeps the ones with lower values unchanged. Next, an auxiliary function is constructed on the stretched function, which always descends in the region where the function values are higher than the obtained minimum, and it has a stationary point in the lower area. We optimize the auxiliary function and use the found stationary point as the starting point to turn to the first step to restart the search. Repeat the procedure until termination. A theoretical analysis is also made. The main feature of the new method is that it relaxes significantly the requirements for the parameters. Numerical experiments on benchmark functions with different dimensions (up to 50) demonstrate that the new algorithm has a more rapid convergence and a higher success rate, and can find the solutions with higher quality, compared with some other existing similar algorithms, which is consistent with the analysis in theory.     

Star-critical Ramsey numbers for large generalized fans and books

In this paper, we show that for any fixed integers $m\ge 2$ and $t\ge 2$, the star-critical Ramsey number $r_1(K_1+n{K}_t,K_{m+1})=(m?1)tn+t$ for all sufficiently large $n$. Furthermore, for any fixed integers $p\ge 2$ and $m\ge 2$, $r_1(K_p+n{K}_1,K_{m+1})=(m?1+o\left(1\right))n$ as $n\to \infty$.     

Sharp bounds for harmonic numbers

In the paper, we collect some inequalities and establish a sharp double inequality for bounding the n-th harmonic number.     

An algorithm for constructing multidimensional continued fractions and linear dependence of numbers

The Güting algorithm for constructing multidimensional continued fractions is considered. It is proved that, in the case of dimension 2, this algorithm can be used to find the coefficients of the linear dependence of numbers; a criterion is given for verifying that the partial quotients furnished by the algorithmare, indeed, elements of the continued fraction for the expanded (generally irrational) numbers.     

A new filled function algorithm for constrained global optimization problems

A new filled function with one parameter is proposed for solving constrained global optimization problems without the coercive condition, in which the filled function contains neither exponential term nor fractional term and is easy to be calculated. A corresponding filled function algorithm is established based on analysis of the properties of the filled function. At last, we perform numerical experiments on some typical test problems using the algorithm and the detailed numerical results show that the algorithm is effective.     

Laws of large numbers for classes of functions

Let (X, , P) be a probability space and _n, n ≥ 1, a sequence of classes of measurable complex-valued functions on (X, , P). Under a weak metric entropy condition on _n and sup {g_∞: g _n}, Glivenko-Cantelli theorems are established for the classes _n with respect to the probability measure P; i.e., lim_{n → ∞} sup_{g n} ∫ g(dP_n − dP) = 0 a.s. The result is applied to kernel density estimation and a law of the logarithm is derived for the maximal deviation between a kernel density estimator and its expected value, improving upon and generalizing the recent results of W. Stute (Ann. Probab. 10 (1982), 414–422). This result is also used to derive improved rates of uniform convergence for the empirical characteristic function.     

基于模拟退火算法的数字岩心建模方法

简要介绍了模拟退火算法,给出了用于建立数字岩心的三个重要参考函数:孔隙度、两点概率函数和线性路径函数.详细阐述了基于模拟退火算法建立数字岩心的理论方法,介绍了算法中重要参数的设置方法,包括初始温度、降温条件、降温方案及运行终止条件.通过实例运算验证了上述理论的适用性,研究表明:模拟退火算法可以有效降低系统能量,在局部范围内能明显体现孔隙空间特征;由于受到输入建模资料所含信息量的限制,所生成的数字岩心孔隙分布较凌乱,整体连通性差,因而期待新的建模参考函数的开发.     

Properties of large prime divisors of numbers of the form p − 1

The main result of this paper is the fact that the fraction of primes p ≤ x satisfying the condition that p ? 1 has a prime divisor q > exp(ln x/ln ln x) and the number of prime divisors of q ? 1 essentially differ from ln ln(x/n), where n = (p ? 1)/q, tends to zero as x increases.     

A new algorithm for decomposition of graphical models

In this paper, we combine Leimer’s algorithm with MCS-M algorithm to decompose graphical models into marginal models on prime blocks. It is shown by experiments that our method has an easier and faster implementation than Leimer’s algorithm.     

A rank-one algorithm for unconstrained function minimization

A rank-one algorithm is presented for unconstrained function minimization. The algorithm is a modified version of Davidon's variance algorithm and incorporates a limited line search. It is shown that the algorithm is a descent algorithm; for quadratic forms, it exhibits finite convergence, in certain cases. Numerical studies indicate that it is considerably superior to both the Davidon-Fletcher-Powell algorithm and the conjugate-gradient algorithm.     

A new parametric method for ranking fuzzy numbers

Ranking fuzzy numbers is important in decision-making, data analysis, artificial intelligence, economic systems and operations research. In this paper, to overcome the limitations of the existing studies and simplify the computational procedures an approach to ranking fuzzy numbers based on α$\alpha$-cuts is proposed. The approach is illustrated by numerical examples, showing that it overcomes several shortcomings such as the indiscriminative and counterintuitive behavior of existing fuzzy ranking approaches.     

两类图的符号控制数

图G的符号控制数γs(G)有着许多重要的应用背景,因而确定其精确值有重要意义.Cm表示m个顶点的圈,n-Cm和n·Cm分别表示恰有一条公共边或一个公共顶点的n个Cm的拷贝.给出了n-Cm和n·Cm的符号控制数.     

Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes

The Linial–Meshulam complex model is a natural higher dimensional analog of the Erd?s–Rényi graph model. In recent years, Linial and Peled established a limit theorem for Betti numbers of Linial–Meshulam complexes with an appropriate scaling of the underlying parameter. The present article aims to extend that result to more general random simplicial complex models. We introduce a class of homogeneous and spatially independent random simplicial complexes, including the Linial–Meshulam complex model and the random clique complex model as special cases, and we study the asymptotic behavior of their Betti numbers. Moreover, we obtain the convergence of the empirical spectral distributions of their Laplacians. A key element in the argument is the local weak convergence of simplicial complexes. Inspired by the work of Linial and Peled, we establish the local weak limit theorem for homogeneous and spatially independent random simplicial complexes.