A SURVEY OF DISTANCE MAGIC GRAPHS

In this report, we survey results on distance magic graphs and some closely related graphs. A distance magic labeling of a graph G with magic constant k is a bijection l from the vertex set to {1, 2, . . . , n}, such that for every vertex x Σ l(y) = k,y∈NG(x) where NG(x) is the set of vertices of G adjacent to x. If the graph G has a distance magic labeling we say that G is a distance magic graph. In Chapter 1, we explore the background of distance magic graphs by introducing examples of magic squares, magic graphs, and distance magic graphs. In Chapter 2, we begin by examining some basic results on distance magic graphs. We next look at results on different graph structures including regular graphs, multipartite graphs, graph products, join graphs, and splitting graphs. We conclude with other perspectives on distance magic graphs including embedding theorems, the matrix representation of distance magic graphs, lifted magic rectangles, and distance magic constants. In Chapter 3, we study graph labelings that retain the same labels as distance magic labelings, but alter the definition in some other way. These labelings include balanced distance magic labelings, closed distance magic labelings, D-distance magic labelings, and distance antimagic labelings. In Chapter 4, we examine results on neighborhood magic labelings, group distance magic labelings, and group distance antimagic labelings. These graph labelings change the label set, but are otherwise similar to distance magic graphs. In Chapter 5, we examine some applications of distance magic and distance antimagic labeling to the fair scheduling of tournaments. In Chapter 6, we conclude with some open problems.

Circunferências mágicas

(...) A ideia original das circunferências mágicas remonta pelo menos à segunda edição do livro “Magic Squares and Cubes”, de W. S. Andrews. A publicação data de 1917, há quase um século, e conta com contributos de diferentes autores. A secção dedicada às circunferências mágicas é da autoria de Harry A. Sayles. (...) O leitor provavelmente já encontrou um padrão: quando usamos números de 1 a n, a soma dos números dos pontos de intersecção de duas quaisquer circunferências deve ser n+1. No desafio apresentado na Fig. A usamos os números de 1 a 40, logo a soma dos números dos pontos de intersecção de duas quaisquer circunferências deve ser igual a 41! Além disso, 205=5x41 (cada circunferência tem dez números e 5 é metade de 10). A descoberta da solução do desafio da Fig. A é, agora, imediata. Esta é a grande vantagem da Matemática. Depois de descoberto um padrão, tudo se torna mais claro. O sentimento é o mesmo de um míope quando coloca os óculos na cara: passa a ver a realidade com outra nitidez. (...)

Exercise sheet 3

Exercises and solutions in LaTex

Exercise sheet 3 pdf

Exercises and solutions in PDF

Mathematical recreations and problems of past and present times.

Some arithmetical questions.--Some geometrical questions.--Some mechanical questions.--Some miscellaneous questions.--Magic squares.--Unicursal problems.--Three geometrical problems.--Astrology.--Hyper-space.--Time and its measurement.--The constitution of matter.

Das Problem der magischen Systeme.

Available on demand as hard copy or computer file from Cornell University Library.

Investigation of different apple cultivars by high resolution magic angle spinning NMR. A feasibility study

(1)H HR-MAS NMR spectroscopy was applied to apple tissue samples deriving from 3 different cultivars. The NMR data were statistically evaluated by analysis of variance (ANOVA), principal component analysis (PCA), and partial least-squares-discriminant analysis (PLS-DA). The intra-apple variability of the compounds was found to be significantly lower than the inter-apple variability within one cultivar. A clear separation of the three different apple cultivars could be obtained by multivariate analysis. Direct comparison of the NMR spectra obtained from apple tissue (with HR-MAS) and juice (with liquid-state HR NMR) showed distinct differences in some metabolites, which are probably due to changes induced by juice preparation. This preliminary study demonstrates the feasibility of (1)H HR-MAS NMR in combination with multivariate analysis as a tool for future chemometric studies applied to intact fruit tissues, e.g. for investigating compositional changes due to physiological disorders, specific growth or storage conditions.

