Centers for a 6-parameter family of polynomial vector fields of arbitrary degree

For all non-negative integers n₁,n₂,n₃,j₁,j₂ and j₃ with nk+jk>1 for k=1,2,3, (nk,jk)≠(nl,jl) if k≠l, j₃=n₃−1 and jk≠nk−1 for k=1,2, we study the center variety of the 6-parameter family of real planar polynomial vector given, in complex notation, by , where z=x+iy and A,B,C∈C\{0}.     

Erd?s-Ko-Rado for three sets

Fix integers k?3 and n?3k/2. Let F be a family of k-sets of an n-element set so that whenever A,B,C∈F satisfy |A∪B∪C|?2k, we have A∩B∩C≠∅. We prove that with equality only when ?_F∈FF≠∅. This settles a conjecture of Frankl and Füredi [2], who proved the result for n?k²+3k.     

The maximum size of hypergraphs without generalized 4-cycles

Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not contain four distinct edges A, B, C, D with A∪B=C∪D and A∩B=C∩D=∅. This problem was stated by Erd?s [P. Erd?s, Problems and results in combinatorial analysis, Congr. Numer. 19 (1977) 3-12]. It can be viewed as a generalization of the Turán problem for the 4-cycle to hypergraphs.Let . Füredi [Z. Füredi, Hypergraphs in which all disjoint pairs have distinct unions, Combinatorica 4 (1984) 161-168] observed that ?r?1 and conjectured that this is equality for every r?3. The best known upper bound ?r?3 was proved by Mubayi and Verstraëte [D. Mubayi, J. Verstraëte, A hypergraph extension of the bipartite Turán problem, J. Combin. Theory Ser. A 106 (2004) 237-253]. Here we improve this bound. Namely, we show that for every r?3, and ?₃?13/9. In particular, it follows that ?r→1 as r→∞.     

A note on short cycles in a hypercube

How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erd?s about 27 years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still unresolved. Let f(n,C_l) be the largest number of edges in a subgraph of a hypercube Q_n containing no cycle of length l. It is known that f(n,C_l)=o(|E(Q_n)|), when l=4k, k?2 and that . It is an open question to determine f(n,C_l) for l=4k+2, k?2. Here, we give a general upper bound for f(n,C_l) when l=4k+2 and provide a coloring of E(Q_n) by four colors containing no induced monochromatic C₁₀.     

A new short proof of a theorem of Ahlswede and Khachatrian

Ahlswede and Khachatrian [R. Ahlswede, L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121-138] proved the following theorem, which answered a question of Frankl and Füredi [P. Frankl, Z. Füredi, Nontrivial intersecting families, J. Combin. Theory Ser. A 41 (1986) 150-153]. Let 2?t+1?k?2t+1 and n?(t+1)(k−t+1). Suppose that F is a family of k-subsets of an n-set, every two of which have at least t common elements. If |_?F∈FF|<t, then , and this is best possible. We give a new, short proof of this result. The proof in [R. Ahlswede, L.H. Khachatrian, The complete nontrivial-intersection theorem for systems of finite sets, J. Combin. Theory Ser. A 76 (1996) 121-138] requires the entire machinery of the proof of the complete intersection theorem, while our proof uses only ordinary compression and an earlier result of Wilson [R.M. Wilson, The exact bound in the Erd?s-Ko-Rado theorem, Combinatorica 4 (1984) 247-257].     

Note on robust critical graphs with large odd girth

A graph G is (k+1)-critical if it is not k-colourable but G−e is k-colourable for any edge e∈E(G). In this paper we show that for any integers k≥3 and l≥5 there exists a constant c=c(k,l)>0, such that for all , there exists a (k+1)-critical graph G on n vertices with and odd girth at least ?, which can be made (k−1)-colourable only by the omission of at least cn² edges.     

Cells in hyperspaces

