On maximal t-linearly independent sets

Consider a finite t + r ? 1 dimensional projective space PG(t + r ? 1, s) over a Galois field GF(s) of order s = ?^h, where ? and h are positive integers and ? is the prime characteristic of the field. A collection of k points in PG (t + r ? 1, s) constitutes an L(t, k)-set if no t of them are linearly dependent. An L(t, k)-set is maximal if there exists no other L(t, k′)-set with k′ > k. The largest k for which an L(t, k)-set exists is denoted by M_t(t + r, s). K. A. Bush [3] established that M_t(t, s) = t + 1 for t ? s. The purpose of this paper is to generalize this result and study M_t(t + r, s) for t, r, and s in certain relationships.     

On a geometrical method of construction of maximal t-linearly independent sets

The problem of constructing a maximal t-linearly independent set in V(r; s) (called a maximal L_t(r, s)-set in this paper) is a very important one (called a packing problem) concerning a fractional factorial design and an error correcting code where V(r; s) is an r-dimensional vector space over a Galois field GF(s) and s is a prime or a prime power. But it is very difficult to solve it and attempts made by several research workers have been successful only in special cases.In this paper, we introduce the concept of a {Σ_α=1^kw_α, m; t, s}-min · hyper with weight (w₁, w₂,…, w_k) and using this concept and the structure of a finite projective geometry PG(n ? 1, s), we shall give a geometrical method of constructing a maximal L_t(t + r, s)-set with length t + r + n for any integers r, n, and s such that n ? 3, n ? 1 ? r₀ ? n + s ? 2 and r₁ ? 1, where r = (r₁ + 1)v_n?1 ? r₀ and $\text{v}{}_{\mathrm{n}}\text{=}\text{(s}{}^{\mathrm{n}}\text{? 1)}\text{(s ? 1)}$.     

The packing problem for projective geometries over GF(3) with dimension greater than five

An (n, d) set in the projective geometry PG(r, q) is a set of n points, no d of which are dependent. The packing problem is that of finding n(r, q, d), the largest size of an (n, d) set in PG(r, q). The packing problem for PG(r, 3) is considered. All of the values of n(r, 3, d) for r ? 5 are known. New results for r = 6 are n(6, 3, 5) = 14 and 20 ? n(6, 3, 4) ? 31. In general, upper bounds on n(r, q, d) are determined using a slightly improved sphere-packing bound, the linear programming approach of coding theory, and an orthogonal (n, d) set with the known extremal values of n(r, q, d)—values when r and d are close to each other. The BCH constructions and computer searches are used to give lower bounds. The current situation for the packing problem for PG(r, 3) with r ? 15 is summarized in a final table.     

Nombre de representations d'une permutation comme produit de deux cycles de longueurs donnees

We consider the Ramsey number r(sK₂, G) where sK₂(s?1) denotes a set of s disjoint edges and G is an arbitrary finite simple graph with no isolated vertices. We obtain upper and lower bounds in the general case. Exact results are obtained for certain classes of graphs.     

Maximal sets of points in finite projective space,no t-linearly dependent

Consider a finite (t + r ? 1)-dimensional projective space PG(t + r ? 1, s) based on the Galois field GF(s), where s is prime or power of a prime. A set of k distinct points in PG(t + r ? 1, s), no t-linearly dependent, is called a (k, t)-set and such a set is said to be maximal if it is not contained in any other (k¹, t)-set with $\text{k}{}^1\text{> k}$. The number of points in a maximal (k, t)-set with the largest k is denoted by m_t(t + r, s). Our purpose in the paper is to investigate the conditions under which two or more points can be adjoined to the basic set of E_i, i = 1, 2, …, t + r, where E_i is a point with one in i-th position and zeros elsewhere. The problem has several applications in the theory of fractionally replicated designs and information theory.     

Factored forms for solutions of AX − XB = C and X − AXB = C in companion matrices

The main concern of this paper is linear matrix equations with block-companion matrix coefficients. It is shown that general matrix equations AX ? XB = C and X ? AXB = C can be transformed to equations whose coefficients are block companion matrices: $\text{C}\text{?}{}_{\mathrm{L}}\text{X?XC}{}_{\mathrm{M}}\text{=}\text{diag}\text{[I 0…0]}$ and $\text{X?}\text{C}\text{?}{}_{\mathrm{L}}\text{XC}{}_{\mathrm{M}}\text{=}\text{diag}\text{[I 0…0]}$, respectively, where ?_L and C_M stand for the first and second block-companion matrices of some monic r × r matrix polynomials L(λ) = λ^sI + Σ^s?1_j=0λ^jL_j and M(λ) = λ^tI + Σ^t7minus;1_j=0λ^jM_j. The solution of the equat with block companion coefficients is reduced to solving vector equations Sx = ?, where the matrix S is r²l × r²l[l = max(s, t)] and enjoys some symmetry properties.     

Conjectured statistics for the q,t-Catalan numbers

