Gallery — Math

Identifying whether a degree matrix has an edge-disjoint realization is an NP-hard problem. In comparison, identifying whether a tree degree matrix has an edge-disjoint realization is easier, but the task is still challenging. In 1975, a sufficient condition for the tree degree matrices with three rows has been found, but the condition has not been improved since. This paper contains an essential part of the proof which improves the sufficient condition.

Submission for Homework 1

Proof of Euler's Formula

Our solution for MCM2015

IB

not sure what to put here

Multiplication and Division of Integers

This study is focused on lives of twelve women who prepared their doctorates in mathematics at the Faculty of Philosophy of the German University in Prague in the years 1882–1945, respectively at the Faculty of Science of the Czech University in Prague in the years 1882–1920 and 1921–1945 (known as Charles University in Prague in the latter period). In the first part, a short description of the historical background about women's studies at the universities in the Czech lands and a statistical overview of all PhD degrees in mathematics awarded at both universities in Prague is given for a better understanding of the situation with women's doctoral procedures. In the second part, a description of the successful doctoral procedures in mathematics of three women at the German University in Prague and of eight women at Charles University in Prague, as well as one unsuccessful doctoral procedure, are presented.

Ejercicios de álgebra tomados del Baldor (edición 1980). Algebra exercises from Baldor (1980 edition)