Graphene, a honeycomb lattice of sp2-bonded carbon atoms, has received considerable attention in the scientific community due to its unique electronic properties. Distinct symmetries of the graphene wave functions lead to unusual quantum properties, such as a unique half-integer quantum Hall effect. As an added consequence of these symmetries, back-scattering in graphene is strongly prohibited leading to long coherence lengths of carriers. These charge carriers at low energy exhibit linear energy-momentum dispersion, much like neutrinos. Thus, carriers in graphene can be described as massless Dirac fermions. Graphene grown epitaxially on semiconducting substrates offers the possibility of large-scale production and deterministic patterning of graphene for nanoelectronics. In this work, epitaxial graphene is created on SiC(0001) by annealing in vacuum. Sequential scanning tunneling microscopy (STM) and spectroscopy (STS) are performed in ultrahigh vacuum at a temperature of 4.2 K and 300 K. These atomic-scale studies address the growth, interfacial properties, stacking order, and quasiparticle coherence in epitaxial graphene. STM topographic images show the atomic structure of successive graphene layers on the SiC substrate, as well as the character of defects and adatoms within and below the graphene plane. STS differential conductance (dI/dV) maps provide spatially and energy resolved snapshots of the local density of states. Such maps clearly show that scattering from atomic defects in graphene gives rise to energy-dependent standing wave patterns. We derive the carrier energy dispersion of epitaxial graphene from these data sets by quantifying the dominant wave vectors of the standing waves for each tunneling bias.

A critical set in a Latin square of order n is a set of entries in an n x n array which can be embedded in precisely one Latin square of order n, with the property that if any entry of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. The number of critical sets grows super-exponentially as the order of the Latin square increases. It is difficult to find patterns in Latin squares of small order (order 5 or less) which can be generalised in the process of creating new theorems. Thus, I have written many algorithms to find critical sets with various properties in Latin squares of order greater than 5, and to deal with other related structures. Some algorithms used in the body of the thesis are presented in Chapter 3; results which arise from the computational studies and observations of the patterns and subsequent results are presented in Chapters 4, 5, 6, 7 and 8. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that lcs(n)<=n2-n. In Chapter 4, it is shown that lcs(n)<=n2-3n+3. Chapter 5 provides new bounds on the maximum number of intercalates in Latin squares of orders mX2^alpha (m odd, alpha>=2) and mX2^alpha+1 (m odd, alpha>=2 and alpha not equal to 3), and a new lower bound on lcs(4m). It also discusses critical sets in intercalate-rich Latin squares of orders 11 and 14. In Chapter 6 a construction is given which verifies the existence of a critical set of size n2 divided by 4 + 1 when n is even and n>=6. The construction is based on the discovery of a critical set of size 17 for a Latin square of order 8. In Chapter 7 the representation of Steiner trades of volume less than or equal to nine is examined. Computational results are used to identify those trades for which the associated partial Latin square can be decomposed into six disjoint Latin interchanges. Chapter 8 focusses on critical sets in Latin squares of order at most six and extensive computational routines are used to identify all the critical sets of different sizes in these Latin squares.

A critical set in a Latin square of order n is a set of entries in an n x n array which can be embedded in precisely one Latin square of order n, with the property that if any entry of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. The number of critical sets grows super-exponentially as the order of the Latin square increases. It is difficult to find patterns in Latin squares of small order (order 5 or less) which can be generalised in the process of creating new theorems. Thus, I have written many algorithms to find critical sets with various properties in Latin squares of order greater than 5, and to deal with other related structures. Some algorithms used in the body of the thesis are presented in Chapter 3; results which arise from the computational studies and observations of the patterns and subsequent results are presented in Chapters 4, 5, 6, 7 and 8. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978 Curran and van Rees proved that lcs(n)<=n2-n. In Chapter 4, it is shown that lcs(n)<=n2-3n+3. Chapter 5 provides new bounds on the maximum number of intercalates in Latin squares of orders mX2^alpha (m odd, alpha>=2) and mX2^alpha+1 (m odd, alpha>=2 and alpha not equal to 3), and a new lower bound on lcs(4m). It also discusses critical sets in intercalate-rich Latin squares of orders 11 and 14. In Chapter 6 a construction is given which verifies the existence of a critical set of size n2 divided by 4 + 1 when n is even and n>=6. The construction is based on the discovery of a critical set of size 17 for a Latin square of order 8. In Chapter 7 the representation of Steiner trades of volume less than or equal to nine is examined. Computational results are used to identify those trades for which the associated partial Latin square can be decomposed into six disjoint Latin interchanges. Chapter 8 focusses on critical sets in Latin squares of order at most six and extensive computational routines are used to identify all the critical sets of different sizes in these Latin squares.