Exploring High-resolution Magic Angle Spinning (HR-MAS) NMR Spectroscopy for Metabonomic Analysis of Apples

Classical liquid-state high-resolution (HR) NMR spectroscopy has proved a powerful tool in the metabonomic analysis of liquid food samples like fruit juices. In this paper the application of (1)H high-resolution magic angle spinning (HR-MAS) NMR spectroscopy to apple tissue is presented probing its potential for metabonomic studies. The (1)H HR-MAS NMR spectra are discussed in terms of the chemical composition of apple tissue and compared to liquid-state NMR spectra of apple juice. Differences indicate that specific metabolic changes are induced by juice preparation. The feasibility of HR-MAS NMR-based multivariate analysis is demonstrated by a study distinguishing three different apple cultivars by principal component analysis (PCA). Preliminary results are shown from subsequent studies comparing three different cultivation methods by means of PCA and partial least squares discriminant analysis (PLS-DA) of the HR-MAS NMR data. The compounds responsible for discriminating organically grown apples are discussed. Finally, an outlook of our ongoing work is given including a longitudinal study on apples.

Petroleomics By Electrospray Ionization Ft-icr Mass Spectrometry Coupled To Partial Least Squares With Variable Selection Methods: Prediction Of The Total Acid Number Of Crude Oils.

Negative-ion mode electrospray ionization, ESI(-), with Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR MS) was coupled to a Partial Least Squares (PLS) regression and variable selection methods to estimate the total acid number (TAN) of Brazilian crude oil samples. Generally, ESI(-)-FT-ICR mass spectra present a power of resolution of ca. 500,000 and a mass accuracy less than 1 ppm, producing a data matrix containing over 5700 variables per sample. These variables correspond to heteroatom-containing species detected as deprotonated molecules, [M - H](-) ions, which are identified primarily as naphthenic acids, phenols and carbazole analog species. The TAN values for all samples ranged from 0.06 to 3.61 mg of KOH g(-1). To facilitate the spectral interpretation, three methods of variable selection were studied: variable importance in the projection (VIP), interval partial least squares (iPLS) and elimination of uninformative variables (UVE). The UVE method seems to be more appropriate for selecting important variables, reducing the dimension of the variables to 183 and producing a root mean square error of prediction of 0.32 mg of KOH g(-1). By reducing the size of the data, it was possible to relate the selected variables with their corresponding molecular formulas, thus identifying the main chemical species responsible for the TAN values.

Estimation and prediction of parameters and breeding values in soybean using REML/BLUP and Least Squares

The aim of this study was to compare REML/BLUP and Least Square procedures in the prediction and estimation of genetic parameters and breeding values in soybean progenies. F(2:3) and F(4:5) progenies were evaluated in the 2005/06 growing season and the F(2:4) and F(4:6) generations derived thereof were evaluated in 2006/07. These progenies were originated from two semi-early, experimental lines that differ in grain yield. The experiments were conducted in a lattice design and plots consisted of a 2 m row, spaced 0.5 m apart. The trait grain yield per plot was evaluated. It was observed that early selection is more efficient for the discrimination of the best lines from the F(4) generation onwards. No practical differences were observed between the least square and REML/BLUP procedures in the case of the models and simplifications for REML/BLUP used here.

A NEW PROOF OF OKAJI'S THEOREM FOR A CLASS OF SUM OF SQUARES OPERATORS

Let P be a linear partial differential operator with analytic coefficients. We assume that P is of the form ""sum of squares"", satisfying Hormander's bracket condition. Let q be a characteristic point; for P. We assume that q lies on a symplectic Poisson stratum of codimension two. General results of Okaji Show that P is analytic hypoelliptic at q. Hence Okaji has established the validity of Treves' conjecture in the codimension two case. Our goal here is to give a simple, self-contained proof of this fact.

Normal Versus Pathological Voice Signals Using Wavelet Analysis and Least Squares Support-Vector Machines

State of Sao Paulo Research Foundation (FAPESP)

An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.