No abstract

Se reduce el cálculo de los grupos de cohomologíA Hi(G,U) para el caso en que G es el grupo de Galois de una extensión cíclica finita L/K de cuerpos numéricos y B el anillo de enteros de L; utilizando sucesiones exactas de grupos de cohomología y un teorema de localización.

Abstract-This paper presents the implementation of a parallelization strategy using the OpenMP library, while developing a simulation tool based on a cellular automaton (CA) to run urban growth simulations. The characterization of an urban growth model CA is shown and it consists of a digitization process of the land use in order to get all the necessary elements for the CA to work. During the first simulation tests we noticed high processing times due to large quantity of calculations needed to perform one single simulation, in order to minimize this we implemented a parallelization strategy using the fork-join model in order to optimize the use of available hardware. The results obtained show a significant improvement in execution times in function of the number of available cores and map sizes, as a future work, it is planned to implement artificial neural networks in order to generate more complex urban growth scenarios.

We construct S 2 -sets contained in the integer interval I q − 1 := [1, q − 1] with q = p^n,p a prime number and n ∈ Z +, by using the p-adic expansion of integers. Such sets comefrom considering p-cycles of length n. We give some criteria in particular cases whichallow us to glue them to obtain good S 2 -sets. After that we construct algebraic curvesover the finite field F q with many rational points via minimal (F p , F p )-polynomials whose exponent is an S 2 -set.

No abstract