RIEMANN ZETA ZEROS AND PRIME NUMBER SPECTRA IN QUANTUM FIELD THEORY

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

On computing discriminants of subfields of Q(zeta(pr))

The conductor-discriminant formula, namely, the Hasse Theorem, states that if a number field K is fixed by a subgroup H of Gal(Q(zeta(n))/Q), the discriminant of K can be obtained from H by computing the product of the conductors of all characters defined modulo n which are associated to K. By calculating these conductors explicitly, we derive a formula to compute the discriminant of any subfield of Q(zeta(p)r), where p is an odd prime and r is a positive integer. (C) 2002 Elsevier B.V. (USA).

Discrete generator coordinate: Symmetry restoration in finite-dimensional spaces

Group theoretical-based techniques and fundamental results from number theory are used in order to allow for the construction of exact projectors in finite-dimensional spaces. These operators are shown to make use only of discrete variables, which play the role of discrete generator coordinates, and their application in the number symmetry restoration is carried out in a nuclear BCS wave function which explicitly violates that symmetry. © 1999 Published by Elsevier Science B.V. All rights reserved.

On computing discriminants of subfields of ℚ (ζp r)

The conductor-discriminant formula, namely, the Hasse Theorem, states that if a number field K is fixed by a subgroup H of Gal(ℚ(ζn)/ℚ), the discriminant of K can be obtained from H by computing the product of the conductors of all characters defined modulo n which are associated to K. By calculating these conductors explicitly, we derive a formula to compute the discriminant of any subfield of ℚ(ζpr), where p is an odd rime and r is a positive integer. © 2002 Elsevier Science USA.

Border detection in digital images: An approach by fuzzy numbers

The purpose of this paper is to introduce a new approach for edge detection in gray shaded images. The proposed approach is based on the fuzzy number theory. The idea is to deal with the uncertainties concerning the gray shades making up the image, and thus calculate the appropriateness of the pixels in relation to an homogeneous region around them. The pixels not belonging to the region are then classified as border pixels. The results have shown that the technique is simple, computationally efficient and with good results when compared with both the traditional border detectors and the fuzzy edge detectors. © 2007 IEEE.

Edge detection in digital images using fuzzy numbers

The purpose of this paper is to introduce a new approach for edge detection in grey shaded images. The proposed approach is based on the fuzzy number theory. The idea is to deal with the uncertainties concerning the grey shades making up the image and, thus, calculate the appropriateness of the pixels in relation to a homogeneous region around them. The pixels not belonging to the region are then classified as border pixels. The results have shown that the technique is simple, computationally efficient and with good results when compared with both the traditional border detectors and the fuzzy edge detectors. Copyright © 2009, Inderscience Publishers.

Two matrix-based lattice construction techniques

Let m and n be integers greater than 1. Given lattices A and B of dimensions m and n, respectively, a technique for constructing a lattice from them of dimension m+n-1 is introduced. Furthermore, if A and B possess bases satisfying certain conditions, then a second technique yields a lattice of dimension m+n-2. The relevant parameters of the new lattices are given in terms of the respective parameters of A,B, and a lattice C isometric to a sublattice of A and B. Denser sphere packings than previously known ones in dimensions 52, 68, 84, 248, 520, and 4098 are obtained. © 2012 Elsevier Inc. All rights reserved.

Reticulados modulares em espaços euclidianos

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

Estudo da estabilidade a pequenas perturbações de sistemas elétricos multimáquinas com dispositivos FACTS do tipo SSSC e controladores suplementares (POD e PSS)

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Sistemas dinâmicos finitos: Paciência Búlgara (Shift em partições e composições cíclicas)

Pós-graduação em Matemática - IBILCE

Discriminante de corpos de números

Pós-graduação em Matemática - IBILCE

Criptografia e curvas elípticas

Pós-graduação em Matemática Universitária - IGCE

Criptografia de chave pública, criptografia RSA

Pós-graduação em Matemática Universitária - IGCE

Um estudo sobre criptografia

Pós-graduação em Matemática Universitária - IGCE