In this paper we obtain symmetry and monotonicity results for positive solutions to some p-Laplacian cooperative systems in bounded domains involving first-order terms and under zero Dirichlet boundary condition.

The study presented makes an original, new and exhaustive analysis of the adaptation of a classical board game which has been named Binary Who is Who? This proposal shows a very useful tool for the consolidation of mathematical concepts related to the study of real-valued functions that are treated in the different levels of the teaching of mathematics (first and second year of superior secondary studies and the first years of some university degrees). The use of games as a means for learning is the authors’ proposal. The aim is to offer teachers the chance of using the games as a method of teaching mathematical concepts, as well as a motivating instrument for them. This game has been created to be played face-to-face in the classroom and it has also been programmed to create a video game which allows the students to play virtually.

Herein, we considered the Schrödinger operator with a potential q on a disk and the map that associates to q the corresponding Dirichlet-to-Neumann (DtN) map. We provide some numerical and analytical results on the range of this map and its stability for the particular class of one-step radial potentials.

In this paper, we improve the lower bound on the minimum number of $\le k$-edges in sets of n points in general position in the plane when k is close to $\frac{n}{2}$. As a consequence, we improve the current best lower bound of the rectilinear crossing number of the complete graph $K_n$ for some values of n.

Information about the paper titled "ANALYSIS OF LOGIC AND STRATEGY GAMES AS A TOOL FOR THE TEACHING AND APPROACH TO MATHEMATICAL CONCEPTS" at IATED Digital Library

Attending to an open problem in the literature stated by Mirzakhani and Vondrák, we give a lower bound of the number of non-monochromatic simplices for Sperner labelings of the vertices of a triangulation of a given $ k$-simplex with vertices of integer coordinates. This triangulation maximizes the number of simplices over all the triangulations of the $ k$-simplex with vertices of integer coordinates.