Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums

Let s=(s₁,…,s_m) and t=(t₁,…,t_n) be vectors of non-negative integer-valued functions with equal sum . Let N(s,t) be the number of m×n matrices with entries from {0,1} such that the ith row has row sum s_i and the jth column has column sum t_j. Equivalently, N(s,t) is the number of labelled bipartite graphs with degrees of the vertices in one side of the bipartition given by s and the degrees of the vertices in the other side given by t. We give an asymptotic formula for N(s,t) which holds when S→∞ with 1?st=o(S^2/3), where and . This extends a result of McKay and Wang [Linear Algebra Appl. 373 (2003) 273-288] for the semiregular case (when s_i=s for 1?i?m and t_j=t for 1?j?n). The previously strongest result for the non-semiregular case required 1?max{s,t}=o(S^1/4), due to McKay [Enumeration and Design, Academic Press, Canada, 1984, pp. 225-238].     

On the dimension of trees

We consider isometric embedding of trees into the infinite graph Z_m whose vertices are the m-dimensional lattice points where two vertices a=(a₁,a₂,…,a_m) and b=(b₁,b₂,…,b_m) are adjacent if and only if |a_i-b_i|?1 for 1?i?m. Linial, London, and Rabinovich have shown that this can be done with , where t is the number of leaves. In this note, we sketch a proof that .     

Quantum effects, sequential independence and majorization

A quantum effect is a positive Hilbert space contraction operator. If {E_i}, 1?i?n, are n quantum effects (defined on some Hilbert space H), then their sequential product is the operator . It is proved that the quantum effects {E_i}, 1?i?n, are sequentially independent if and only if for every permutation r₁r₂…r_n of the set S_n={1,2,…,n}. The sequential independence of the effects E_i, 1?i?n, implies E_noE_n-1o…oE_j+1oE_jo…oE₁=(E_noE_n-1o…E_j+1)oE_jo…oE₁ for every 1?j?n. It is proved that if there exists an effect E_j, 1?j?n, such that E_j?(E_noE_n-1o…E_j+1)oE_jo…oE₁, then the effects {E_i} are sequentially independent and satisfy .     

Likelihood ratio orderings of spacings of heterogeneous exponential random variables

Let X₁,X₂,…,X_n be independent exponential random variables such that X_i has failure rate λ for i=1,…,p and X_j has failure rate λ^* for j=p+1,…,n, where p≥1 and q=n-p≥1. Denote by D_i:n(p,q)=X_i:n-X_i-1:n the ith spacing of the order statistics , where X_0:n≡0. It is shown that D_i:n(p,q)?_lrD_i+1:n(p,q) for i=1,…,n-1, and that if λ?λ^* then , and for i=1,…,n, where ?_lr denotes the likelihood ratio order. The main results are used to establish the dispersive orderings between spacings.     

Davenport constant with weights and some related questions, II

Let G be a finite abelian group of order n and let A⊆Z be non-empty. Generalizing a well-known constant, we define the Davenport constant of G with weight A, denoted by DA(G), to be the least natural number k such that for any sequence (x₁,…,xk) with xi∈G, there exists a non-empty subsequence (xj₁,…,xjl) and a₁,…,al∈A such that . Similarly, for any such set A, EA(G) is defined to be the least t∈N such that for all sequences (x₁,…,xt) with xi∈G, there exist indices j₁,…,jn∈N,1?j₁<?<jn?t, and ?₁,…,?n∈A with . In the present paper, we establish a relation between the constants DA(G) and EA(G) under certain conditions. Our definitions are compatible with the previous generalizations for the particular group G=Z/nZ and the relation we establish had been conjectured in that particular case.     

A simple proof for a theorem of Luxemburg and Zaanen

In this paper a simple proof for the following theorem, due to Luxemburg and Zaanen is given: an Archimedean vector lattice A is Dedekind σ-complete if and only if A has the principal projection property and A is uniformly complete. As an application, we give a new and short proof for the following version of Freudenthal's spectral theorem: let A be a uniformly complete vector lattice with the principal projection property and let 0<u∈A. For any element w in A such that 0?w?u there exists a sequence in A which satisfies , where each element sn is of the form , with real numbers α₁,…,αk such that 0?αi?1 (i=1,…,k) and mutually disjoint components p₁,…,pk of u.     

