Maximum two-dimensional （u × v, 4, 1, 3）-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.     

The primitive Boolean matrices with the second largest scrambling index by Boolean rank

The scrambling index of an n × n primitive Boolean matrix A is the smallest positive integer k such that A ^k (A ^T) ^k = J, where A ^T denotes the transpose of A and J denotes the n×n all ones matrix. For an m×n Boolean matrix M, its Boolean rank b(M) is the smallest positive integer b such that M = AB for some m × b Boolean matrix A and b×n Boolean matrix B. In 2009, M. Akelbek, S. Fital, and J. Shen gave an upper bound on the scrambling index of an n×n primitive matrix M in terms of its Boolean rank b(M), and they also characterized all primitive matrices that achieve the upper bound. In this paper, we characterize primitive Boolean matrices that achieve the second largest scrambling index in terms of their Boolean rank.     

A combinatorial problem involving graphs and matrices

In this paper we discuss a combinatorial problem involving graphs and matrices. Our problem is a matrix analogue of the classical problem of finding a system of distinct representatives (transversal) of a family of sets and relates closely to an extremal problem involving 1-factors and a long standing conjecture in the dimension theory of partially ordered sets. For an integer n ?1, let n denote the n element set {1,2,3,…, n}. Then let A be a k×t matrix. We say that A satisfies property P(n, k) when the following condition is satisfied: For every k-taple (x₁,x₂,…,x_k?n^k there exist k distinct integers j₁,j₂,…,j_k so that x_i= a_ii for i= 1,2,…,k. The minimum value of t for which there exists a k × t matrix A satisfying property P(n,k) is denoted by f(n,k). For each k?1 and n sufficiently large, we give an explicit formula for f(n, k): for each n?1 and k sufficiently large, we use probabilistic methods to provide inequalities for f(n,k).     

Small point sets of PG(n, q 3) intersecting each k-subspace in 1 mod q points

The main result of this paper is that point sets of PG(n, q ³), q = p ^h , p ≥ 7 prime, of size less than 3(q ^3(n?k) + 1)/2 intersecting each k-space in 1 modulo q points (these are always small minimal blocking sets with respect to k-spaces) are linear blocking sets. As a consequence, we get that minimal blocking sets of PG(n, p ³), p ≥ 7 prime, of size less than 3(p ^3(n?k) + 1)/2 with respect to k-spaces are linear. We also give a classification of small linear blocking sets of PG(n, q ³) which meet every (n ? 2)-space in 1 modulo q points.     

Compactified Jacobians and q,t-Catalan numbers, II

We continue the study of the rational-slope generalized q,t-Catalan numbers c _m,n (q,t). We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property c _m,n (q,1)=c _m,n (1,q) for m=kn±1. We give a bijective proof of the full symmetry c _m,n (q,t)=c _m,n (t,q) for min(m,n)≤3. As a corollary of these combinatorial constructions, we give a simple formula for the Poincaré polynomials of compactified Jacobians of plane curve singularities x ^kn±1=y ⁿ . We also give a geometric interpretation of a relation between rational-slope Catalan numbers and the theory of (m,n)-cores discovered by J. Anderson.     

Degenerate orbits of adjoint representation of orthogonal and unitary groups regarded as algebraic submanifolds

We suggest a method for describing some types of degenerate orbits of orthogonal and unitary groups in the corresponding Lie algebras as level surfaces of a special collection of polynomial functions. This method allows one to describe orbits of the types SO(2n)/SO(2k)×SO(2) ^n?k , SO(2n+1)/SO(2k+1)×SO(2) ^n?k , and (S)U(n)/(S)(U(2k)×U(2) ^n?k ) in so(2n), so(2n+1), and (s)u(n), respectively. In addition, we show that the orbits of minimal dimensions of the groups under consideration can be described in the corresponding algebras as intersections of quadries. In particular, this approach is used for describing the orbit CP ^n?1?u(n).     

Simple product colorings

If A is a set colored with m colors, and B is colored with n colors, the coloring of A × B obtained by coloring (a, b) with the pair (color of a, color of b) will be called an m × n simple product coloring (SPC) of A × B. SPC's of Cartesian products of three or more sets are defined analogously. It is shown that there are 2 × 2, and 2 × 2 × 2 SPC's of $\text{Q}$² and $\text{Q}$³ which forbid the distance one; that there is no 2^k SPC of $\text{Q}$^k forbidding the distance one, for k > 3; and that there is no 2 × 2 SPC of $\text{Q}$ × $\text{Q}$(√15), and thus none of $\text{R}$², forbidding the distance 1.     

Comment on “Condition number of W-weighted Drazin inverse and their condition numbers of singular linear systems”

In this paper, we establish the explicit condition number formulas for the W-weighted Drazin inverse of a singular matrix A, where A∈? ^m×n , W∈? ^n×m , ?((AW) ^k )=?((AW) ^{k *}), ?((WA) ^k )=?((WA) ^{k *}), and k=max{index(AW), index(WA)}, by the Schur decomposition of A and W. The sensitivity for the W-weighted Drazin-inverse solution of singular systems is also discussed. Based on this form of Schur decomposition, the explicit condition number formulas for the W-weighted Drazin inverse are given by the spectral norm and Frobenius norm instead of the ‖?‖ _P,W -norm, where P is a transformation matrix of the Jordan canonical form of AW, thereby improving the earlier work of Lei et al. (Appl. Math. Comput. 165:185–194, [2005]) and Wang et al. (Appl. Math. Comput. 162:434–446, [2005]).     

Multiset combinatorial batch codes

Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of n data items on m servers, in such a way that any batch of k data items can be retrieved by reading at most some t symbols from each server. Combinatorial batch codes, are replication-based batch codes in which each server stores a subset of the data items. In this paper, we propose a generalization of combinatorial batch codes, called multiset combinatorial batch codes (MCBC), in which n data items are stored in m servers, such that any multiset request of k items, where any item is requested at most r times, can be retrieved by reading at most t items from each server. The setup of this new family of codes is motivated by recent work on codes which enable high availability and parallel reads in distributed storage systems. The main problem under this paradigm is to minimize the number of items stored in the servers, given the values of n, m, k, r, t, which is denoted by N(n, k, m, t; r). We first give a necessary and sufficient condition for the existence of MCBCs. Then, we present several bounds on N(n, k, m, t; r) and constructions of MCBCs. In particular, we determine the value of N(n, k, m, 1; r) for any \(n\ge \left\lfloor \frac{k-1}{r}\right\rfloor {m\atopwithdelims ()k-1}-(m-k+1)A(m,4,k-2)\), where \(A(m,4,k-2)\) is the maximum size of a binary constant weight code of length m, distance four and weight \(k-2\). We also determine the exact value of N(n, k, m, 1; r) when \(r\in \{k,k-1\}\) or \(k=m\).     

Sufficient Conditions and Duality for a Class of Multiobjective Fractional Programming Problems with Higher-Order (F,α,ρ,d)-Convexity

In this paper, a class of multiobjective fractional programming problems (denoted by (MFP)) is considered. First, the concept of higher-order (F,α,ρ,d)-convexity of a function f:C→R with respect to the differentiable function φ:R ⁿ ×R ⁿ →R is introduced, where C is an open convex set in R ⁿ and α:C×C→R ₊?{0} is a positive value function. And an important property, which the ratio of higher-order (F,α,ρ,d)-convex functions is also higher-order (F,α ^′,ρ ^′,d ^′)-convex, is proved. Under the higher-order (F,α,ρ,d)-convexity assumptions, an alternative theorem is also given. Then, some sufficient conditions characterizing properly (or weakly) efficient solutions of (MFP) are obtained from the above property and alternative theorem. Finally, a class of dual problems is formulated and appropriate duality theorems are proved.     

Upper bounds on the sum of powers of the degrees of a simple planar graph

For a simple planar graph G and a positive integer k, we prove the upper bound 2(n ? 1)^k + 4^k(n ? 4) + 2·3^k ? 2((δ + 1)^k ? δ^k)(3n ? 6 ? m) on the sum of the kth powers of the degrees of G, where n, m, and δ are the order, the size, and the minimum degree of G, respectively. The bound is tight for all m with 0?3n ? 6 ? m≤?n/2? ? 2 and δ = 3. We also present upper bounds in terms of order, minimum degree, and maximum degree of G. © 2010 Wiley Periodicals, Inc. J Graph Theory 67:112‐123, 2011     

A subdeterminant inequality for normal matrices

Let A be an n × n normal matrix over $\text{C}$, and Q_m, _n be the set of strictly increasing integer sequences of length m chosen from 1,…,n. For α, β ? Q_m, _n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k ? {0, 1,…, m} we write |α∩β| = k if there exists a rearrangement of 1,…, m, say i₁,…, i_k, i_k+1,…, i_m, such that α(i_j) = β(i_j), i = 1,…, k, and {α(i_k+1),…, α(i_m) } ∩ {β(i_k+1),…, β(i_m) } = ?. A new bound for |detA[α|β ]| is obtained in terms of the eigenvalues of A when 2m = n and |α∩β| = 0.Let $\text{U}$_n be the group of n × n unitary matrices. Define the nonnegative number

where | α ∩ β| = k. It is proved that

Let A be semidefinite hermitian. We conjecture that ρ₀(A) ? ρ₁(A) ? ··· ? ρ_m(A). These inequalities have been tested by machine calculations.     

Growth Polynomials for Additive Quadruples and (h,k)-Tuples

Consider the interval of integers I _m,n = {m, m + 1, m + 2, . . . , m + n ? 1}. For fixed integers h, k, m, and c, let \({\Phi^{(c)}_{h,k,m}(n)}\) denote the number of solutions of the equation (a ₁ +  . . . +  a _h ) ? (a _h+1 +  . . . +  a _h+k ) =  c with \({a_i \in I_{m,n}}\) for all i =  1, . . . , h +  k. This is a polynomial in n for all sufficiently large n, and the growth polynomial is constructed explicitly.     

PBIB designs with m associate classes induced by full rank matrices modulo pm

This paper presents series of PBIB designs with m associate classes in which the treatment set is a subset of the Z(p^m)-module of n × 1 vectors over the ring of integers modulo p^m, p any prime. The association scheme of this series of designs is determined by the Fuller canonical form under row equivalence of n × 2 matrices [a,b] for vectors a and b in the treatment set. The blocking procedure utilizes full rank s × n matrices over Z(p^m), 1 ? s ? n ? 2, n ? 3. For m = 2, n = 3, s =1 and for each prime p, each PBIB is regular divisible and yields a finite proper uniform projective Hjelmslev plane with parameters j = p and k = p(p + 1).     

Geometry of D’Atri spaces of type k

A Riemannian n-dimensional manifold M is a D’Atri space of type k (or k-D’Atri space), 1 ≤ k ≤ n ? 1, if the geodesic symmetries preserve the k-th elementary symmetric functions of the eigenvalues of the shape operators of all small geodesic spheres in M. Symmetric spaces are k-D’Atri spaces for all possible k ≥ 1 and the property 1-D’Atri is the D’Atri condition in the usual sense. In this article we study some aspects of the geometry of k-D’Atri spaces, in particular those related to properties of Jacobi operators along geodesics. We show that k-D’Atri spaces for all k = 1, . . ., l satisfy that ${{\rm{tr}}(R_{v}^{k})}$ , v a unit vector in TM, is invariant under the geodesic flow for all k = 1, . . ., l. Further, if M is k-D’Atri for all k = 1, . . ., n ? 1, then the eigenvalues of Jacobi operators are constant functions along geodesics. In the case of spaces of Iwasawa type, we show that k-D’Atri spaces for all k = 1, . . ., n ? 1 are exactly the symmetric spaces of noncompact type. Moreover, in the class of Damek-Ricci spaces, the symmetric spaces of rank one are characterized as those that are 3-D’Atri.     

Forbidden Configurations and Product Constructions

A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix F, we say that a (0,1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let \({\|A\|}\) denote the number of columns of A. We define \({{\rm forb}(m, F) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration F. We extend this to a family \({\mathcal{F} = \{F_1, F_2, \ldots , F_t\}}\) and define \({{\rm forb}(m, \mathcal{F}) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration \({F \in \mathcal{F}\}}\) . We consider products of matrices. Given an m ₁ × n ₁ matrix A and an m ₂ × n ₂ matrix B, we define the product A × B as the (m ₁ + m ₂) × n ₁ n ₂ matrix whose columns consist of all possible combinations obtained from placing a column of A on top of a column of B. Let I _k denote the k × k identity matrix, let \({I_k^{c}}\) denote the (0,1)-complement of I _k and let T _k denote the k × k upper triangular (0,1)-matrix with a 1 in position i, j if and only if i ≤ j. We show forb(m, {I ₂ × I ₂, T ₂ × T ₂}) is \({\Theta(m^{3/2})}\) while obtaining a linear bound when forbidding all 2-fold products of all 2 × 2 (0,1)-simple matrices. For two matrices F, P, where P is m-rowed, let \({f(F, P) = {\rm max}_{A} \{\|A\| \,:\,A}\) is m-rowed submatrix of P with no configuration F}. We establish f(I ₂ × I ₂, I _m/2 × I _m/2) is \({\Theta(m^{3/2})}\) whereas f(I ₂ × T ₂, I _m/2 × T _m/2) and f(T ₂ × T ₂, T _m/2 × T _m/2) are both \({\Theta(m)}\) . Additional results are obtained. One of the results requires extensive use of a computer program. We use the results on patterns due to Marcus and Tardos and generalizations due to Klazar and Marcus, Balogh, Bollobás and Morris.     

Blocker sets, orthogonal arrays and their application to combination locks

Let A denote a set of order m and let X be a subset of A^k+1. Then X will be called a blocker (of A^k+1) if for any element say (a₁,a₂,…,a_k,a_k+1) of A^k+1, there is some element (x₁,x₂,…,x_k,x_k+1) of X such that x_i equals a_i for at least two i. The smallest size of a blocker set X will be denoted by α(m,k)and the corresponding blocker set will be called a minimal blocker. Honsberger (who credits Schellenberg for the result) essentially proved that α(2n,2) equals 2n² for all n. Using orthogonal arrays, we obtain precise numbers α(m,k) (and lower bounds in other cases) for a large number of values of both k and m. The case k=2 that is three coordinate places (and small m) corresponds to the usual combination lock. Supposing that we have a defective combination lock with k+1 coordinate places that would open if any two coordinates are correct, the numbers α(m,k) obtained here give the smallest number of attempts that will have to be made to ensure that the lock can be opened. It is quite obvious that a trivial upper bound for α(m,k) is m² since allowing the first two coordinates to take all the possible values in A will certainly obtain a blocker set. The results in this paper essentially prove that α(m,k) is no more than about m²/k in many cases and that the upper bound cannot be improved. The paper also obtains precise values of α(m,k) whenever suitable orthogonal arrays of strength two (that is, mutually orthogonal Latin squares) exist.     

Group construction of covering arrays

A covering array t‐CA (n, k, g) is a k × n array on a set of g symbols with the property that in each t × n subarray, every t × 1 column appears at least once. This paper improves many of the best known upper bounds on n for covering arrays, 2‐CA (n, k, g) with g + 1 ≤ k ≤ 2g, for g = 3 · · · 12 by a construction which in many of these cases produces a 2‐CA (n, k, g) with n = k (g ? 1) + 1. The construction is an extension of an algebraic method used by Chateauneuf, Colbourn, and Kreher which uses an array and a group action on the array. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 70–77, 2005.