On the Congruence σ(n)≡1(mod n)

Let k≥2 be an integer,and let σ(n) denote the sum of the positive divisors of an integer n.We call n a quasi-multiperfect number if σ(n)=kn+1.In this paper,we give some necessary properties of them.     

关于同余式$\sigma(n)\equiv 1\pmod n$

Let k ≥ 2 be an integer, and let σ(n) denote the sum of the positive divisors of an integer n. We call n a quasi-multiperfect number if σ(n) = kn + 1. In this paper, we give some necessary properties of them.     

关于同余式$\sigma(n)\equiv 1\pmod n$, II

Let k ≥ 2 be an integer, and let a（n） denote the sum of the positive divisors of an integer n. We call n a quasi-multiperfect number if a（n） = kn ＋ 1. In this paper, we give some necessary properties of quasi-multiperfect numbers with four different prime divisors.     

一类数论函数的性质(Ⅱ)

For any given positive integer n≥1,the Euler functionφ(n) is defined to be the number of positive integers not exceeding n,which is relatively prime to n.ω(n) is defined to be the number of different prime divisors of n.In order to know the solvability of the function ofφ(φ(φ(n)))=2~(ω(n)),properties of the number theoretical functionφ(φ(n)) is studied in the paper.     

On Perfect Less by r-Numbers

A number is called perfect if it is equal to the sum of its divisors. Here we count l as adivisor, but do not count the number itself. For a number n, σ(n) denotes the sum of its di-visors.     

Quasi-periodic solutions with prescribed frequency in a nonlinear Schrdinger equation

In this paper, one-dimensional (1D) nonlinear Schrdinger equation iut-uxx + Mσ u + f ( | u | 2 )u = 0, t, x ∈ R , subject to periodic boundary conditions is considered, where the nonlinearity f is a real analytic function near u = 0 with f (0) = 0, f (0) = 0, and the Floquet multiplier Mσ is defined as Mσe inx = σne inx , with σn = σ, when n 0, otherwise, σn = 0. It is proved that for each given 0 σ 1, and each given integer b 1, the above equation admits a Whitney smooth family of small-amplitude quasi-periodic solutions with b-dimensional Diophantine frequencies, corresponding to b-dimensional invariant tori of an associated infinite-dimensional Hamiltonian system. Moreover, these b-dimensional Diophantine frequencies are the small dilation of a prescribed Diophantine vector. The proof is based on a partial Birkhoff normal form reduction and an improved KAM method.     

Properties of Some Kind of Number Theoretical Function（Ⅱ）

For any given positive integer n ≥ 1, the Euler function φ（n） is defined to be the number of positive integers not exceeding n, which is relatively prime to n. o：（n） is defined to be the number of different prime divisors of n. In order to know the solvability of the function of φ（φ（φ（n））） = 2^ω（n）, properties of the number theoretical function φ（φ（n）） is studied in the paper.     

Maximal Subsemigroups of Finite Transformation Semigroups K（n, r）

Let Tn be the full transformation semigroup on the n-element set Xn. For an arbitrary integer r such that 2 ≤ r ≤ n-1, we completely describe the maximal subsemigroups of the semigroup K(n, r) = {α∈Tn : |im α| ≤ r}. We also formulate the cardinal number of such subsemigroups which is an answer to Problem 46 of Tetrad in 1969, concerning the number of subsemigroups of Tn.     

The smallest degree sum that yields potentially Kr,r-graphic sequences

We consider a variation of a classical Turán-type extremal problem as follows: Determine the smallest even integer σ(Kr,r, n) such that every n-term graphic sequence π = (d1, d2,..., dn) with term sum σ(π) = d1 + d2 +…+ dn ≥σ(Kr,r, n) is potentially Kr,r-graphic, where Kr,r is an r × r complete bipartite graph, i.e. πr has a realization G containing Kr,r as its subgraph. In this paper, the values σ(Kr,r,n) for even r and n ≥ 4r2 - r - 6 and for odd r and n ≥ 4r2 + 3r - 8 are determined.     

ON DISTRIBUTIONAL n-CHAOS

