Certain series attached to an even number of elliptic modular forms

For j=1,…,n let f_j(z) and g_j(z) be holomorphic modular forms for such that f_j(z)g_j(z) is a cusp form. We define a series

     

Exact sequences for the homology of the matching complex

Building on work by Bouc and by Shareshian and Wachs, we provide a toolbox of long exact sequences for the reduced simplicial homology of the matching complex Mn, which is the simplicial complex of matchings in the complete graph Kn. Combining these sequences in different ways, we prove several results about the 3-torsion part of the homology of Mn. First, we demonstrate that there is nonvanishing 3-torsion in whenever , where . By results due to Bouc and to Shareshian and Wachs, is a nontrivial elementary 3-group for almost all n and the bottom nonvanishing homology group of Mn for all n≠2. Second, we prove that is a nontrivial 3-group whenever . Third, for each k?0, we show that there is a polynomial fk(r) of degree 3k such that the dimension of , viewed as a vector space over Z₃, is at most fk(r) for all r?k+2.     

Colouring games on outerplanar graphs and trees

Let f be a graph function which assigns to each graph H a non-negative integer f(H)≤|V(H)|. The f-game chromatic number of a graph G is defined through a two-person game. Let X be a set of colours. Two players, Alice and Bob, take turns colouring the vertices of G with colours from X. A partial colouring c of G is legal (with respect to graph function f) if for any subgraph H of G, the sum of the number of colours used in H and the number of uncoloured vertices of H is at least f(H). Both Alice and Bob must colour legally (i.e., the partial colouring produced needs to be legal). The game ends if either all the vertices are coloured or there are uncoloured vertices with no legal colour. In the former case, Alice wins the game. In the latter case, Bob wins the game. The f-game chromatic number of G, χ_g(f,G), is the least number of colours that the colour set X needs to contain so that Alice has a winning strategy. Let be the graph function defined as , for any n≥3 and otherwise. Then is called the acyclic game chromatic number of G. In this paper, we prove that any outerplanar graph G has acyclic game chromatic number at most 7. For any integer k, let ?_k be the graph function defined as ?_k(K₂)=2 and ?_k(P_k)=3 (P_k is the path on k vertices) and ?_k(H)=0 otherwise. This paper proves that if k≥8 then for any tree T, χ_g(?_k,T)≤9. On the other hand, if k≤6, then for any integer n, there is a tree T such that χ_g(?_k,T)≥n.     

Weighted-Hardy functions with Hadamard gaps on the unit ball

We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying n_k+1/n_k?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that lim_r→1(1-r²)^α‖Rf_r‖_p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)].     

On the oscillations of multiplicative functions taking values ±1

For multiplicative functions f(n), which take on the values ±1, we show that under certain conditions on f(n), for all x sufficiently large, there are at least values of n?x for which f(n(n+1))=−1.     

A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

A non-linear structure preserving matrix method for the computation of a structured low rank approximation of the Sylvester resultant matrix S(f,g) of two inexact polynomials f=f(y) and g=g(y) is considered in this paper. It is shown that considerably improved results are obtained when f(y) and g(y) are processed prior to the computation of , and that these preprocessing operations introduce two parameters. These parameters can either be held constant during the computation of , which leads to a linear structure preserving matrix method, or they can be incremented during the computation of , which leads to a non-linear structure preserving matrix method. It is shown that the non-linear method yields a better structured low rank approximation of S(f,g) and that the assignment of f(y) and g(y) is important because may be a good structured low rank approximation of S(f,g), but may be a poor structured low rank approximation of S(g,f) because its numerical rank is not defined. Examples that illustrate the differences between the linear and non-linear structure preserving matrix methods, and the importance of the assignment of f(y) and g(y), are shown.     

Growth theorems and coefficient bounds for univalent holomorphic mappings which have parametric representation

Let B be the unit ball in Cn with respect to an arbitrary norm and let f(z,t) be a g-Loewner chain such that e−tf(z,t)−z has a zero of order k+1 at z=0. In this paper, we obtain growth and covering theorems for . Moreover, we consider coefficient bounds and examples of mappings in .     

Preservers of spectral radius, numerical radius, or spectral norm of the sum on nonnegative matrices

Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form

     

Global attractors for p-Laplacian equation

The existence of a -global attractor is proved for the p-Laplacian equation ut−div(|∇u|^p−2∇u)+f(u)=g on a bounded domain Ω⊂Rn(n?3) with Dirichlet boundary condition, where p?2. The nonlinear term f is supposed to satisfy the polynomial growth condition of arbitrary order c₁q|u|−k?f(u)u?c₂q|u|+k and f^′(u)?−l, where q?2 is arbitrary. There is no other restriction on p and q. The asymptotic compactness of the corresponding semigroup is proved by using a new a priori estimate method, called asymptotic a priori estimate.     

Diameters of uniform subset graphs

