An adaptation of correspondence analysis for square tables

The application of correspondence analysis to square asymmetrictables is often unsuccessful because of the strong role played by thediagonal entries of the matrix, obscuring the data off the diagonal. A simplemodification of the centering of the matrix, coupled with the correspondingchange in row and column masses and row and column metrics, allows the tableto be decomposed into symmetric and skew--symmetric components, which canthen be analyzed separately. The symmetric and skew--symmetric analyses canbe performed using a simple correspondence analysis program if the data areset up in a special block format.

A criterion for unitary similarity of upper triangular matrices in general position

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A = [a(ij)] and B = [b(ij)] be upper triangular n x n matrices that are not similar to direct sums of square matrices of smaller sizes, or are in general position and have the same main diagonal. We prove that A and B are unitarily similar if and only if parallel to h(A(k))parallel to = parallel to h(B(k))parallel to for all h is an element of C vertical bar x vertical bar and k = 1, ..., n, where A(k) := [a(ij)](i.j=1)(k) and B(k) := [b(ij)](i.j=1)(k) are the leading principal k x k submatrices of A and B, and parallel to . parallel to is the Frobenius norm. (C) 2011 Elsevier Inc. All rights reserved.

Tridiagonal canonical matrices of bilinear or sesquilinear forms and of pairs of symmetric, skew-symmetric, or Hermitian forms

Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field of characteristic different from 2. (C) 2008 Elsevier Inc. All rights reserved.

Multivariate QST-FST comparisons: a neutrality test for the evolution of the g matrix in structured populations.

Neutrality tests in quantitative genetics provide a statistical framework for the detection of selection on polygenic traits in wild populations. However, the existing method based on comparisons of divergence at neutral markers and quantitative traits (Q(st)-F(st)) suffers from several limitations that hinder a clear interpretation of the results with typical empirical designs. In this article, we propose a multivariate extension of this neutrality test based on empirical estimates of the among-populations (D) and within-populations (G) covariance matrices by MANOVA. A simple pattern is expected under neutrality: D = 2F(st)/(1 - F(st))G, so that neutrality implies both proportionality of the two matrices and a specific value of the proportionality coefficient. This pattern is tested using Flury's framework for matrix comparison [common principal-component (CPC) analysis], a well-known tool in G matrix evolution studies. We show the importance of using a Bartlett adjustment of the test for the small sample sizes typically found in empirical studies. We propose a dual test: (i) that the proportionality coefficient is not different from its neutral expectation [2F(st)/(1 - F(st))] and (ii) that the MANOVA estimates of mean square matrices between and among populations are proportional. These two tests combined provide a more stringent test for neutrality than the classic Q(st)-F(st) comparison and avoid several statistical problems. Extensive simulations of realistic empirical designs suggest that these tests correctly detect the expected pattern under neutrality and have enough power to efficiently detect mild to strong selection (homogeneous, heterogeneous, or mixed) when it is occurring on a set of traits. This method also provides a rigorous and quantitative framework for disentangling the effects of different selection regimes and of drift on the evolution of the G matrix. We discuss practical requirements for the proper application of our test in empirical studies and potential extensions.

Monge assignment games

Un juego de asignación se define por una matriz A; donde cada fila representa un comprador y cada columna un vendedor. Si el comprador i se empareja a un vendedor j; el mercado produce aij unidades de utilidad. Estudiamos los juegos de asignación de Monge, es decir, aquellos juegos bilaterales de asignación en los cuales la matriz satisface la propiedad de Monge. Estas matrices pueden caracterizarse por el hecho de que en cualquier submatriz 2x2 un emparejamiento óptimo está situado en la diagonal principal. Para mercados cuadrados, describimos sus núcleos utilizando sólo la parte central tridiagonal de elementos de la matriz. Obtenemos una fórmula cerrada para el reparto óptimo de los compradores dentro del núcleo y para el reparto óptimo de los vendedores dentro del núcleo. Analizamos también los mercados no cuadrados reduciéndolos a matrices cuadradas apropiadas.