Made available in DSpace on 2014-12-17T15:47:46Z (GMT). No. of bitstreams: 1 HelidaSS.pdf: 334424 bytes, checksum: 422d5bbc96e55f5ae734f2475813b59f (MD5) Previous issue date: 2008-02-15 / Monoidal logic, ML for short, which formalized the fuzzy logics of continuous t-norms and their residua, has arisen great interest, since it has been applied to fuzzy mathematics, artificial intelligence, and other areas. It is clear that fuzzy logics basically try to represent imperfect or fuzzy information aiming to model the natural human reasoning. On the other hand, in order to deal with imprecision in the computational representation of real numbers, the use of intervals have been proposed, as it can guarantee that the results of numerical computation are in a bounded interval, controlling, in this way, the numerical errors produced by successive roundings. There are several ways to connect both areas; the most usual one is to consider interval membership degrees. The algebraic counterpart of ML is ML-algebra, an interesting structure due to the fact that by adding some properties it is possible to reach different classes of residuated lattices. We propose to apply an interval constructor to ML-algebras and some of their subclasses, to verify some properties within these algebras, in addition to the analysis of the algebraic aspects of them

Cette thèse traite de deux problèmes en géométrie hyperbolique réelle et complexe. On étudie dans un premier temps des structures géométriques sur des espaces de modules de métriques plates à singularités coniques sur la sphère. D'après des travaux de W. Thurston, l'espace de modules des métriques plates sur S^2 à n singularités coniques d'angles donnés admet une structure de variété hyperbolique complexe non complète, dont le complété métrique est une variété conique hyperbolique complexe. On étudie dans cette thèse des formes réelles de ces espaces complexes en se restreignant à des métriques invariantes par une involution. On décrit une structure hyperbolique réelle sur les espaces de modules de métriques plates symétriques à 6 (respectivement 8) singularités d'angles égaux. On décrit les composantes connexes de ces espaces comme ouverts denses d'orbifolds hyperboliques arithmétiques. On montre que les complétés métriques de ces composantes connexes admettent un recollement naturel, dont on étudie la structure.La deuxième partie de cette thèse traite des ensembles limites de groupes discrets d'isométries du plan hyperbolique complexe. On construit le premier exemple explicite de sous-groupe discret de PU(2,1) dont l'ensemble limite est homéomorphe à l'éponge de Menger / This thesis is concerned with two problems in real and complex hyperbolic geometry. The first problem is the study of geometric structures on moduli spaces of flat metrics on the sphere with cone singularities. W. Thurston proved that the moduli space of flat metrics on S^2 with n singularities of given angles forms a non complete complex hyperbolic manifold, and that its metric completion is a complex hyperbolic cone-manifold. In this thesis we study real forms of these complex spaces by restricting our attention to metrics that are invariant under an involution. We describe a real hyperbolic structure on moduli spaces of flat symmetric metrics of 6 (respectively 8) singularities of same angle. We describe explicitly the connected components of these spaces as dense open subsets of arithmetic hyperbolic orbifolds. We show that the metric completions of these components admit a natural gluing, and we study the structure of the glued space. The second part of this thesis is devoted to the study of limit sets of discrete subgroups of the isometry group of complex hyperbolic plane. We construct the first known explicit example of a discrete subgroup of PU(2,1) which admits a limit set homeomorphic to the Menger curve

Made available in DSpace on 2014-10-09T12:49:06Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:06:38Z (GMT). No. of bitstreams: 1 09670.pdf: 10232628 bytes, checksum: 1590f43108c1cbc7b2065202eea72fa8 (MD5) / Dissertacao (Mestrado) / IPEN/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP

Neste trabalho estudamos o comportamento crítico do modelo de Potts p-estados na árvore de Cayley, através das propriedades do conjunto de zeros de Yang-Lee da função de partição. Tratando a transformação do grupo de renormalização como um mapeamento racional na esfera de Riemann utiliza-se alguns resultados da teoria de Julia e Fatou para obter-se uma descrição geométrica do comportamento crítico do modelo. Mostra-se de que forma o conjunto de zeros de Yang-Lee se relaciona com o conjunto de Julia do mapa do grupo de renormalização, e calculam-se alguns parâmetros geométricos desse conjunto que descrevem o comportamento não universal do modelo. / We study the critical behavior of the p-state Potts model on a Cayley tree, looking for the properties of the Yang-Lee zeros set of the partition function. We treated the renormalization group transformation as a rational mapping on the Riemann sphere, and use some results from the Julia and Fatou theory to obtain a geometrical description of the critical properties of the model. We show how the Yang-Lee zeros set is associated with the Julia set of the renormalization group map, and we also calculate some geometrical parameters of this set which describes the non-universal behavior of the model.