Let r,s be positive integers with r>s, k a nonnegative integer, and n=2r−s+k. A uniform subset graph G(n,r,s) is a graph with vertex set [n]^r and where two r-subsets A,B∈[n]^r are adjacent if and only if |A∩B|=s. Let denote the diameter of a graph G.In this paper, we prove the following results: (1) If k>0, then if r≥2s+k+2, 2 if k≥s and 2s≤r≤s+k, or k<s and s+k≤r≤2s, and 3 otherwise; (2) If k=0, then . This generalizes a result in [M. Valencia-Pabon, J.-C. Vera, On the diameter of Kneser graphs, Discrete Math. 305 (2005) 383-385].     

Transcendence of certain infinite products

We prove the transcendence results for the infinite product , where Ek(x), Fk(x) are polynomials, α is an algebraic number, and r?2 is an integer. As applications, we give necessary and sufficient conditions for transcendence of and , where Fn and Ln are Fibonacci numbers and Lucas numbers respectively, and {ak}_k?0 is a sequence of algebraic numbers with log‖ak‖=o(rk).     

Linear pencils on real algebraic curves

Our knowledge of linear series on real algebraic curves is still very incomplete. In this paper we restrict to pencils (complete linear series of dimension one). Let X denote a real curve of genus g with real points and let k(R) be the smallest degree of a pencil on X (the real gonality of X). Then we can find on X a base point free pencil of degree g+1 (resp. g if X is not hyperelliptic, i.e. if k(R)>2) with an assigned geometric behaviour w.r.t. the real components of X, and if we prove that which is the same bound as for the gonality of a complex curve of even genus g. Furthermore, if the complexification of X is a k-gonal curve (k≥2) one knows that k≤k(R)≤2k−2, and we show that for any two integers k≥2 and 0≤n≤k−2 there is a real curve with real points and k-gonal complexification such that its real gonality is k+n.     

The number of reachable pairs in a digraph

For a digraph G, let R(G) (respectively, R^(k)(G)) be the number of ordered pairs (u,v) of vertices of G such that u≠v and v is reachable from u (respectively, reachable from u by a path of length ?k). In this paper, we study the range S_n of R(G) and the range of R^(k)(G) as G varies over all possible digraphs on n vertices. We give a sufficient condition and a necessary condition for an integer to belong to S_n. These determine the set S_n for all n?208. We also determine for k?4 and show that whenever n?k+(k+1)^0.57+2, for arbitrary k.     

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

A bijection is presented between (1): partitions with conditions f_j+f_j+1≤k−1 and f₁≤i−1, where f_j is the frequency of the part j in the partition, and (2): sets of k−1 ordered partitions (n⁽¹⁾,n⁽²⁾,…,n^(k−1)) such that and , where m_j is the number of parts in n^(j). This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the k−1 ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud’s version of the Burge correspondence.     

On the average orders of the error term in the Dirichlet divisor problem

Let Δ(x) be the error term in the Dirichlet divisor problem. The purpose of this paper is to study the difference between two kinds of mean value formulas of Δ(x), that is, the mean value formulas and ∑_n?xΔ(n)^k with a natural number k. In particular we study the case k=2 and 3 in detail.     

Universal factorization property of certain polycyclic groups

Let H be a torsion-free strongly polycyclic (torsion-free virtually polycyclic, resp.) group. Let G be any group with maximal condition. We show that there exists a torsion-free strongly polycyclic (torsion-free virtually polycyclic, resp.) group and an epimorphism such that for any homomorphism ?:G→H, it factors through , i.e., there exists a homomorphism such that . We show that this factorization property cannot be extended to any finitely generated group G. As an application of factorization, we give necessary and sufficient conditions for N(f,g)=R(f,g) to hold for maps f,g:X→Y between closed orientable n-manifolds where π₁(X) has the maximal condition, Y is an infra-solvmanifold, N(f,g) and R(f,g) denote the Nielsen and Reidemeister coincidence numbers, respectively.     

Vertex-transitive self-complementary uniform hypergraphs of prime order

For an integer n and a prime p, let . In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that for every prime p, where ?=max{k₍₂₎,(k−1)₍₂₎}, and consequently we prove that the necessary conditions on the order of vertex-transitive self-complementary uniform hypergraphs of rank k=2^? or k=2^?+1 due to Potoňick and Šajna are sufficient. In addition, we use Burnside’s characterization of transitive groups of prime degree to characterize the structure of vertex-transitive self-complementary k-hypergraphs which have prime order p in the case where k=2^? or k=2^?+1 and , and we present an algorithm to generate all of these structures. We obtain a bound on the number of distinct vertex-transitive self-complementary graphs of prime order , up to isomorphism.     

On deviations and strong asymptotic functions of meromorphic functions of finite lower order

Let f be a transcendental meromorphic function of finite lower order with N(r,f)=S(r,f), and let qν be distinct rational functions, 1?ν?k. For 0<γ<∞ put