Large sets of large sets of Steiner triple systems of order 9

We describe a direct method of partitioning the 840 Steiner triple systems of order 9 into 120 large sets. The method produces partitions in which all of the large sets are isomorphic and we apply the method to each of the two non-isomorphic large sets of STS(9).

À descoberta de padrões na natureza!

O conceito de padrão, quando empregue no dia a dia, pode assumir diferentes significados. Em geral, está associado à identificação de algum tipo de regularidade. A Matemática, enquanto "ciência dos padrões", fornece ferramentas que permitem classificar de forma rigorosa e exaustiva os padrões que encontramos, sejam eles numéricos, geométricos ou de outra natureza qualquer. Esta é a missão de um matemático: identificar regularidades para que, no meio da desordem e de um volume considerável de informação, se possa extrair algum tipo de invariância que conduza à caracterização das propriedades comuns aos diferentes casos analisados. Este aspeto estrutural a todo o edifício matemático deve ser tido em conta no Ensino da Matemática. Aprender Matemática requer esforço e dedicação. O sucesso nesta disciplina depende do interesse do aluno em despender o esforço necessário e da dedicação com que o faz. Mas como podemos incentivar os nossos jovens a realizar esta caminhada? A verdade é que o ser humano sente necessidade de perceber o propósito daquilo em que está envolvido e é, precisamente, o acreditar nesse propósito que lhe confere muitas vezes entusiasmo e determinação para prosseguir de modo a alcançar os objetivos delineados. É, por isso, fundamental que, desde tenra idade, as crianças percebam qual o papel da Matemática e como, enquanto ciência dos padrões, esta pode ser preponderante na vida prática do quotidiano, na sistematização da informação e numa melhor perceção daquilo que nos rodeia. Tal deve ser tido em conta desde o Pré-Escolar e 1.º Ciclo do Ensino Básico, uma vez que as representações que os jovens desenvolvem da Matemática no decorrer desses anos são determinantes para a relação que assumirão com esta área do saber nos restantes níveis de ensino e ao longo de toda a sua vida. Neste âmbito, surgiu a ideia de desenvolver um caderno de atividades para o Pré-Escolar e 1.º Ciclo do Ensino Básico, que se espera ser o primeiro de uma série de materiais pedagógicos de apoio, estruturados de acordo com os pressupostos estabelecidos nos parágrafos anteriores. [...].

A Matemática na Natureza

[...]. Fibonacci destacou-se ao escrever o livro Liber Abaci, em 1202, a primeira obra importante sobre matemática desde Eratóstenes. Neste seu livro, Fibonacci coloca um problema, a partir da observação do crescimento de uma população de coelhos: "num pátio fechado coloca-se um casal de coelhos. Supondo que em cada mês, a partir do segundo mês de vida, cada casal dá origem a um novo casal de coelhos, ao fim de um ano, quantos casais de coelhos estão no pátio?" A resolução desse problema deu origem à famosa sucessão (ou sequência) de Fibonacci (ou os números de Fibonacci): 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,... outra razão apontada para a projeção mundial de Fibonacci. [...].

Aplicação do princípio das ondas de Elliott à bolsa portuguesa

Tese para a obtenção do grau de Doutor em Economia, especialidade de Economia da Empresa

Math without stress – an open online learning project

MOOC (as an acronym for Massive Open Online Courses) are a quite new model for the delivery of online learning to students. As “Massive” and “Online”, these courses are proposed to be accessible to many more learners than would be possible through conventional teaching. As “Open” they are (frequently) free of charge and participation is not limited by the geographical situation of the learners, creating new learning opportunities in Higher Education Institutions (HEI). In this paper we describe a recently started project “Matemática 100 STRESS” (Math Without STRESS) integrated in the e-IPP project | e-Learning Unit of Porto’s Polytechnic Institute (IPP) which has created its own MOOC platform and launched its first course – Probabilities and Combinatorics – in early June/2014. In this MOOC development were involved several lecturers from four of the seven IPP schools.

Math without stress: an open online learning project

MOOC (as an acronym for Massive Open Online Courses) are a quite new model for the delivery of online learning to students. As “Massive” and “Online”, these courses are proposed to be accessible to many more learners than would be possible through conventional teaching. As “Open” they are (frequently) free of charge and participation is not limited by the geographical situation of the learners, creating new learning opportunities in Higher Education Institutions (HEI). In this paper we describe a recently started project “Matemática 100 STRESS” (Math Without STRESS) integrated in the e-IPP project | e-Learning Unit of Porto’s Polytechnic Institute (IPP) which has created its own MOOC platform and launched its first course – Probabilities and Combinatorics – in early June/2014. In this MOOC development were involved several lecturers from four of the seven IPP schools.

The cardinal and the idempotent number of various monoids of transformations on a finite chain

Bulletin of the Malaysian Mathematical Sciences Society, 2, 34 (1),(2011), p. 79–85

Estructura de datos avanzadas : clases disjuntas, montículos, árboles de búsqueda