We introduce the distribution function F_n(q,t) of a pair of statistics on Catalan words and conjecture F_n(q,t) equals Garsia and Haiman's q,t-Catalan sequence C_n(q,t), which they defined as a sum of rational functions. We show that F_n,s(q,t), defined as the sum of these statistics restricted to Catalan words ending in s ones, satisfies a recurrence relation. As a corollary we are able to verify that F_n(q,t)=C_n(q,t) when t=1/q. We also show the partial symmetry relation F_n(q,1)=F_n(1,q). By modifying a proof of Haiman of a q-Lagrange inversion formula based on results of Garsia and Gessel, we obtain a q-analogue of the general Lagrange inversion formula which involves Catalan words grouped according to the number of ones at the end of the word.     

Density of slowly oscillating solutions of ẋ(t) = −f(x(t − 1))

We study the scalar, nonlinear Volterra integrodifferential equation (1), x′(t) + ∫_[0,t]g(x(t ? s)) dμ(s) = f(t) (t ? 0). We let g be continuous, μ positive definite, and f integrable over (0, ∞). The standard assumption on g which yields boundedness of the solutions of (1) prevents g(x) from growing faster than an exponential as x → ∞. Here we present a weaker condition on g, which does not restrict the growth rate of g(x) as x → ∞, but which still implies that the solutions of (1) are bounded. In particular, when g is nondecreasing and either nonnegative or odd, we get bounds which are independent of g.     

The densities for 3-ranks of tame kernels of cyclic cubic number fields

Let F be a cubic cyclic field with t(2)ramified primes.For a finite abelian group G,let r3(G)be the 3-rank of G.If 3 does not ramify in F,then it is proved that t-1 r3(K2O F)2t.Furthermore,if t is fixed,for any s satisfying t-1 s 2t-1,there is always a cubic cyclic field F with exactly t ramified primes such that r3(K2O F)=s.It is also proved that the densities for 3-ranks of tame kernels of cyclic cubic number fields satisfy a Cohen-Lenstra type formula d∞,r=3-r2∞k=1(1-3-k)r k=1(1-3-k)2.This suggests that the Cohen-Lenstra conjecture for ideal class groups can be extended to the tame kernels of cyclic cubic number fields.     

Identity orientation of complete bipartite graphs

An identity orientation of a graph G=(V,E) is an orientation of some of the edges of E such that the resulting partially oriented graph has no automorphism other than the identity. We show that the complete bipartite graph K_s,t, with st, does not have an identity orientation if t3^s-log₃(s-1). We also show that if (r+1)(r+2)2s then K_s,3^s-r does have an identity orientation. These results improve the previous bounds obtained by Harary and Jacobson (Discuss. Math. - Graph Theory 21 (2001) 158). We use these results to determine exactly the values of t for which an identity orientation of K_s,t exists for 2s17.     

Sets of orthogonal hypercubes of class r

A (d,n,r,t)-hypercube is an n×n×?×n (d-times) array on nr symbols such that when fixing t coordinates of the hypercube (and running across the remaining d−t coordinates) each symbol is repeated nd−r−t times. We introduce a new parameter, r, representing the class of the hypercube. When r=1, this provides the usual definition of a hypercube and when d=2 and r=t=1 these hypercubes are Latin squares. If d?2r, then the notion of orthogonality is also inherited from the usual definition of hypercubes. This work deals with constructions of class r hypercubes and presents bounds on the number of mutually orthogonal class r hypercubes. We also give constructions of sets of mutually orthogonal hypercubes when n is a prime power.     

On a particular case of the inconsistent linear matrix equation AX+YB=C

We consider the linear matrix equation AX+YB=C where A,B, and C are given matrices of dimensions (r+1)×r, s×(s+1), and (r+1)×(s+1), respectively, and rank A = r, rank B = s. We give a connection between the least-squares solution and the solution which minimizes an arbitrary norm of the residual matrix C?AX? YB.     

Some Howell designs of prime side

This paper deals with the existence question for types of Howell Designs of odd side. One of the difficulties that must be surmounted before complete knowledge can be obtained is the problem of constructing designs of prime side. Previously, relatively little information has been available about these types of designs. In this paper, we show that for every pair (m, r) of positive integers, r odd, there is a positive integer P(m, r) such that if p is a prime, p = 2^mrs + 1>P(m, r), r, s odd positive integers, then at least $\text{(2}{}^{\mathrm{m?1}}\text{r?1)}\text{(2}{}^{\mathrm{m?1}}\text{r)}$ of the types of Howell Designs of side p other than the Room Square type can be constructed. The method of construction appears to be much better than the general bounds that are obtained. We are able to show by ad hoc procedures that P(2,1) = 1, Thus if p = 4t + 1, t odd, then at least $\text{1}\text{2}$ of the types of designs of side p other than the Room Square type can be constructed. We offer compelling evidence in favor of the conjecture that P(1,3) = 1 also. In particular, if p = 6t + 1< 1000, t odd, then at least $\text{3}\text{3}$ of the types of designs of side p other than the Room Square type can be constructed.     

