Matrix-product codes over Fq

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.

Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven

A critical set in a latin square of order n is a set of entries in a latin square which can be embedded in precisely one latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one latin square of order n. In this paper we find smallest weak and smallest totally weak critical sets for all the latin squares of orders six and seven. Moreover, we computationally prove that there is no (totally) weak critical set in the back circulant latin square of order five and we find a totally weak critical set of size seven in the other main class of latin squares of order five.

On the direct product of two weak uniquely completable partial latin squares

In this note we show by counter-example that the direct product of two weak uniquely completable partial latin squares is not necessarily a uniquely completable partial latin square. This counter-example rejects a conjecture by Gower (see [3]) on the direct product of two uniquely completable partial latin squares.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.

The effect of resource aggregation at different scales: Optimal foraging behavior of Cotesia rubecula

Resources can be aggregated both within and between patches. In this article, we examine how aggregation at these different scales influences the behavior and performance of foragers. We developed an optimal foraging model of the foraging behavior of the parasitoid wasp Cotesia rubecula parasitizing the larvae of the cabbage butterfly Pieris rapae. The optimal behavior was found using stochastic dynamic programming. The most interesting and novel result is that the effect of resource aggregation within and between patches depends on the degree of aggregation both within and between patches as well as on the local host density in the occupied patch, but lifetime reproductive success depends only on aggregation within patches. Our findings have profound implications for the way in which we measure heterogeneity at different scales and model the response of organisms to spatial heterogeneity.

Star factorizations of graph products

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

On the Oberwolfach problem with two similar length cycles

For all in greater than or equal to 3, the Oberwolfach problem is solved for the case where the 2-factors consist of two cycles of lengths in and m + 1, and for the case where the 2-factors consist of two cycles of lengths m and m + 2.

On the relation between the conditional moment closure and unsteady flamelets

We consider the relation between the conditional moment closure (CMC) and the unsteady flamelet model (FM). The CMC equations were originally constructed as global equations, while FM was derived asymptotically for a thin reaction zone. The recent tendency is to use FM-type equations as global equations. We investigate the possible consequences and suggest a new version of FM: coordinate-invariant FM (CIFM). Unlike FM, CIFM complies with conditional properties of the exact transport equations which are used effectively in CMC. We analyse the assumptions needed to obtain another global version of FM: representative interactive flamelets (RIF), from original FM and demonstrate that, in homogeneous turbulence, one of these assumptions is equivalent to the main CMC hypothesis.

Analysis of flexural waves excited by rectangular contact type transducers

In this paper, an attempt was made to investigate a fundamental problem related to the flexural waves excited by rectangular transducers. Due to the disadvantages of the Green's function approach for solving this problem, a direct and effective method is proposed using a multiple integral transform method and contour integration technique. The explicit frequency domain solutions obtained from this newly developed method are convenient for understanding transducer behavior and theoretical optimization and experimental calibration of rectangular transducers. The time domain solutions can then be easily obtained by using the fast Fourier transform technique. (C) 2001 Elsevier Science B.V. All rights reserved.

Dendritic branching patterns of pyramidal cells in the visual cortex of the new world marmoset monkey, with comparative notes on the old world macaque monkey

The basal dendritic arbors of 442 supragranular pyramidal cells in visual cortex of the marmoset monkey were compared by fractal analyses. As detailed in a previous study,(1) individual cells were injected with Lucifer Yellow and processed for a DAB reaction product. The basal dendritic arbors were drawn, in the tangential plane, and the fractal dimension (D) determined by the dilation method. The fractal dimensions were compared between cells in ten cortical areas containing cells involved in visual processing, including the primary visual area (Vi), the second visual area (V2), the dorsoanterior area (DA), the dorsomedial area (DM), the dorsolateral. area (DL), the middle temporal area (MT), the posterior parietal area (PP), the fundus of the superior temporal area (FST) and the caudal and rostral subdivisions of inferotemporal cortex (ITc and ITr, respectively). Of 45 pairwise interareal comparisons of the fractal dimension of neurones, 20 were significantly different. Moreover, comparison of data according to previously published visual processing pathways revealed a trend for cells with greater fractal dimensions in higher cortical areas. Comparison of the present results with those in homologous cortical areas in the macaque monkey(2) revealed some similarities between the two species. The similarity in the trends of D values of cells in both species may reflect developmental features which, result in different functional attributes.