Giessen, Universiẗat, Diss., 2002.

In this workshop, we present a model of problem that we call Research Situation for the Classroom (RSC). The aim of a RSC is to put students in a role close to a mathematical researcher in order to make them work on mathematical thinking/skills. A RSC has some characteristics : the problem is close to a research one, the statement is an easy understandable question, school knowledge are elementary, there is no end, a solved question postponed to new questions... The most important characteristic of a RSC is that students can manage their research by fixing themselves some variable of the problem. So, a RSC is completely different from a problem that students usually do in France. For short : there is no final answer, students can try to resolve their own questions : a RSC is a large open field where many sub-problems exist; the goal for the students is not to apply a technique: the goal is, as for a researcher, to search. These type of situations are particularly interesting to develop problem solving skills and mathematical thinking. They can also let students discover that mathematics are “alive” and “realistic”. This workshop will be split into two parts. First, we propose to put people in the situation of solving a RSC to make them discover practically what is it. After, we present the model of a RSC and some results of our experimentations.

Many countries are reporting of difficulties in exact education at schools: mathematics, informatics, physics etc. Various methods are proposed to awaken and preserve students’ interest in these disciplines. Among them, the simplification, accent on applications, avoiding of argumentation (especially in mathematics) etc. must be mentioned. As one of reasons for these approaches the growing amount of knowledge/skills to be acquired at school is often mentioned. In this paper we consider one of the possibilities to integrate partially teaching of important chapters of discrete mathematics and informatics not reducing the high educational standards. The approach is based on the identification and mastering general combinatorial principles underlying many topics in both disciplines. A special attention in the paper is given to the so-called “pigeonhole principle” and its generalizations. In folklore, this principle is usually formulated in the following way: “if there are n + 1 rabbits in n cages, you can find a cage with at least two rabbits in it“. Examples of appearances of this principle both in mathematics and in computer science are considered.

Many countries are reporting of difficulties in exact education at schools: mathematics, informatics, physics etc. Various methods are proposed to awaken and preserve students’ interest in these disciplines. Among them, the simplification, accent on applications, avoiding of argumentation (especially in mathematics) etc. must be mentioned. As one of reasons for these approaches the growing amount of knowledge/skills to be acquired at school is often mentioned. In this paper we consider one of the possibilities to integrate partially teaching of important chapters of discrete mathematics and informatics not reducing the high educational standards. The approach is based on the identification and mastering general combinatorial principles underlying many topics in both disciplines. A special attention in the paper is given to the so-called “pigeonhole principle” and its generalizations. In folklore, this principle is usually formulated in the following way: “if there are n + 1 rabbits in n cages, you can find a cage with at least two rabbits in it“. Examples of appearances of this principle both in mathematics and in computer science are considered.

In this workshop, we present a model of problem that we call Research Situation for the Classroom (RSC). The aim of a RSC is to put students in a role close to a mathematical researcher in order to make them work on mathematical thinking/skills. A RSC has some characteristics : the problem is close to a research one, the statement is an easy understandable question, school knowledge are elementary, there is no end, a solved question postponed to new questions... The most important characteristic of a RSC is that students can manage their research by fixing themselves some variable of the problem. So, a RSC is completely different from a problem that students usually do in France. For short : there is no final answer, students can try to resolve their own questions : a RSC is a large open field where many sub-problems exist; the goal for the students is not to apply a technique: the goal is, as for a researcher, to search. These type of situations are particularly interesting to develop problem solving skills and mathematical thinking. They can also let students discover that mathematics are “alive” and “realistic”. This workshop will be split into two parts. First, we propose to put people in the situation of solving a RSC to make them discover practically what is it. After, we present the model of a RSC and some results of our experimentations.

A graph on at least k+1 vertices is said to have global connectivity k if any two of its vertices are connected by k independent paths. The local connectivity of two vertices is the number of independent paths between those specific vertices. This dissertation is concerned with pairwise connectivity notions, meaning that the focus is on local connectivity relations that are required for a number of or all pairs of vertices. We give a detailed overview about how uniformly k-connected and uniformly k-edge-connected graphs are related and provide a complete constructive characterization of uniformly 3-connected graphs, complementing classical characterizations by Tutte. Besides a tight bound on the number of vertices of degree three in uniformly 3-connected graphs, we give results on how the crossing number and treewidth behaves under the constructions at hand. The second central concern is to introduce and study cut sequences of graphs. Such a sequence is the multiset of edge weights of a corresponding Gomory-Hu tree. The main result in that context is a constructive scheme that allows to generate graphs with prescribed cut sequence if that sequence satisfies a shifted variant of the classical Erdős-Gallai inequalities. A complete characterization of realizable cut sequences remains open. The third central goal is to investigate the spectral properties of matrices whose entries represent a graph's local connectivities. We explore how the spectral parameters of these matrices are related to the structure of the corresponding graphs, prove bounds on eigenvalues and related energies, which are sums of absolute values of all eigenvalues, and determine the attaining graphs. Furthermore, we show how these results translate to ultrametric distance matrices and touch on a Laplace analogue for connectivity matrices and a related isoperimetric inequality.