Let(X, f) be a topological dynamical system, where X is a nonempty compact and metrizable space with the metric d and f : X → X is a continuous map. For any integer n ≥ 2, denote the product space by X(n)= X ×× X n times. We say a system(X, f) is generally distributionally n-chaotic if there exists a residual set D ? X(n)such that for any point x =(x1,, xn) ∈ D,lim infk→∞#({i : 0 ≤ i ≤ k- 1, min{d(fi(xj), fi(xl)) : 1 ≤ j = l ≤ n} δ0})k= 0for some real number δ0 0 and lim sup k→∞#({i : 0 ≤ i ≤ k- 1, max{d(fi(xj), fi(xl)) : 1 ≤ j = l ≤ n} δ})k= 1for any real number δ 0, where #() means the cardinality of a set. In this paper, we show that for each integer n ≥ 2, there exists a system(X, σ) which satisfies the following conditions:(1)(X, σ) is transitive;(2)(X, σ) is generally distributionally n-chaotic, but has no distributionally(n + 1)-tuples;(3) the topological entropy of(X, σ) is zero and it has an IT-tuple.     

一个数论函数的倒数和

Let p(n) denote the largest prime factor of an integer n≥2, and let Q(n) denote the largest prime power which divides n≥2. The purpose of this paper is to give asymptotic formula for the sum.     

广义n幂等与超广义n幂等算子

For an integer n≥2,we say that an operator A is an n-idempotent ifA~n=A;A is a generalized n-idempotent if A~n=A~*;A is a hyper-generalized n-iclempotent if A~n=A~ .The set of all n-idempotents,all generalized n-idempotentsand all hyper-generalized n-idempotents are denoted by I_n(H),GI_n(H)andHGI_n(H),respectively.In this note,we obtain a chain of proper inclusionsGI_n(H)HGI_n(H)I_(n 2)(H).     

SO(n)-Invariant Special Lagrangian Submanifolds of C~(n 1) with Fixed Loci

Let SO(n) act in the standard way on Cn and extend this action in the usual way to Cn 1 =C Cn. It is shown that a nonsingular special Lagrangian submanifold L (?) Cn 1 that is invariant under this SO(n)-action intersects the fixed C (?) Cn 1 in a nonsingular real-analytic arc A (which may be empty). If n > 2, then A has no compact component. Conversely, an embedded, noncompact nonsingular real-analytic arc A(?)C lies in an embedded nonsingular special Lagrangian submanifold that is SO(n)-invariant. The same existence result holds for compact A if n = 2. If A is connected, there exist n distinct nonsingular SO(n)-invariant special Lagrangian extensions of A such that any embedded nonsingular SO(n)-invariant special Lagrangian extension of A agrees with one of these n extensions in some open neighborhood of A. The method employed is an analysis of a singular nonlinear pde and ultimately calls on the work of Gerard and Tahara to prove the existence of the extension.     

Cubic one-regular graphs of order twice a square-free integer

A graph is one-regular if its automorphism group acts regularly on the set of its arcs.Let n be a square-free integer.In this paper,we show that a cubic one-regular graph of order 2n exists if and only if n=3~tp1p2…p_s≥13,where t≤1,s≥1 and p_i's are distinct primes such that 3|(P_i—1). For such an integer n,there are 2~(s-1) non-isomorphic cubic one-regular graphs of order 2n,which are all Cayley graphs on the dihedral group of order 2n.As a result,no cubic one-regular graphs of order 4 times an odd square-free integer exist.     

A SIMPLICIAL ALGORITHM FOR COMPUTING AN INTEGER ZERO POINT OF A MAPPING WITH THE DIRECTION PRESERVING PROPERTY