Divisors of the number of Latin rectangles

A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)^k−1(k−1)!)ⁿ⁻¹. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n.     

Spanning multi-paths in hypercubes

A set A of vertices of a hypercube is called balanced if . We prove that for every natural number n there exists a natural number π₁(n) such that for every hypercube Q with dim(Q)?π₁(n) there exists a family of pairwise vertex-disjoint paths P_i between A_i and B_i for i=1,2,…,n with if and only if {A_i,B_i∣i=1,2,…,n} is a balanced set.     

On the prime power factorization of n!

In this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory 74 (1999) 307) to show that for fixed primes p₁,…,p_k, and for fixed integers m₁,…,m_k, with , the numbers (e_p1(n),…,e_pk(n)) are uniformly distributed modulo (m₁,…,m_k), where e_p(n) is the order of the prime p in the factorization of n!. That implies one of Sander's conjectures from Sander (J. Number Theory 90 (2001) 316) for any set of odd primes. Berend (J. Number Theory 64 (1997) 13) asks to find the fastest growing function f(x) so that for large x and any given finite sequence , there exists n<x such that the congruences hold for all i?f(x). Here, p_i is the ith prime number. In our second result, we are able to show that f(x) can be taken to be at least , with some absolute constant c₁, provided that only the first odd prime numbers are involved.     

Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs

In this paper, we classify the reflexible regular orientable embeddings and the self-Petrie dual regular orientable embeddings of complete bipartite graphs. The classification shows that for any natural number n, say (p₁,p₂,…,p_k are distinct odd primes and a_i>0 for each i?1), there are t distinct reflexible regular embeddings of the complete bipartite graph K_n,n up to isomorphism, where t=1 if a=0, t=2^k if a=1, t=2^k+1 if a=2, and t=3·2^k+1 if a?3. And, there are s distinct self-Petrie dual regular embeddings of K_n,n up to isomorphism, where s=1 if a=0, s=2^k if a=1, s=2^k+1 if a=2, and s=2^k+2 if a?3.     

Multivariate matching polynomials of cyclically labelled graphs

We consider the matching polynomials of graphs whose edges have been cyclically labelled with the ordered set of t labels {x₁,…,x_t}.We first work with the cyclically labelled path, with first edge label x_i, followed by N full cycles of labels {x₁,…,x_t}, and last edge label x_j. Let Φ_i,Nt+j denote the matching polynomial of this path. It satisfies the (τ,Δ)-recurrence: , where τ is the sum of all non-consecutive cyclic monomials in the variables {x₁,…,x_t} and . A combinatorial/algebraic proof and a matrix proof of this fact are given. Let G_N denote the first fundamental solution to the (τ,Δ)-recurrence. We express G_N (i) as a cyclic binomial using the symmetric representation of a matrix, (ii) in terms of Chebyshev polynomials of the second kind in the variables τ and Δ, and (iii) as a quotient of two matching polynomials. We extend our results from paths to cycles and rooted trees.     

The Erd?s-Ginzburg-Ziv theorem for finite solvable groups

Let G be a non-cyclic finite solvable group of order n, and let S=(g₁,…,g_k) be a sequence of k elements (repetition allowed) in G. In this paper we prove that if , then there exist some distinct indices i₁,i₂,…,i_n such that the product g_i1g_i2?g_in=1. This result substantially improves the Erd?s-Ginzburg-Ziv theorem and other existing results.     

Asymptotic enumeration of dense 0-1 matrices with specified line sums

Let s=(s₁,s₂,…,sm) and t=(t₁,t₂,…,tn) be vectors of non-negative integers with . Let B(s,t) be the number of m×n matrices over {0,1} with jth row sum equal to sj for 1?j?m and kth column sum equal to tk for 1?k?n. Equivalently, B(s,t) is the number of bipartite graphs with m vertices in one part with degrees given by s, and n vertices in the other part with degrees given by t. Most research on the asymptotics of B(s,t) has focused on the sparse case, where the best result is that of Greenhill, McKay and Wang (2006). In the case of dense matrices, the only precise result is for the case of equal row sums and equal column sums (Canfield and McKay, 2005). This paper extends the analytic methods used by the latter paper to the case where the row and column sums can vary within certain limits. Interestingly, the result can be expressed by the same formula which holds in the sparse case.     