On the oscillation of a second-order delay equation

The oscillatory nature of two equations (r(t) y′(t))′ + p₁(t)y(t) = f(t), (r(t) y′(t))′ + p₂(t) y(t ? τ(t))= 0, is compared when positive functions p₁ and p₂ are not “too close” or “too far apart.” Then the main theorem states that if h(t) is eventually negative and a twice continuously differentiable function which satisfies (r(t) h′(t))′ + p₁(t) h(t) ? 0, then this inequality is necessary and sufficient for every bounded solution of (r(t) y′(t))′ + p₂(t) y(t ? τ(t)) = 0 to be nonoscillatory.     

Weak solution of (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0))u′(0) = ku(0), r(L, u(L))u′ (L) = hu(L) and k, h are suitable elements of [0, ∞]

We consider weak solutions to the nonlinear boundary value problem (r, (x, u(x)) u′(x))′ = (Fu)′(x) with r(0, u(0)) u′(0) = ku(0), r(L, u(L)) u′(L) = hu(L) and k, h are suitable elements of [0, ∞]. In addition to studying some new boundary conditions, we also relax the constraints on r(x, u) and (Fu)(x). r(x, u) > 0 may have a countable set of jump discontinuities in u and r(x, u)^?1?L_q((0, L) × (0, p)). F is an operator from a suitable set of functions to a subset of L_p(0, L) which have nonnegative values. F includes, among others, examples of the form (Fu)(x) = (1 ? H(x ? x₀)) u(x₀), (Fu)(x) = ∫_x^Lf(y, u(y)) dy where f(y, u) may have a countable set of jump discontinuities in u or F may be chosen so that (Fu)′(x) = ? g(x, u(x)) u′(x) ? q(x) u(x) ? f(x, u(x)) where q is a distributional derivative of an L₂(0, L) function.     

On the solutions to x′(t) = A(t) x (t) over all A(t), where P ⩽ A(t) ⩽ Q

Let P_ij and q_ij be positive numbers for i ≠ j, i, j = 1, …, n, and consider the set of matrix differential equations x′(t) = A(t) x(t) over all A(t), where a_ij(t) is piecewise continuous, a_ij(t) = ?∑_{i ≠ j}a_ij(t), and p_ij ? a_ij(t) ? q_ij all t. A solution x is also to satisfy ∑_{i = 1}ⁿx_i(0) = 1. Let C_t denote the set of all solutions, evaluated at t to equations described above. It is shown that $\text{C}{}_{\mathrm{t}}$, the topological closure of C_t, is a compact convex set for each t. Further, the set valued function $\text{C}{}_{\mathrm{t}}$, of t is continuous and $\text{limit}{}_{\mathrm{t\; \to \; \infty }}\text{C}\text{?}{}_{\mathrm{t}}\text{= ∩}\text{C}\text{?}{}_{\mathrm{t}}$.     

Inner and outer radial density functions in singly-excited 1snl states of the He atom

The one-electron radial density function D(r) has recently been found to be separable into inner D_<(r) and outer D_>(r) radial density functions. The inner D_<(r) and outer D_>(r) densities are studied for 28 singly-excited 1snl singlet and triplet states (0≤l<n≤5) of the He atom at a correlated level. Theoretical structures of D_<(r) and D_>(r) are discussed within the Hartree-Fock framework. Comparison of correlated D_<(r) and D_>(r) with hydrogenic radial densities based on the modal characteristics and Carbó’s similarity index clarifies that D_<(r) represents the 1s density of the helium cation, while D_>(r) extracts the nl density of the hydrogen atom from D(r). The radial separation 〈|r₁−r₂|〉, which constitutes a lower bound to the standard deviation of D(r), is shown to be estimated from the location of the outermost maximum of D_>(r).     

A lower bound for v in a t − (v,k, λ) design

In this paper it is shown that if v ? k + 1 then $\text{v ? t ? 1 + (k ? t + 1)(k ? t + 2)}\text{λ}$, where v, k, λ and t are the characteristic parameters of a t ? (v, k, λ) design. We compare this bound with the known lower bounds on v.     

On a nonconvolution Volterra resolvent

Under fairly weak assumptions, the solutions of the system of Volterra equations x(t) = ∝₀^ta(t, s) x(s) ds + f(t), t > 0, can be written in the form x(t) = f(t) + ∝₀^tr(t, s) f(s) ds, t > 0, where r is the resolvent of a, i.e., the solution of the equation r(t, s) = a(t, s) + ∝₀^ta(t, v) r(v, s)dv, 0 < s < t. Conditions on a are given which imply that the resolvent operator f ∝₀^tr(t, s) f(s) ds maps a weighted L¹ space continuously into another weighted L¹ space, and a weighted L^∞ space into another weighted L^∞ space. Our main theorem is used to study the asymptotic behavior of two differential delay equations.