An extremal set theoretical characterization of some steiner systems

Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( _t ⁿ )( _k ^2k-t-1 )/( _t ^2k-t-1 ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.     

On the number of homogeneous subgraphs of a graph

Let us defineG(n) to be the maximum numberm such that every graph onn vertices contains at leastm homogeneous (i.e. complete or independent) subgraphs. Our main result is exp (0.7214 log² n) ≧G(n) ≧ exp (0.2275 log² n), the main tool is a Ramsey—Turán type theorem. We formulate a conjecture what supports Thomason’s conjecture R(k, k)^1/k = 2.     

Intersection theorems with geometric consequences

In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ₀, μ₁, ..., μ_s are distinct residues modp (p is a prime) such thatk ≡ μ₀ (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μ_i (modp) for somei, 1 ≦i≦s, then |ℱ|≦( _s ⁿ ). As a consequence we show that ifR ⁿ is covered bym sets withm<(1+o(1)) (1.2) ⁿ then there is one set within which all the distances are realised. It is left open whether the same conclusion holds for compositep.     

Bijective linear maps on semimodules spanned by Boolean matrices of fixed rank

Let M_m,n(B) be the semimodule of all m×n Boolean matrices where B is the Boolean algebra with two elements. Let k be a positive integer such that 2?k?min(m,n). Let B(m,n,k) denote the subsemimodule of M_m,n(B) spanned by the set of all rank k matrices. We show that if T is a bijective linear mapping on B(m,n,k), then there exist permutation matrices P and Q such that T(A)=PAQ for all A∈B(m,n,k) or m=n and T(A)=PA^tQ for all A∈B(m,n,k). This result follows from a more general theorem we prove concerning the structure of linear mappings on B(m,n,k) that preserve both the weight of each matrix and rank one matrices of weight k². Here the weight of a Boolean matrix is the number of its nonzero entries.     

Tensor Product Representations of the Lie Superalgebra 𝔭(n) and Their Centralizers

Abstract

We construct an associative algebra A _k and show that there is a representation of A _k on V ^?k , where V is the natural 2n-dimensional representation of the Lie superalgebra 𝔭(n). We prove that A _k is the full centralizer of 𝔭(n) on V ^?k , thereby obtaining a “Schur-Weyl duality” for the Lie superalgebra 𝔭(n). This result is used to understand the representation theory of the Lie superalgebra 𝔭(n). In particular, using A _k we decompose the tensor space V ^?k , for k = 2 or 3, and show that V ^?k is not completely reducible for any k ≥ 2.     

K 1,p k-factorization of complete bipartite graphs

Abstract. In this paper, it is shown that a sufficient condition for the existence of a     

A direct method to solve block banded block Toeplitz systems with non-banded Toeplitz blocks

A fast solution algorithm is proposed for solving block banded block Toeplitz systems with non-banded Toeplitz blocks. The algorithm constructs the circulant transformation of a given Toeplitz system and then by means of the Sherman-Morrison-Woodbury formula transforms its inverse to an inverse of the original matrix. The block circulant matrix with Toeplitz blocks is converted to a block diagonal matrix with Toeplitz blocks, and the resulting Toeplitz systems are solved by means of a fast Toeplitz solver.The computational complexity in the case one uses fast Toeplitz solvers is equal to ξ(m,n,k)=O(mn³)+O(k³n³) flops, there are m block rows and m block columns in the matrix, n is the order of blocks, 2k+1 is the bandwidth. The validity of the approach is illustrated by numerical experiments.     

Wavelet approximation and Fourier widths of classes of periodic functions of several variables. I

We obtain characterizations (and prove the corresponding equivalence of norms) of function spaces B _pq ^sm ($ \mathbb{I} $ \mathbb{I} ^k ) and L _pq ^sm ($ \mathbb{I} $ \mathbb{I} ^k ) of Nikol’skii-Besov and Lizorkin-Triebel types, respectively, in terms of representations of functions in these spaces by Fourier series with respect to a multiple system $ \mathcal{W}_m^\mathbb{I} $ \mathcal{W}_m^\mathbb{I} of Meyer wavelets and in terms of sequences of the Fourier coefficients with respect to this system. We establish order-sharp estimates for the approximation of functions in B _pq ^sm ($ \mathbb{I} $ \mathbb{I} ) and L _pq ^sm ($ \mathbb{I} $ \mathbb{I} ^k ) by special partial sums of these series in the metric of L _r ($ \mathbb{I} $ \mathbb{I} ^k ) for a number of relations between the parameters s, p, q, r, and m (s = (s ₁, ..., s _n ) ∈ ℝ₊ ⁿ , 1 ≤ p, q, r ≤ ∞, m = (m ₁, ..., m _n ) ∈ ℕ ⁿ , k = m ₁ +... + m _n , and $ \mathbb{I} $ \mathbb{I} = ℝ or $ \mathbb{T} $ \mathbb{T} ). In the periodic case, we study the Fourier widths of these function classes.     

The Cardinality of Sets of <Emphasis Type="Italic">k</Emphasis>-Independent Vectors over Finite Fields

A set of vectors is k-independent if all its subsets with no more than k elements are linearly independent. We obtain a result concerning the maximal possible cardinality Ind _q (n, k) of a k-independent set of vectors in the n-dimensional vector space F _q ⁿ over the finite field F _q of order q. Namely, we give a necessary and sufficient condition for Ind _q (n, k) = n + 1. We conclude with some pertinent remarks re applications of our results to codes, graphs and hypercubes. Supported, in part by grants EP/C000285, NSF-DMS-0439734 and NSF-DMS-0555839. S. B. Damelin thanks the Institute for Mathematics and Applications for their hospitality.     

Equitable coloring of random graphs

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ₌(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of a graph G with k′ colors is said to be the equitable chromatic threshold of G and is denoted by χ₌*(G). In this paper, we investigate the asymptotic behavior of these coloring parameters in the probability space G(n,p) of random graphs. We prove that if n^?1/5+? < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ₌(G(n,p)) = (1 + o(1))χ(G(n,p)) holds (where χ(G(n,p)) is the ordinary chromatic number of G(n,p)). We also show that there exists a constant C such that if C/n < p < 0.99, then almost surely χ(G(n,p)) ≤ χ₌(G(n,p)) ≤ (2 + o(1))χ(G(n,p)). Concerning the equitable chromatic threshold, we prove that if n^?(1??) < p < 0.99 for some 0 < ?, then almost surely χ(G(n,p)) ≤ χ₌* (G(n,p)) ≤ (2 + o(1))χ(G(n,p)) holds, and if < p < 0.99 for some 0 < ?, then almost surely we have χ(G(n,p)) ≤ χ₌*(G(n,p)) = O_?(χ(G(n,p))). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

How quadratic are the natural numbers?

Abstract. For natural numbers n we inspect all factorizations n = ab of n with a ￡ ba \le b in \Bbb N\Bbb N and denote by n=a_n b_nn=a_n b_n the most quadratic one, i.e. such that b_n - a_nb_n - a_n is minimal. Then the quotient k(n) : = a_n/b_n\kappa (n) := a_n/b_n is a measure for the quadraticity of n. The best general estimate for k(n)\kappa (n) is of course very poor: 1/n ￡ k(n) ￡ 11/n \le \kappa (n)\le 1. But a Theorem of Hall and Tenenbaum [1, p. 29], implies(logn)^-d-e ￡ k(n) ￡ (logn)^-d(\log n)^{-\delta -\varepsilon } \le \kappa (n) \le (\log n)^{-\delta } on average, with d = 1 - (1+log₂  2)/log2=0,08607 ?\delta = 1 - (1+\log _2 \,2)/\log 2=0,08607 \ldots and for every e > 0\varepsilon >0. Hence the natural numbers are fairly quadratic.¶k(n)\kappa (n) characterizes a specific optimal factorization of n. A quadraticity measure, which is more global with respect to the prime factorization of n, is k^*(n): = ?_{1 ￡ a ￡ b, ab=n} a/b\kappa ^*(n):= \textstyle\sum\limits \limits _{1\le a \le b, ab=n} a/b. We show k^*(n) ~ \frac 12\kappa ^*(n) \sim \frac {1}{2} on average, and k^*(n)=W(2^{\frac 12(1-e) log n/log ₂n})\kappa ^*(n)=\Omega (2^{\frac {1}{2}(1-\varepsilon ) {\log}\, n/{\log} _2n})for every e > 0\varepsilon>0.     

Ramsey functions involving with large

For fixed integers m,k2, it is shown that the k-color Ramsey number r_k(K_m,n) and the bipartite Ramsey number b_k(m,n) are both asymptotically equal to k^mn as n→∞, and that for any graph H on m vertices, the two-color Ramsey number is at most (1+o(1))n^m+1/(logn)^m-1. Moreover, the order of magnitude of is proved to be n^m+1/(logn)^m if H≠K_m as n→∞.     

Random k-dimensional orders: Width and number of linear extensions

We consider the width W _k (n) and number L _k (n) of linear extensions of a random k-dimensional order P _k (n). We show that, for each fixed k, almost surely W _k (n) lies between (k/2–C)n _1–1/k and 4kn ^1-1/k , for some constant C, and L _k (n) lies between (e ^-2 n ^1-1/k ) ⁿ and (2kn ^1-1/k ) ⁿ . The bounds given also apply to the expectations of the corresponding random variables. We also show that W _k (n) and log L _k (n) are sharply concentrated about their means.     

Extremal problems on detectable colorings of trees

Let G be a connected graph of order 3 or more and let be a coloring of the edges of G (where adjacent edges may be colored the same). For each vertex v of G, the color code of v is the k-tuple c(v)=(a₁,a₂,…,a_k), where a_i is the number of edges incident with v that are colored i (1?i?k). The coloring c is called detectable if distinct vertices have distinct color codes; while the detection number det(G) of G is the minimum positive integer k for which G has a detectable k-coloring. For each integer n?3, let D_T(n) be the maximum detection number among all trees of order n and d_T(n) the minimum detection number among all trees of order n. The numbers D_T(n) and d_T(n) are determined for all integers n?3. Furthermore, it is shown that for integers k?2 and n?3, there exists a tree T of order n having det(T)=k if and only if d_T(n)?k?D_T(n).     

Sharp Bounds For Some Multicolor Ramsey Numbers

Let H ₁,H ₂, . . .,H _k+1 be a sequence of k+1 finite, undirected, simple graphs. The (multicolored) Ramsey number r(H ₁,H ₂,...,H _k+1) is the minimum integer r such that in every edge-coloring of the complete graph on r vertices by k+1 colors, there is a monochromatic copy of H _i in color i for some 1ik+1. We describe a general technique that supplies tight lower bounds for several numbers r(H ₁,H ₂,...,H _k+1) when k2, and the last graph H _k+1 is the complete graph K _m on m vertices. This technique enables us to determine the asymptotic behaviour of these numbers, up to a polylogarithmic factor, in various cases. In particular we show that r(K ₃,K ₃,K _m ) = (m ³ poly logm), thus solving (in a strong form) a conjecture of Erdos and Sós raised in 1979. Another special case of our result implies that r(C ₄,C ₄,K _m ) = (m ² poly logm) and that r(C ₄,C ₄,C ₄,K _m ) = (m ²/log² m). The proofs combine combinatorial and probabilistic arguments with spectral techniques and certain estimates of character sums.* Research supported in part by a State of New Jersey grant, by a USA Israeli BSF grant and by a grant from the Israel Science Foundation. Research supported by NSF grant DMS 9704114.     

On the sum of a prime and a k-th power of prime in short intervals

Let H_k\mathcal{H}_{k} denote the set {n∣2|n, n\not o 1 (mod p)n\not\equiv 1\ (\mathrm{mod}\ p) ∀ p>2 with p−1|k}. We prove that when X^{\frac1120(1-\frac12k) +e}\leqq H\leqq XX^{\frac{11}{20}\left(1-\frac{1}{2k}\right) +\varepsilon}\leqq H\leqq X, almost all integers n ? \allowbreak H_k ?(X, X+H]n\in\allowbreak {\mathcal{H}_{k} \cap (X, X+H]} can be represented as the sum of a prime and a k-th power of prime for k≧3. Moreover, when X^{\frac1120(1-\frac1k) +e}\leqq H\leqq XX^{\frac{11}{20}\left(1-\frac{1}{k}\right) +\varepsilon}\leqq H\leqq X, almost all integers n∈(X,X+H] can be represented as the sum of a prime and a k-th power of integer for k≧3.     

On the Elementary Retarded,Ultrahyperbolic Solution of the Klein-Gordon Operator,Iterated k Times

Let t = (t₁,…,t_n) be a point of ?ⁿ. We shall write . We put, by the definition, W_α(u, m) = (m^?2u)^{(α ? n)/4}[π^{(n ? 2)/2}2^{(α + n ? 2)/2}Г(α/2)]J_{(α ? n)/2}(m²u)^1/2; here α is a complex parameter, m a real nonnegative number, and n the dimension of the space. W_α(u, m), which is an ordinary function if Re α ≥ n, is an entire distributional function of α. First we evaluate {□ + m²}W_{α + 2}(u, m) = W_α(u, m), where {□ + m²} is the ultrahyperbolic operator. Then we express W_α(u, m) as a linear combination of R_α(u) of differntial orders; R_α(u) is Marcel Riesz's ultrahyperbolic kernel. We also obtain the following results: W_?2k(u, m) = {□ + m²}^kδ, k = 0, 1,…; W₀(u, m) = δ; and {□ + m²}^kW_2k(u, m) = δ. Finally we prove that W_α(u, m = 0) = R_α(u). Several of these results, in the particular case µ = 1, were proved earlier by a completely different method.     

Maximum Number of Constant Weight Vertices of the Unit <Emphasis Type="Italic">n</Emphasis>-Cube Contained in a <Emphasis Type="Italic">k</Emphasis>-Dimensional Subspace

We introduce and solve a natural geometrical extremal problem. For the set E (n,w) = {x ⁿ {0,1} ⁿ : x ⁿ has w ones } of vertices of weight w in the unit cube of ⁿ we determine M (n,k,w) max{|U _k ⁿ E(n,w)|:U _k ⁿ is a k-dimensional subspace of ⁿ . We also present an extension to multi-sets and explain a connection to a higher dimensional Erds–Moser type problem.     

A result about determinantal divisors

Let Rbe a principal ideal ringR_n the ring of n× nmatrices over R, and d_k (A) the kth determinantal divisor of Afor 1 ? k? n, where Ais any element of R_n , It is shown that if A,BεR_n , det(A) det(B:) ≠ 0, then d_k (AB) ≡ 0 mod d_k (A) d_k (B). If in addition (det(A), det(B)) = 1, then it is also shown that d_k (AB) = d_k (A) d_k (B). This provides a new proof of the multiplicativity of the Smith normal form for matrices with relatively prime determinants.     

Non-uniform Turán-type problems

Given positive integers n,k,t, with 2?k?n, and t<2^k, let m(n,k,t) be the minimum size of a family F of (nonempty distinct) subsets of [n] such that every k-subset of [n] contains at least t members of F, and every (k-1)-subset of [n] contains at most t-1 members of F. For fixed k and t, we determine the order of magnitude of m(n,k,t). We also consider related Turán numbers T_?r(n,k,t) and T_r(n,k,t), where T_?r(n,k,t) (T_r(n,k,t)) denotes the minimum size of a family such that every k-subset of [n] contains at least t members of F. We prove that T_?r(n,k,t)=(1+o(1))T_r(n,k,t) for fixed r,k,t with and n→∞.