A mapping f:Z~n→R~n is said to possess the direction preserving property if fi(x)>0implies fi(y)≥0 for any integer points x and y with ‖x-y‖∞≤1.In this paper,a simplicial algorithm is developed for computing an integer zero point of a mappingwith the direction preserving property.We assume that there is an integer point x~0 withc≤x~0≤d satisfying that max_(1≤i≤n)(x_i-x_i~0)fi(x)>0 for any integer point x withf(x)≠0 on the boundary of H={x∈R~n|c-e≤x≤d e},where c and d are twofinite integer points with c≤d and e=(1,1,…1)~∈R~n.This assumption is impliedby one of two conditions for the existence of an integer zero point of a mapping with thepreserving property in van der Laan et al.(2004).Under this assumption, starting at x~0,the algorithm follows a finite simplicial path and terminates at an integer zero point ofthe mapping.This result has applications in general economic equilibrium models withindivisible commodities.     

Ramsey Number r(C_(2m 1), K_n) With Large n

This is an announcement that r(C2m 1, Kn) ＜ c(m) ( ) 1/m has been proved.The Ramsey number r(H, Kn) is the smallest integer N such that every H-free graph onN vertices has independence number at least n. The study of Ramsey number r(Ck, Kn) wasinitiated by Bondy and Erd s[2]. They proved that for any fixed n, r(Ck, Kn) = (k - 1)(n - 1) 1if k n2 - 1, and r(Ck, Kn) kn2. For fixed k 3, it is difficult to obtain a satisfied bound ofr(Ck, Kn) for n → ∞ . The bound of Bondy and Erd s w…     

The Threshold for the Erdos, Jacobson and Lehel Conjecture to Be True

Let σ（k, n） be the smallest even integer such that each n-term positive graphic sequence with term sum at least σ（k, n） can be realized by a graph containing a clique of k ＋ 1 vertices. Erdos et al. （Graph Theory, 1991, 439-449） conjectured that σ（k, n） = （k - 1）（2n- k） ＋ 2. Li et al. （Science in China, 1998, 510-520） proved that the conjecture is true for k 〉 5 and n ≥ （k2） ＋ 3, and raised the problem of determining the smallest integer N（k） such that the conjecture holds for n ≥ N（k）. They also determined the values of N（k） for 2 ≤ k ≤ 7, and proved that [5k-1/2] ≤ N（k） ≤ （k2） ＋ 3 for k ≥ 8. In this paper, we determine the exact values of σ（k, n） for n ≥ 2k＋3 and k ≥ 6. Therefore, the problem of determining σ（k, n） is completely solved. In addition, we prove as a corollary that N（k） -= [5k-1/2] for k ≥6.     

Fast algorithms for determining the linear complexities of sequences over GF(p~m) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p-1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(pm)(any positive integer m) with the period 3n (n and pm - 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-lmamura algorithm, we can determine the linear complexity of any sequence over GF(pm) with the period 3n (n and pm - 1 are coprime) more efficiently.     

P_(4k-1)-factorization of bipartite multigraphs

LetλKm,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A Pν-factorization ofλKm,n is a set of edge-disjoint Pν-factors ofλKm,n which partition the set of edges ofλKm,n. Whenνis an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a Pν-factorization ofλKm,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true forν= 3. In this paper we will show that the conjecture is true whenν= 4k-1. That is, we shall prove that a necessary and sufficient condition for the existence of a P4k-1-factorization ofλKm,n is (1) (2k-1)m≤2kn, (2) (2k-1)n≤2km, (3)m n = 0 (mod 4k-1), (4)λ(4k-1)mn/[2(2k-1)(m n)] is an integer.     

Graphic sequences with a realization containing intersecting cliques

Let r≥ 1, k≥ 2 and Fm1 ,...,mki;r denote the most general definition of a friendship graph, that is, the graph of Kr+m1 , . . . , Kr+mk meeting in a common r set, where Kr+mi is the complete graph on r + mi vertices. Clearly, | Fm1 ,...,mki;r | = m1+ ··· + mk + r. Let σ(Fm1 ,...,mki;r , n) be the smallest even integer such that every n-term graphic sequence π = (d1, d2, . . . , dn) with term sum σ(π) = d1 + d2 + ··· + dn ≥σ(Fm1 ,...,mki;r,n) has a realization G containing Fm1 ,...,mki;r as a subgraph. In this paper, we determine σ(Fm1 ,...,mki;r,n) for n sufficiently large.