Non-simultaneous blow-up of n components for nonlinear parabolic systems

This paper deals with non-simultaneous and simultaneous blow-up for radially symmetric solution (u₁,u₂,…,un) to heat equations coupled via nonlinear boundary (i=1,2,…,n). It is proved that there exist suitable initial data such that ui(i∈{1,2,…,n}) blows up alone if and only if qi+1<pi. All of the classifications on the existence of only two components blowing up simultaneously are obtained. We find that different positions (different values of k, i, n) of ui−k and ui leads to quite different blow-up rates. It is interesting that different initial data lead to different blow-up phenomena even with the same requirements on exponent parameters. We also propose that ui−k,ui−k+1,…,ui blow up simultaneously while the other ones remain bounded in different exponent regions. Moreover, the blow-up rates and blow-up sets are obtained.     

On root arrangements for hyperbolic polynomial-like functions and their derivatives

A real polynomial P of degree n in one real variable is hyperbolic if its roots are all real. A real-valued function P is called a hyperbolic polynomial-like function (HPLF) of degree n if it has n real zeros and P(n) vanishes nowhere. Denote by the roots of P(i), k=1,…,n−i, i=0,…,n−1. Then in the absence of any equality of the form one has ∀i<j, (the Rolle theorem). For n?4 (resp. for n?5) not all arrangements without equalities (∗) of n(n+1)/2 real numbers and compatible with (∗∗) (we call them admissible) are realizable by the roots of hyperbolic polynomials (resp. of HPLFs) of degree n and of their derivatives. For n=5 we show that from 286 admissible arrangements, exactly 236 are realizable by HPLFs; from these 236 arrangements, 116 are realizable by hyperbolic polynomials and 24 by perturbations of such.     

Graham’s pebbling conjecture on product of thorn graphs of complete graphs

The pebbling number of a graph G, f(G), is the least n such that, no matter how n pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of pebbling moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. Let p₁,p₂,…,p_n be positive integers and G be such a graph, V(G)=n. The thorn graph of the graph G, with parameters p₁,p₂,…,p_n, is obtained by attaching p_i new vertices of degree 1 to the vertex u_i of the graph G, i=1,2,…,n. Graham conjectured that for any connected graphs G and H, f(G×H)≤f(G)f(H). We show that Graham’s conjecture holds true for a thorn graph of the complete graph with every by a graph with the two-pebbling property. As a corollary, Graham’s conjecture holds when G and H are the thorn graphs of the complete graphs with every .     

Singular values, norms, and commutators

Let and X_i, i=1,…,n, be bounded linear operators on a separable Hilbert space such that X_i is compact for i=1,…,n. It is shown that the singular values of are dominated by those of , where ‖·‖ is the usual operator norm. Among other applications of this inequality, we prove that if A and B are self-adjoint operators such that a₁?A?a₂ and b₁?B?b₂ for some real numbers and b₂, and if X is compact, then the singular values of the generalized commutator AX-XB are dominated by those of max(b₂-a₁,a₂-b₁)(X⊕X). This inequality proves a recent conjecture concerning the singular values of commutators. Several inequalities for norms of commutators are also given.     

Unextendible product bases and 1-factorization of complete graphs

Let f(k₁,…,k_m) be the minimal value of size of all possible unextendible product bases in the tensor product space . We have trivial lower bounds and upper bound k₁?k_m. Alon and Lovász determined all cases such that f(k₁,…,k_m)=n(k₁,…,k_m). In this paper we determine all cases such that f(k₁,…,k_m)=k₁?k_m by presenting a sharper upper bound. We also determine several cases such that f(k₁,…,k_m)=n(k₁,…,k_m)+1 by using a result on 1-factorization of complete graphs.     

Toppling kings in multipartite tournaments by introducing new kings

Let and be two n-tuples of nonnegative integers. An all-4-kings n-partite tournament T(V₁,V₂,…V_n) is said to have a -property if there exists an n-partite tournament T₁(W₁,W₂,…,W_n) such that for each i∈{1,…,n}:

(1)

V_i⊆W_i;

(2)

exactly t_i 4-kings of V_i are not 4-kings in T₁;

(3)

exactly c_i 4-kings of W_i are not vertices of V_i.

We describe all pairs such that there exists an n-partite tournament having -property.