The mechanism of pattern selection in coupled map lattices

The pattern selection of one-dimensional coupled map lattices is studied in this paper. It is shown by spatiotemporal variable separation that there exists a threshold wavelength in pattern selection which possesses wave-like structures in space and periodic chaotic motion in time.

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Diagonal forms, linear algebraic methods and Ramsey-type problems

This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M. Wilson and the author find the general formula for the Smith normal form or diagonal form of N_t(H) for all simple graphs H and for a very general class of t-uniform hypergraphs H.

As a continuation, the author determines the formula for diagonal forms of integer matrices obtained from other combinatorial structures, including incidence matrices for subgraphs of a complete bipartite graph and inclusion matrices for multisets.

One major application of diagonal forms is in zero-sum Ramsey theory. For instance, Caro's results in zero-sum Ramsey numbers for graphs and Caro and Yuster's results in zero-sum bipartite Ramsey numbers can be reproduced. These results are further generalized to t-uniform hypergraphs. Other applications include signed bipartite graph designs.

Research results on some other problems are also included in this thesis, such as a Ramsey-type problem on equipartitions, Hartman's conjecture on large sets of designs and a matroid theory problem proposed by Welsh.

Energy spectrum of fermionized bosonic atoms in optical lattices

We investigate the energy spectrum of fermionized bosonic atoms, which behave very much like spinless noninteracting fermions, in optical lattices by means of the perturbation expansion and the retarded Green's function method. The results show that the energy spectrum splits into two energy bands with single-occupation; the fermionized bosonic atom occupies nonvanishing energy state and left hole has a vanishing energy at any given momentum, and the system is in Mott-insulating state with a energy gap. Using the characteristic of energy spectra we obtained a criterion with which one can judge whether the Tonks-Girardeau (TG) gas is achieved or not.

Energy spectrum of two-component Bose-Einstein condensates in optical lattices

With the method of Green's function, we investigate the energy spectra of two-component ultracold bosonic atoms in optical lattices. We End that there are two energy bands for each component. The critical condition of the superfluid-Mott insulator phase transition is determined by the energy band structure. We also find that the nearest neighboring and on-site interactions fail to change the structure of energy bands, but shift the energy bands only. According to the conditions of the phase transitions, three stable superfluid and Mott insulating phases can be found by adjusting the experiment parameters. We also discuss the possibility of observing these new phases and their transitions in further experiments.

Energy spectrum of ground state and excitation spectrum of quasi-particle for hard-core boson in optical lattices

We investigate the energy spectrum of ground state and quasi-particle excitation spectrum of hard-core bosons, which behave very much like spinless noninteracting fermions, in optical lattices by means of the perturbation expansion and Bogoliubov approach. The results show that the energy spectrum has a single band structure, and the energy is lower near zero momentum; the excitation spectrum gives corresponding energy gap, and the system is in Mott-insulating state at Tonks limit. The analytic result of energy spectrum is in good agreement with that calculated in terms of Green's function at strong correlation limit.

Um método SN híbrido direto para cálculos de sistemas combustível-moderador em geometria unidimensional

Desenvolvemos nesta dissertação um método híbrido direto para o cálculo do fator de desvantagem e descrição da distribuição do fluxo de nêutrons em sistemas combustível-moderador. Na modelagem matemática, utilizamos a equação de transporte de Boltzmann independente do tempo, considerando espalhamento linearmente anisotrópico no modelo monoenergético e espalhamento isotrópico no modelo multigrupo, na formulação de ordenadas discretas (SN), em geometria unidimensional. Desenvolvemos nesta dissertação um método híbrido direto para o cálculo do fator de desvantagem e descrição da distribuição do fluxo de nêutrons em sistemas combustível-moderador. Na modelagem matemática, utilizamos a equação de transporte de Boltzmann independente do tempo, considerando espalhamento linearmente anisotrópico no modelo monoenergético e espalhamento isotrópico no modelo multigrupo, na formulação de ordenadas discretas (SN), em geometria unidimensional. Descrevemos uma análise espectral das equações de ordenadas discretas (SN)a um grupo e a dois grupos de energia, onde seguimos uma analogia com o método de Case. Utilizamos, neste método, quadraturas angulares diferentes no combustível (NC) e no moderador (NM), onde em geral assumimos que NC > NM . Condições de continuidade especiais que acoplam os fluxos angulares que emergem do combustível (moderador) e incidem no moderador (combustível), foram utilizadas com base na equivalência entre as equações SN e PN-1, o que caracteriza a propriedade híbrida do modelo proposto. Sendo um método híbrido direto, utilizamos as NC + NM equações lineares e algébricas constituídas pelas (NC + NM)/2 condições de contorno reflexivas e (NC + NM)/2 condições de continuidade para determinarmos as NC + NM constantes. Com essas constantes podemos calcular os valores dos fluxos angulares e dos fluxos escalares em qualquer ponto do domínio. Apresentamos resultados numéricos para ilustrar a eficiência e a precisão do método proposto.

