Adrián Muñoz Perera

A set of dice is intransitive if it contains dice with the property that given a particular die in the set, some dice roll higher more than half the time, but also others roll lower half the time. This means that the relation between the dice "die A beats die B" is not transitive. Obtaining such a set of dice is difficult in general, the structure of these sets is not very intuitive.

Some particular cases have been produced over time, for several number of players and several number of faces in the dice. In this paper, a general expression for a set of intransitive dice of any given size is provided, and the probability of one die rolling higher than other in the set is explicitly computed. This novel general expression is simple yet has some complex symmetries that help understand this beautiful mathematical curiosity.

You can download the paper in this link.

Final project corresponding to my Master's Degree in ICT Research and Innovation (i2-ICT). A computational analysis on spectral representation (in the domain of frequencies) of several types of gaussian processes within bounded domains. Kernels such as brownian motion, brownian bridge, Ornstein-Uhlenbeck, Radial Basis Function (RBF), Matérn and exponential are studied.

Master's Degree in Mathematics and Applications' final project. On regularization of functional data and its embedding in optimal classification rules in the continuous time gaussian process framework.

Final project corresponding to Double Degree on Mathematics and Computer Science. The codification of shape of objects in terms of directional data is addressed, with an application to a real world classification problem. Included in the proceedings of the 27th International Conference on Artificial Neural Networks, ICANN 2018, held in Rhodes, Greece, in October 2018. Part of the Lecture Notes in Computer Science book series (LNCS, volume 11139). Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 11139)