This article formalizes some aspects of the board game Carcassonne. Combinatorical problems related to the number of tile types are mentioned. Then the paper describes a game map using graph theory.

This contribution shows how to compute upper bounds of the optimal constant in Friedrichs’ and similar inequalities. The approach is based on the method of $apriori-aposterioriinequalities$ [9]. However, this method requires trial and test functions with continuous second derivatives. We show how to avoid this requirement and how to compute the bounds on Friedrichs’ constant using standard finite element methods. This approach is quite general and allows variable coefficients and mixed boundary conditions. We use the computed...

The Euler methods are the most popular, simplest and widely used methods for the solution of the Cauchy problem for the first order ODE. The simplest and usual generalization of these methods are the so called theta-methods (notated also as $\theta$-methods), which are, in fact, the convex linear combination of the two basic variants of the Euler methods, namely of the explicit Euler method (EEM) and of the implicit Euler method (IEM). This family of the methods is well-known and it is introduced almost...

In this contribution, higher-order finite element method is used for the solution of reaction-diffusion equation with Turing instability. Some aspects concerning convergence of the method for this particular problem are discussed. Our numerical tests confirm the convergence of the method, but for some very special choices of parameters, this convergence has very uncommon properties.

This paper is about $0/1$-triangles, which are the simplest nontrivial examples of $0/1$-polytopes: convex hulls of a subset of vertices of the unit $n$-cube $I^n$. We consider the subclasses of right $0/1$-triangles, and acute $0/1$-triangles, which only have acute angles. They can be explicitly counted and enumerated, also modulo the symmetries of $I^n$.