En aquest treball s'amplia la implementació en Java de les estructures de dades iniciada per Esteve Mariné, utilitzant el seu disseny bàsic. Concretament, s'ha fet la programació de les estructures de a) classes disjuntes, utilitzant els algorismes de llistes encadenades i amb estructura d'arbre, b) monticles, amb els algorismes binari, binomial i de Fibonacci, i c) arbres de recerca basats en l'algorisme d'arbre binari vermell-negre, el qual complementa els dos ja existents amb algorismes d'encadenaments i AVL. Per a examinar l'evolució de les estructures, s'ha preparat un visualitzador gràfic interactiu amb l'usuari que permet fer les operacions bàsiques de l'estructura. Amb aquest entorn és possible desar les estructures, tornar a reproduir-les i desfer i tornar a repetir les operacions fetes sobre l'estructura. Finalment, aporta una metodologia, amb visualització mitjançant gràfics, de l'avaluació comparativa dels algorismes implementats, que permet modificar els paràmetres d'avaluació com ara nombre d'elements que s'han de tractar, algorismes que s'han de comparar i nombre de repeticions. Les dades obtingudes es poden exportar per a analitzar-les posteriorment.

A sharp concentration inequality with applications

We present a new general concentration-of-measure inequality and illustrate its power by applications in random combinatorics. The results find direct applications in some problems of learning theory.

Reconstruction of networks from their betweenness centrality

In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider a simple metaheuristic, simulated annealing, as the combinatorial optimization method to generate the network from the values of the betweenness centrality. We compare the performance of this technique when reconstructing different categories of networks –random, regular, small-world, scale-free and clustered–. We show that the method allows an exact reconstruction of small networks and leads to good topological approximations in the case of networks with larger orders. The method can be used to generate a quasi-optimal topology fora communication network from a list with the values of the maximum allowable traffic for each node.

A note on the degree sequences of graphs with restrictions

Degree sequences of some types of graphs will be studied and characterizedin this paper.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Better-quasi-order : ideals and spaces

This thesis deals with combinatorics, order theory and descriptive set theory. The first contribution is to the theory of well-quasi-orders (wqo) and better-quasi-orders (bqo). The main result is the proof of a conjecture made by Maurice Pouzet in 1978 his thèse d'état which states that any wqo whose ideal completion remainder is bqo is actually bqo. Our proof relies on new results with both a combinatorial and a topological flavour concerning maps from a front into a compact metric space. The second contribution is of a more applied nature and deals with topological spaces. We define a quasi-order on the subsets of every second countable To topological space in a way that generalises the Wadge quasi-order on the Baire space, while extending its nice properties to virtually all these topological spaces. The Wadge quasi-order of reducibility by continuous functions is wqo on Borei subsets of the Baire space, this quasi-order is however far less satisfactory for other important topological spaces such as the real line, as Hertling, Ikegami and Schlicht notably observed. Some authors have therefore studied reducibility with respect to some classes of discontinuous functions to remedy this situation. We propose instead to keep continuity but to weaken the notion of function to that of relation. Using the notion of admissible representation studied in Type-2 theory of effectivity, we define the quasi-order of reducibility by relatively continuous relations. We show that this quasi-order both refines the classical hierarchies of complexity and is wqo on the Borei subsets of virtually every second countable To space - including every (quasi-)Polish space. -- Cette thèse se situe dans les domaines de la combinatoire, de la théorie des ordres et de la théorie descriptive. La première contribution concerne la théorie des bons quasi-ordres (wqo) et des meilleurs quasi-ordres (bqo). Le résultat principal est la preuve d'une conjecture, énoncée par Pouzet en 1978 dans sa thèse d'état, qui établit que tout wqo dont l'ensemble des idéaux non principaux ordonnés par inclusion forme un bqo est alors lui-même un bqo. La preuve repose sur de nouveaux résultats, qui allient la combinatoire et la topologie, au sujet des fonctions d'un front vers un espace métrique compact. La seconde contribution de cette thèse traite de la complexité topologique dans le cadre des espaces To à base dénombrable. Dans le cas de l'espace de Baire, le quasi-ordre de Wadge est un wqo sur les sous-ensembles Boréliens qui a suscité énormément d'intérêt. Cependant cette relation de réduction par fonctions continues s'avère bien moins satisfaisante pour d'autres espaces d'importance tels que la droite réelle, comme l'ont fait notamment remarquer Hertling, Schlicht et Ikegami. Nous proposons de conserver la continuité et d'affaiblir la notion de fonction pour celle de relation. Pour ce faire, nous utilisons la notion de représentation admissible étudiée en « Type-2 theory of effectivity » initiée par Weihrauch. Nous introduisons alors le quasi-ordre de réduction par relations relativement continues et montrons que celui-ci à la fois raffine les hiérarchies classiques de complexité topologique et forme un wqo sur les sous-ensembles Boréliens de chaque espace quasi-Polonais.