Orientador: Sueli Irene Rodrigues Costa / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-10T10:56:09Z (GMT). No. of bitstreams: 1 Strapasson_JoaoEloir_D.pdf: 1100322 bytes, checksum: 054aeab4b36f30144155ce6b1668659a (MD5) Previous issue date: 2007 / Resumo: Este trabalho está dividido em duas partes. A primeira e dedicada ao problema de encontrar o menor vetor não nulo de um reticulado. Este é um problema de alta complexidade computacional e que tem grande interesse tanto para a Teoria dos Códigos, como para diversas outras áreas. Esse mínimo está associado a performance do reticulado em termos da codificação: quanto maior for a razão entre este mínimo e o determinante do reticulado, melhor e a distribuição dos pontos no espaço (alta densidade de empacotamento). Nesta tese demos ênfase ao caso especial dos reticulados obtidos por uma projeção ortogonal do reticulado n-dimensional dos inteiros na direção de seus elementos. Tais reticulados estão associados ao problema de codificação contínua fonte/canal. Mostramos nos casos tri e quadridimensionais em que condições podemos garantir reticulados bons, ou seja, com alta densidade de empacotamento. Neste processo foram também construídos dois novos algoritmos, um para cálculo da base de Minkowski de um reticulado e outro específico para a busca da norma mínima do reticulado-projeção. Na segunda parte trabalhamos com grafos em toros planares que são quocientes de reticulados, os quais são isomorfos a grafos circulantes. Estabelecemos a conexão entre estes códigos esféricos rotulados por grupos cíclicos e códigos perfeitos na métrica de Lee. A partir de tal associação foram também obtidos resultados sobre o gênero 1 e a determinação do dos gênero de uma classe especial de grafos circulantes que tem número arbitrariamente grande de conexões (grau) / Abstract: The research developed here is related and inspired by problems in coding theory. It is presented in two parts. In the first we focus on the search for the minimum nonvanishing vector of a lattice, specially in the case of a projection of the ndimensional integer lattice in the direction of one of its vectors. This is a problem of high computational complexity which is related to the search for efficient joint sourcechannel continuous coding. In the second part we deal with flat torus graphs generated by a quotient of lattices and which are labeled by a a cyclic group of isometries. We show that any circulant graph is isomorphic to one of these graphs and hence associated to a spherical code. Through these isomorphism a complete classification of circulant graphs of genus one and the genus of an arbitrarily high order class of circulant graphs is obtained. / Doutorado / Geometria Topologia / Doutor em Matemática

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work we study the critical properties of the spin-1 Blume-Capel model in two dimensions on Voronoi- Delaunay random lattices with quenched connectivity disorder. The system is treated by applying Monte Carlo simulations using the heat-bath update algorithm together with single histograms re-weighting tech- niques. We calculate the critical temperature as well as the critical exponents as a function of the crystal field -. It is found that this disordered system exhibits phase transitions of first- and second-order types that de- pend on the value of the crystal field. For values of - ≤ 3, where the nearest-neighbor exchange interaction J has been set to unity, the disordered system presents a second-order phase transition. The results suggest that the corresponding exponents ratio belong to the same universality class as the regular two-dimensional ferromagnetic model. There exists a tricritical point close to -t = 3:05(4) with different critical exponents. For -t ≤ - < 3:4 this model undergoes a first-order phase transition. Finally, for - ≥ 3:4 the system is always in the paramagnetic phase. / Neste trabalho estudamos as propriedades críticas do modelo Blume-Capel spin-1 em redes aleatórias de Voronoi-Delaunay em duas dimensões com desordem temperada nas conectividades. O sistema é tratado pela aplicação de simulações de Monte Carlo usando o algoritmo de banho térmico de atualização em con- junto com a técnica de repesagem do histograma simples. Nós calculamos a temperatura crítica bem como os expoentes críticos como função do campo cristalino -. Verificou-se que este sistema desordenado exibe transições de fases do tipo primeira e segunda ordem que dependem do valor do campo cristalino. Para valores de - ≤ 3, onde a interação de troca de primeiros vizinhos J foi definida como unidade, o sistema desordenado apresenta uma transição de fase de segunda ordem. Os resultados sugerem que a correspon- dente relação dos expoentes pertencem à mesma classe de universalidade como o modelo ferromagnético bidimensional regular. Existe um ponto tricrítico próximo de -t = 3:05(4) com diferentes expoentes críti- cos . Para -t ≤ - < 3:4 este modelo mostra uma transição de fase de primeira ordem. Finalmente, para - ≥ 3:4 o sistema é sempre na fase paramagnética. / São Cristóvão, SE

Made available in DSpace on 2014-10-09T12:49:06Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:06:38Z (GMT). No. of bitstreams: 1 09670.pdf: 10232628 bytes, checksum: 1590f43108c1cbc7b2065202eea72fa8 (MD5) / Dissertacao (Mestrado) / IPEN/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP