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.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.

Comparing skew Schur functions: a quasisymmetric perspective

Reiner, Shaw and van Willigenburg showed that if two skew Schur functions sA and sB are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that sA and sB have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true. In fact, we work in terms of inequalities, showing that if the F-support of sA contains that of sB, then the row overlap partitions of A are dominated by those of B, and again conjecture that the converse also holds. Our evidence in favor of these conjectures includes their consistency with a complete determination of all F-support containment relations for F-multiplicity-free skew Schur functions. We conclude with a consideration of how some other quasisymmetric bases fit into our framework.

Applications of finite geometries to designs and codes

This dissertation concerns the intersection of three areas of discrete mathematics: finite geometries, design theory, and coding theory. The central theme is the power of finite geometry designs, which are constructed from the points and t-dimensional subspaces of a projective or affine geometry. We use these designs to construct and analyze combinatorial objects which inherit their best properties from these geometric structures. A central question in the study of finite geometry designs is Hamada’s conjecture, which proposes that finite geometry designs are the unique designs with minimum p-rank among all designs with the same parameters. In this dissertation, we will examine several questions related to Hamada’s conjecture, including the existence of counterexamples. We will also study the applicability of certain decoding methods to known counterexamples. We begin by constructing an infinite family of counterexamples to Hamada’s conjecture. These designs are the first infinite class of counterexamples for the affine case of Hamada’s conjecture. We further demonstrate how these designs, along with the projective polarity designs of Jungnickel and Tonchev, admit majority-logic decoding schemes. The codes obtained from these polarity designs attain error-correcting performance which is, in certain cases, equal to that of the finite geometry designs from which they are derived. This further demonstrates the highly geometric structure maintained by these designs. Finite geometries also help us construct several types of quantum error-correcting codes. We use relatives of finite geometry designs to construct infinite families of q-ary quantum stabilizer codes. We also construct entanglement-assisted quantum error-correcting codes (EAQECCs) which admit a particularly efficient and effective error-correcting scheme, while also providing the first general method for constructing these quantum codes with known parameters and desirable properties. Finite geometry designs are used to give exceptional examples of these codes.

Minimal strong digraphs

We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We obtain a characterization of the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove that every minimal strong digraph of order nmayor que=2 is the expansion of a minimal strong digraph of order n-1 and we give sequentially generative procedures for the constructive characterization of the classes of minimal strong digraphs. Finally we describe algorithms to compute unlabeled minimal strong digraphs and their isospectral classes.

Design and implementation of a mathematical videogame

This paper presents videogames as a very useful tool in high studies with respect to mathematical matters. It describes the implementation of a videogame developed by its authors which makes it possible for students to reinforce mathematical concepts in a motivating environment. With this work we intend to contribute to the process of engaging a bigger number of university teaching professionals and researchers in the use of serious games and the study of their theoretical frameworks, design, development and application of scientific education. With this idea the authors of the present paper have created and developed the videogame “The Math Castle” which consists in a series of tests through which various aspects of Mathematics are dealt with, especially in the areas of Discrete Mathematics, which due to its nature can be particularly well adapted to this kind of activity, Analysis or Geometry. In this paper there lies a complete description of the game developed and the results obtained with it.

Approximation algorithms

Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 106 separate “yes” or “no” decisions to be made. Although one could, in principle, try all 2106 possible solutions to find the optimal one, such a method would be impractically slow. Unfortunately, for most of these models, no algorithms are known that find optimal solutions with reasonable computation times. Typically, industry must rely on solutions of unguaranteed quality that are constructed in an ad hoc manner. Fortunately, for some of these models there are good approximation algorithms: algorithms that produce solutions quickly that are provably close to optimal. Over the past 6 years, there has been a sequence of major breakthroughs in our understanding of the design of approximation algorithms and of limits to obtaining such performance guarantees; this area has been one of the most flourishing areas of discrete mathematics and theoretical computer science.