An improved sum-product estimate for general finite fields

An improved sum-product estimate for subsets of a finite field whose order is not prime is provided. It is shown, under certain conditions, that max{∣∣∣A+A∣∣∣,∣∣∣A⋅A∣∣∣}≫∣∣A∣∣12/11(log2∣∣A∣∣)5/11. This new estimate matches, up to a logarithmic factor, the current best known bound obtained over prime fields by Rudnev

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Automação e robótica nas indústrias brasileiras: um estudo exploratório

A Automação e o processo de Robotização vêm, cada vem mais, se tornando pauta nas discussões de centenas de indústrias brasileiras, onde a tendência clara e identificada é a de investimentos expressivos na melhoria de processos e produtos, por intermédio dessas tecnologias; com foco, sempre que possível, na nacionalização de equipamentos. O presente trabalho tem como objetivo avaliar o modelo proposto por Paul Kennedy (1993) com relação à tendência de Automação e Robotização nas Indústrias Mundiais, analisando o estudo realizado diante de uma economia emergente como a brasileira. Para tanto, foram pesquisadas empresas no Brasil, em diferentes segmentos industriais, o estado da arte em termos de tecnologia de automação e robótica aplicada a processos industriais, e sugerido um modelo diferente do idealizado originalmente por Kennedy. A análise do autor se baseou no teorema que, na matemática discreta, chamamos de “law of the excluded middle”, ou seja, segundo Kennedy, o Brasil estaria vivendo hoje uma migração gradual das indústrias para os países ricos. O Brasil é um exemplo de país industrializado, de economia emergente, que investe intensamente em processos automatizados, mas que não é classificado dentro do grupo desses países ricos. Através da pesquisa realizada será apresentado um novo modelo, no qual países emergentes como o Brasil têm acesso à tecnologia de ponta em automação e robótica, aplicando a mesma em seus processos industriais.

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and translation-invariant propelinear codes are G-linear codes. (C) 2002 Elsevier B.V. B.V. All rights reserved.

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.

Pesquisa em Resolução de Problemas: caminhos, avanços e novas perspectivas

We discuss the knowledge that has been constructed regarding Problem Solving in Math Education as a result of research developed by GTERP - Work and Study Group in Problem Solving, UNESP-Rio Claro/SP. The research is guided by the following general questions: How do students construct mathematical knowledge and how do teachers implement the methodology of Math Teaching-Learning-Evaluation through Problem Solving? Historical aspects of Problem Solving are very important in the configuration of the current trends for Problem Solving. One of them is the Methodology of Math Teaching-Learning- Evaluation through Problem Solving, based on clear foundations and an approach of renewal. In addition to that methodology, two aspects have been developed by the group: The conception of Math as a science of pattern and order and Discrete Mathematics. The knowledge constructed and the scientific production of GTERP prove its relevant contribution to intensifying dialogues between research and educational practice, students and teachers, and to increasing the possibilities of that practice particularly in Math work.

Commutative group codes in R4, R6, R8 and R16-Approaching the bound

Spherical codes in even dimensions n = 2m generated by a commutative group of orthogonal matrices can be determined by a quotient of m-dimensional lattices when the sublattice has an orthogonal basis. We discuss here the existence of orthogonal sublattices of the lattices A2, D3, D4 and E8, which have the best packing density in their dimensions, in order to generate families of commutative group codes approaching the bound presented in Siqueira and Costa (2008) [14]. © 2013 Elsevier B.V. All rights reserved.

Análise combinatória no ensino médio apoiada na metodologia de ensino-aprendizagem-avaliação de matemática através da resolução de problemas

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

Resolução de problemas no cenário da matemática discreta

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

Matemática financeira contextualizada em sistemas de amortização e impostos de renda

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

Uma proposta de oficina de coloração de mapas e grafos para o ensino fundamental e médio

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

A note about splittings of groups and commensurability under a cohomological point of view

Let G be a group, let S be a subgroup with infinite index in G and let FSG be a certain Z2G-module. In this paper, using the cohomological invariant E(G, S, FSG) or simply E˜(G, S) (defined in [2]), we analyze some results about splittings of group G over a commensurable with S subgroup which are related with the algebraic obstruction “singG(S)" defined by Kropholler and Roller ([8]. We conclude that E˜(G, S) can substitute the obstruction “singG(S)" in more general way. We also analyze splittings of groups in the case, when G and S satisfy certain duality conditions.

A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction

The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models.

Cyclic codes through B[X;(a/b)Z_0, with (a/b) in Q^{+} and b=a+1, and Encoding

Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring . For a = 1, almost all the results contained in [16] stands as a very particular case of this study.