Algebraic Techniques in Coding Theory: Entropy Vectors, Frames, and Constrained Coding

The study of codes, classically motivated by the need to communicate information reliably in the presence of error, has found new life in fields as diverse as network communication, distributed storage of data, and even has connections to the design of linear measurements used in compressive sensing. But in all contexts, a code typically involves exploiting the algebraic or geometric structure underlying an application. In this thesis, we examine several problems in coding theory, and try to gain some insight into the algebraic structure behind them.

The first is the study of the entropy region - the space of all possible vectors of joint entropies which can arise from a set of discrete random variables. Understanding this region is essentially the key to optimizing network codes for a given network. To this end, we employ a group-theoretic method of constructing random variables producing so-called "group-characterizable" entropy vectors, which are capable of approximating any point in the entropy region. We show how small groups can be used to produce entropy vectors which violate the Ingleton inequality, a fundamental bound on entropy vectors arising from the random variables involved in linear network codes. We discuss the suitability of these groups to design codes for networks which could potentially outperform linear coding.

The second topic we discuss is the design of frames with low coherence, closely related to finding spherical codes in which the codewords are unit vectors spaced out around the unit sphere so as to minimize the magnitudes of their mutual inner products. We show how to build frames by selecting a cleverly chosen set of representations of a finite group to produce a "group code" as described by Slepian decades ago. We go on to reinterpret our method as selecting a subset of rows of a group Fourier matrix, allowing us to study and bound our frames' coherences using character theory. We discuss the usefulness of our frames in sparse signal recovery using linear measurements.

The final problem we investigate is that of coding with constraints, most recently motivated by the demand for ways to encode large amounts of data using error-correcting codes so that any small loss can be recovered from a small set of surviving data. Most often, this involves using a systematic linear error-correcting code in which each parity symbol is constrained to be a function of some subset of the message symbols. We derive bounds on the minimum distance of such a code based on its constraints, and characterize when these bounds can be achieved using subcodes of Reed-Solomon codes.

Combinatorial properties of finite geometric lattices

Let L be a finite geometric lattice of dimension n, and let w(k) denote the number of elements in L of rank k. Two theorems about the numbers w(k) are proved: first, w(k) ≥ w(1) for k = 2, 3, ..., n-1. Second, w(k) = w(1) if and only if k = n-1 and L is modular. Several corollaries concerning the "matching" of points and dual points are derived from these theorems.

Both theorems can be regarded as a generalization of a theorem of de Bruijn and Erdös concerning ʎ= 1 designs. The second can also be considered as the converse to a special case of Dilworth's theorem on finite modular lattices.

These results are related to two conjectures due to G. -C. Rota. The "unimodality" conjecture states that the w(k)'s form a unimodal sequence. The "Sperner" conjecture states that a set of non-comparable elements in L has cardinality at most max/k {w(k)}. In this thesis, a counterexample to the Sperner conjecture is exhibited.

Varieties generated by modular lattices of width four

A variety (equational class) of lattices is said to be finitely based if there exists a finite set of identities defining the variety. Let M^∞_n denote the lattice variety generated by all modular lattices of width not exceeding n. M^∞₁ and M^∞₂ are both the class of all distributive lattices and consequently finitely based. B. Jónsson has shown that M^∞₃ is also finitely based. On the other hand, K. Baker has shown that M^∞_n is not finitely based for 5 ≤ n ˂ ω. This thesis settles the finite basis problem for M^∞₄. M^∞₄ is shown to be finitely based by proving the stronger result that there exist ten varieties which properly contain M^∞₄ and such that any variety which properly contains M^∞₄ contains one of these ten varieties.

The methods developed also yield a characterization of sub-directly irreducible width four modular lattices. From this characterization further results are derived. It is shown that the free M^∞₄ lattice with n generators is finite. A variety with exactly k covers is exhibited for all k ≥ 15. It is further shown that there are 2^Ӄo sub- varieties of M^∞₄.

Directional algebraic reconstruction technique for electrical impedance tomography

We assume that the resistance matrix can be found in electrical impedance tomography from the assumption of linear dependence between the voltages and the currents and with the help of the resistance matrix and the transfer impedance between the electrodes, a directional algebraic reconstruction technique is proposed. The goal is to reconstruct the resistivity distribution by weighting the matrices that are obtained by calculating the orthogonal distance of the underlying mesh elements from the neighbouring port resistivity lines. These weighting matrices, which only depend on the topology of the underlying mesh, can be calculated offline and result in a computationally efficient online procedure with a reasonable image reconstruction performance. Simulation results are provided to validate this approach.