Monge assignment games

Un juego de asignación se define por una matriz A; donde cada fila representa un comprador y cada columna un vendedor. Si el comprador i se empareja a un vendedor j; el mercado produce aij unidades de utilidad. Estudiamos los juegos de asignación de Monge, es decir, aquellos juegos bilaterales de asignación en los cuales la matriz satisface la propiedad de Monge. Estas matrices pueden caracterizarse por el hecho de que en cualquier submatriz 2x2 un emparejamiento óptimo está situado en la diagonal principal. Para mercados cuadrados, describimos sus núcleos utilizando sólo la parte central tridiagonal de elementos de la matriz. Obtenemos una fórmula cerrada para el reparto óptimo de los compradores dentro del núcleo y para el reparto óptimo de los vendedores dentro del núcleo. Analizamos también los mercados no cuadrados reduciéndolos a matrices cuadradas apropiadas.

Representing geometrical knowledge

This paper introduces perspex algebra which is being developed as a common representation of geometrical knowledge. A perspex can currently be interpreted in one of four ways. First, the algebraic perspex is a generalization of matrices, it provides the most general representation for all of the interpretations of a perspex. The algebraic perspex can be used to describe arbitrary sets of coordinates. The remaining three interpretations of the perspex are all related to square matrices and operate in a Euclidean model of projective space-time, called perspex space. Perspex space differs from the usual Euclidean model of projective space in that it contains the point at nullity. It is argued that the point at nullity is necessary for a consistent account of perspective in top-down vision. Second, the geometric perspex is a simplex in perspex space. It can be used as a primitive building block for shapes, or as a way of recording landmarks on shapes. Third, the transformational perspex describes linear transformations in perspex space that provide the affine and perspective transformations in space-time. It can be used to match a prototype shape to an image, even in so called 'accidental' views where the depth of an object disappears from view, or an object stays in the same place across time. Fourth, the parametric perspex describes the geometric and transformational perspexes in terms of parameters that are related to everyday English descriptions. The parametric perspex can be used to obtain both continuous and categorical perception of objects. The paper ends with a discussion of issues related to using a perspex to describe logic.

Usando a história da resolução de alguns problemas para introduzir conceitos: sistemas lineares, determinantes e matrizes.

In this work we studied the method to solving linear equations system, presented in the book titled "The nine chapters on the mathematical art", which was written in the first century of this era. This work has the intent of showing how the mathematics history can be used to motivate the introduction of some topics in high school. Through observations of patterns which repeats itself in the presented method, we were able to introduce, in a very natural way, the concept of linear equations, linear equations system, solution of linear equations, determinants and matrices, besides the Laplacian development for determinants calculations of square matrices of order bigger than 3, then considering some of their general applications

The Basic Reproduction Number Obtained From Jacobian And Next Generation Matrices - A Case Study Of Dengue Transmission Modelling.

The basic reproduction number is a key parameter in mathematical modelling of transmissible diseases. From the stability analysis of the disease free equilibrium, by applying Routh-Hurwitz criteria, a threshold is obtained, which is called the basic reproduction number. However, the application of spectral radius theory on the next generation matrix provides a different expression for the basic reproduction number, that is, the square root of the previously found formula. If the spectral radius of the next generation matrix is defined as the geometric mean of partial reproduction numbers, however the product of these partial numbers is the basic reproduction number, then both methods provide the same expression. In order to show this statement, dengue transmission modelling incorporating or not the transovarian transmission is considered as a case study. Also tuberculosis transmission and sexually transmitted infection modellings are taken as further examples.

Completion problems for real matrices, II

Thirty years ago, G.N. de Oliveira has proposed the following completion problems: Describe the possible characteristic polynomials of [C-ij], i,j is an element of {1, 2}, where C-1,C-1 and C-2,C-2 are square submatrices, when some of the blocks C-ij are fixed and the others vary. Several of these problems remain unsolved. This paper gives the solution, over the field of real numbers, of Oliveira's problem where the blocks C-1,C-1, C-2,C-2 are fixed and the others vary.

