Landau and Kolmogoroff type polynomial inequalities

Let 0integers. Denote by parallel to . parallel to the norm parallel to f parallel to(2) = integral(-infinity)(infinity) f(2)(x) exp(-x(2)) dx. For various positive values of A and B we establish Kolmogoroff type inequalitiesparallel to f((f))parallel to(2) less than or equal to A parallel to f(m)parallel to + B parallel to f parallel to/ A theta(k) + B mu(k),with certain constants theta(k)e mu(k), which hold for every f is an element of pi(n) (pi(n) denotes the space of real algebraic polynomials of degree not exceeding n).For the particular case j=1 and m=2, we provide a complete characterisation of the positive constants A and B, for which the corresponding Landau type polynomial inequalities parallel to f'parallel to less than or equal toA parallel to f parallel to + B parallel to f parallel to/ A theta(k) + B mu(k)hold. In each case we determine the corresponding extremal polynomials for which equalities are attained.

An Extension of Craig's Family of Lattices

Let p be a prime, and let zeta(p) be a primitive p-th root of unity. The lattices in Craig's family are (p - 1)-dimensional and are geometrical representations of the integral Z[zeta(p)]-ideals < 1 - zeta(p)>(i), where i is a positive integer. This lattice construction technique is a powerful one. Indeed, in dimensions p - 1 where 149 <= p <= 3001, Craig's lattices are the densest packings known. Motivated by this, we construct (p - 1)(q - 1)-dimensional lattices from the integral Z[zeta(pq)]-ideals < 1 - zeta(p)>(i) < 1 - zeta(q)>(j), where p and q are distinct primes and i and fare positive integers. In terms of sphere-packing density, the new lattices and those in Craig's family have the same asymptotic behavior. In conclusion, Craig's family is greatly extended while preserving its sphere-packing properties.

Constructions of algebraic lattices

In this work we present constructions of algebraic lattices in Euclidean space with optimal center density in dimensions 2, 3, 4, 6, 8 and 12, which are rotated versions of the lattices Λn, for n = 2,3,4,6,8 and K12. These algebraic lattices are constructed through twisted canonical homomorphism via ideals of a ring of algebraic integers. Mathematical subject classification: 18B35, 94A15, 20H10.

Exact static soliton solutions of (3+1)-dimensional integrable theory with nonzero Hopf numbers

In this paper, we explicitly construct an infinite number of Hopfions (static, soliton solutions with nonzero Hopf topological charges) within the recently proposed (3 + 1)-dimensional, integrable, and relativistically invariant field theory. Two integers label the family of Hopfions we have found. Their product is equal to the Hopf charge which provides a lower bound to the soliton's finite energy. The Hopfions are explicitly constructed in terms of the toroidal coordinates and shown to have a form of linked closed vortices.

On the Optimality of Finite Constellations from Algebraic Lattices

A construction technique of finite point constellations in n-dimensional spaces from ideals in rings of algebraic integers is described. An algorithm is presented to find constellations with minimum average energy from a given lattice. For comparison, a numerical table of lattice constellations and group codes is computed for spaces of dimension two, three, and four. © 2001.

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 the construction and labelling of geometrically uniform signal sets in ℤ2 matched to additive quotient groups

We establish the conditions under which it is possible to construct signal sets satisfying the properties of being geometrically uniform and matched to additive quotient groups. Such signal sets consist of subsets of signal spaces identified to integers rings ℤ[i] and ℤ[ω] in ℤ2. © 2008 KSCAM and Springer-Verlag.

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.

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

Unidades em corpos abelianos

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

Explorando a matemática do número Ф, o número de ouro

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

Criptografia de chave pública, criptografia RSA

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

Números transcedentes e de Liouville

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

Corpos cujo condutor é potência de primo: caracterização e reticulados ideais associados

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

Reconfiguração de sistemas de distribuição utilizando metaheurísticas e critérios de confiabilidade

In an ever more competitive environment, power distribution companies must satisfy two conflicting objectives: minimizing investment costs and the satisfaction of reliability targets. The network reconfiguration of a distribution system is a technique that well adapts to this new deregulated environment for it allows improvement of reliability indices only opening and closing switches, without the onus involved in acquiring new equipment. Due to combinatorial explosion problem characteristic, in the solution are employed metaheuristics methods, which converge to optimal or quasi-optimal solutions, but with a high computational effort. As the main objective of this work is to find the best configuration(s) of the distribution system with the best levels of reliability, the objective function used in the metaheuristics is to minimize the LOLC - Loss Of Load Cost, which is associated with both, number and duration of electric power interruptions. Several metaheuristics techniques are tested, and the tabu search has proven to be most appropriate to solve the proposed problem. To characterize computationally the problem of the switches reconfiguring was developed a vector model (with integers) of the representation of the switches, where each normally open switch is associated with a group of normally closed switches. In this model simplifications have been introduced to reduce computational time and restrictions were made to exclude solutions that do not supply energy to any load point of the system. To check violation of the voltage and loading criteria a study of power flow for the ten best solutions is performed. Also for the ten best solutions a reliability evaluation using Monte Carlo sequential simulation is performed, where it is possible to obtain the probability distributions of the indices and thus calculate the risk of paying penalty due to not meeting the goals. Finally, the methodology is applied in a real Brazilian distribution network, and the results are discussed.