Surfaces with surjective endomorphisms of any given degree

We present a complete classification of complex projective surfaces X with nontrivial self-maps (i.e. surjective morphisms f:X→X which are not isomorphisms) of any given degree. Our starting point are results contained in Fujimoto (Publ. Res. Inst. Math. Sci. 38(1):33–92, 2005) and Nakayama (Kyushu J. Math. 56(2):433–446, 2002), they provide a list of surfaces that admit at least one nontrivial self-map. By a case by case analysis that blends geometrical and arithmetical arguments, we then exclude that certain prime numbers appear as degrees of nontrivial self-maps of certain surfaces.     

Large bipartite graphs with given degree and diameter

We give constructions of bipartite graphs with maximum Δ, diameter D on B vertices, such that for every D ≥ 2 the lim inf_Δ→∞B. Δ^1-D = b_D > 0. We also improve similar results on ordinary graphs, for example, we prove that lim_Δ→∞N · Δ^?D = 1 if D is 3 or 5. This is a partial answer to a problem of Bollobás.     

Some large graphs with given degree and diameter

This paper considers the (Δ, D) problem: to maximize the order of graphs with given maximum degree Δ and diameter D, of importance for its implications in the design of interconnection networks. Two cubic graphs of diameters 5 and 8 and orders 70 and 286, respectively, and a graph of degree 5, diameter 3 and order 66 are presented, which improve the previously known orders for these values of Δ and D. By its construction, these graphs have a large automorphism group.     

Diameter of orientations of graphs with given minimum degree

We show that every bridgeless graph of order $n$ and minimum degree $\delta$ has a strongly connected orientation of diameter at most $\frac{11}{\delta +1}n+9$, and such an orientation can be found in polynomial time.     

具有一定消失矩的优化线性相位滤波器

利用消失矩特性和编码误差最小,给出了一类有限长线性相位的双正交小波滤波器组BNVF的构造方法,BNVF的综合低通和分解高通的系数为二进分数,将其用于图像的分解与重构时,可避免一些乘法运算．三组BNVF用于图像变换编码时,其压缩性能不亚于Cohen,Daubechies等构造的9／7步滤波器组CDF-9／7,且计算复杂度更低．     

Large graphs with given degree and diameter. II

The following problem arises in the study of interconnection networks: find graphs of given maximum degree and diameter having the maximum number of vertices. Constructions based on a new product of graphs, which enable us to construct graphs of given maximum degree and diameter, having a great number of vertices from smaller ones are given; therefore the best values known before are improved considerably.     

Disjoint Kr-minors in large graphs with given average degree

It is proved that there are functions f(r) and N(r,s) such that for every positive integer r, s, each graph G with average degree d(G)=2|E(G)|/|V(G)|≥f(r), and with at least N(r,s) vertices has a minor isomorphic to K_r,s or to the union of s disjoint copies of K_r.     

The asymptotic number of labeled graphs with given degree sequences

Asymptotics are obtained for the number of n × n symmetric non-negative integer matrices subject to the following constraints: (i) each row sum is specified and bounded, (ii) the entries are bounded, and (iii) a specified “sparse” set of entries must be zero. The result can be interpreted in terms of incidence matrices for labeled graphs.     

On Ramsey numbers of uniform hypergraphs with given maximum degree

For every ?>0 and every positive integers Δ and r, there exists C=C(?,Δ,r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V(H)|^1+?.     

Nonlinearities of S-boxes

We introduce an indicator of the non-balancedness of functions defined over Abelian groups, and deduce a new indicator, denoted by NB, of the nonlinearity of such functions. We prove an inequality relating NB and the classical indicator NL, introduced by Nyberg and studied by Chabaud and Vaudenay, of the nonlinearity of S-boxes. This inequality results in an upper bound on NL which unifies Sidelnikov–Chabaud–Vaudenay's bound and the covering radius bound. We also deduce from bounds on linear codes three new bounds on NL that improve upon Sidelnikov–Chabaud–Vaudenay's bound and the covering radius bound in many cases.     

The signless Laplacian spectral radius of graphs with given degree sequences

In this paper, we investigate the properties of the largest signless Laplacian spectral radius in the set of all simple connected graphs with a given degree sequence. These results are used to characterize the unicyclic graphs that have the largest signless Laplacian spectral radius for a given unicyclic graphic degree sequence. Moreover, all extremal unicyclic graphs having the largest signless Laplacian spectral radius are obtained in the sets of all unicyclic graphs of order n with a specified number of leaves or maximum degree or independence number or matching number.