Let C(X) denote the hyperspace of subcontinua of a continuum X. For A∈C(X), define the hyperspace . Let k∈N, k?2. We prove that A is contained in the core of a k-od if and only if C(A,X) contains a k-cell.     

An intersection theorem for four sets

Fix integers n,r?4 and let F denote a family of r-sets of an n-element set. Suppose that for every four distinct A,B,C,D∈F with |A∪B∪C∪D|?2r, we have A∩B∩C∩D≠∅. We prove that for n sufficiently large, , with equality only if _?F∈FF≠∅. This is closely related to a problem of Katona and a result of Frankl and Füredi [P. Frankl, Z. Füredi, A new generalization of the Erd?s-Ko-Rado theorem, Combinatorica 3 (3-4) (1983) 341-349], who proved a similar statement for three sets. It has been conjectured by the author [D. Mubayi, Erd?s-Ko-Rado for three sets, J. Combin. Theory Ser. A, 113 (3) (2006) 547-550] that the same result holds for d sets (instead of just four), where d?r, and for all n?dr/(d−1). This exact result is obtained by first proving a stability result, namely that if |F| is close to then F is close to satisfying _?F∈FF≠∅. The stability theorem is analogous to, and motivated by the fundamental result of Erd?s and Simonovits for graphs.     

Some moduli stacks of symplectic bundles on a curve are rational

Let C be a smooth projective curve of genus g?2 over a field k. Given a line bundle L on C, let Sympl2n,L be the moduli stack of vector bundles E of rank 2n on C endowed with a nowhere degenerate symplectic form up to scalars. We prove that this stack is birational to BGm×As for some s if deg(E)=n⋅deg(L) is odd and C admits a rational point P∈C(k) as well as a line bundle ξ of degree 0 with ξ⊗2?OC. It follows that the corresponding coarse moduli scheme of Ramanathan-stable symplectic bundles is rational in this case.     

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.     

Note on integer powers in sumsets

Let k,m,n?2 be integers. Let A be a subset of {0,1,…,n} with 0∈A and the greatest common divisor of all elements of A is 1. Suppose that

     

EKR type inequalities for 4-wise intersecting families

Let 1?t?7 be an integer and let F be a k-uniform hypergraph on n vertices. Suppose that |A∩B∩C∩D|?t holds for all A,B,C,D∈F. Then we have if holds for some ε>0 and all n>n₀(ε). We apply this result to get EKR type inequalities for “intersecting and union families” and “intersecting Sperner families.”     

Frames in generalized Fock spaces

Let A denote a real linear transformation on Cn which is symmetric and positive-definite relative to the real inner product Re〈z,w〉, z,w∈Cn. Let FA(Cn) denote the Fock space consisting of holomorphic functions on Cn which are square integrable with respect to the Gaussian measure . For w∈Cn, let , z∈Cn, where KA is the reproducing kernel for FA(Cn). The main aim of this paper is to show that there exist a,b>0 such that the set of functions forms a frame in FA.     

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.     

Invariant theory for singular α-determinants

From the irreducible decompositions' point of view, the structure of the cyclic GLn(C)-module generated by the α-determinant degenerates when (1?k?n−1) (see [S. Matsumoto, M. Wakayama, Alpha-determinant cyclic modules of gln(C), J. Lie Theory 16 (2006) 393-405]). In this paper, we show that -determinant shares similar properties which the ordinary determinant possesses. From this fact, one can define a new (relative) invariant called a wreath determinant. Using (GLm,GLn)-duality in the sense of Howe, we obtain an expression of a wreath determinant by a certain linear combination of the corresponding ordinary minor determinants labeled by suitable rectangular shape tableaux. Also we study a wreath determinant analogue of the Vandermonde determinant, and then, investigate symmetric functions such as Schur functions in the framework of wreath determinants. Moreover, we examine coefficients which we call (n,k)-sign appeared at the linear expression of the wreath determinant in relation with a zonal spherical function of a Young subgroup of the symmetric group Snk.     

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.