A canonical form for nonderogatory matrices under unitary similarity

A square matrix is nonderogatory if its Jordan blocks have distinct eigenvalues. We give canonical forms for (1) nonderogatory complex matrices up to unitary similarity, and (2) pairs of complex matrices up to similarity, in which one matrix has distinct eigenvalues. The types of these canonical forms are given by undirected and, respectively, directed graphs with no undirected cycles. (C) 2011 Elsevier Inc. All rights reserved.

Square wave adsorptive cathodic stripping voltarnmetry automated by sequential injection analysis - Potentialities and limitations exemplified by the determination of methyl parathion in water samples

This paper describes the development and evaluation of a sequential injection method to automate the determination of methyl parathion by square wave adsorptive cathodic stripping voltammetry exploiting the concept of monosegmented flow analysis to perform in-line sample conditioning and standard addition. Accumulation and stripping steps are made in the sample medium conditioned with 40 mmol L-1 Britton-Robinson buffer (pH 10) in 0.25 mol L-1 NaNO3. The homogenized mixture is injected at a flow rate of 10 mu Ls(-1) toward the flow cell, which is adapted to the capillary of a hanging drop mercury electrode. After a suitable deposition time, the flow is stopped and the potential is scanned from -0.3 to -1.0 V versus Ag/AgCl at frequency of 250 Hz and pulse height of 25 mV The linear dynamic range is observed for methyl parathion concentrations between 0.010 and 0.50 mgL(-1), with detection and quantification limits of 2 and 7 mu gL(-1), respectively. The sampling throughput is 25 h(-1) if the in line standard addition and sample conditioning protocols are followed, but this frequency can be increased up to 61 h(-1) if the sample is conditioned off-line and quantified using an external calibration curve. The method was applied for determination of methyl parathion in spiked water samples and the accuracy was evaluated either by comparison to high performance liquid chromatography with UV detection, or by the recovery percentages. Although no evidences of statistically significant differences were observed between the expected and obtained concentrations, because of the susceptibility of the method to interference by other pesticides (e.g., parathion, dichlorvos) and natural organic matter (e.g., fulvic and humic acids), isolation of the analyte may be required when more complex sample matrices are encountered. (C) 2007 Elsevier B.V. All rights reserved.

Nanostructured screen-printed electrodes modified with self-assembled monolayers for determination of metronidazole in different matrices

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Fourier series for quaternions and the square of the error theorem

In this paper we introduce a type of Hypercomplex Fourier Series based on Quaternions, and discuss on a Hypercomplex version of the Square of the Error Theorem. Since their discovery by Hamilton (Sinegre [1]), quaternions have provided beautifully insights either on the structure of different areas of Mathematics or in the connections of Mathematics with other fields. For instance: I) Pauli spin matrices used in Physics can be easily explained through quaternions analysis (Lan [2]); II) Fundamental theorem of Algebra (Eilenberg [3]), which asserts that the polynomial analysis in quaternions maps into itself the four dimensional sphere of all real quaternions, with the point infinity added, and the degree of this map is n. Motivated on earlier works by two of us on Power Series (Pendeza et al. [4]), and in a recent paper on Liouville’s Theorem (Borges and Mar˜o [5]), we obtain an Hypercomplex version of the Fourier Series, which hopefully can be used for the treatment of hypergeometric partial differential equations such as the dumped harmonic oscillation.

Miniversal deformations of matrices of bilinear forms

Arnold [V.I. Arnold, On matrices depending on parameters, Russian Math. Surveys 26 (2) (1971) 29-43] constructed miniversal deformations of square complex matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced by similarity transformations that smoothly depend on the entries of B. We construct miniversal deformations of matrices under congruence. (C) 2011 Elsevier Inc. All rights reserved.