Graz University of Technology

We consider a bond percolation on the hypercube in the supercritical regime. We derive vertex-expansion properties of the giant component. As a consequence we obtain upper bounds on the diameter of the giant component and the mixing time of the lazy random walk on the giant component. This talk is based on joint work with Joshua Erde and Michael Krivelevich.

In the theory of random graphs, the behaviour of the typical largest component was studied a lot. The initial results on G(n,m), the random graph on n vertices and m edges, are due to Erdős and Rényi. Recently, similar results for planar graphs were obtained by Kang and Łuczak.

In the first part of the talk, we will extend these results on the size of the largest component further to graphs embeddable on the orientable surface S_g of genus g>0 and see how the asymptotic number and properties of cubic graphs embeddable on S_g are used to obtain those results. Then we will go through the main steps necessary to obtain the asymptotic number of cubic graphs and point out the main differences to the corresponding results for planar graphs. In the end we will give a short outlook to graphs embeddable on surfaces with non-constant genus, especially which results generalise and which problems are still open.

We study a system of partial differential equations describing a steady flow of an incompressible generalized Newtonian fluid, wherein the Cauchy stress depends on concentration. Namely, we consider a coupled system of the generalized Navier-Stokes equations (viscosity of power-law type with concentration dependent power index) and convection-diffusion equation with non-linear diffusivity. We focus on the existence analysis of a weak solution for certain class of models by using a generalization of the monotone operator theory which fits into the framework of generalized Sobolev spaces with variable exponent (class of Sobolev-Orlicz spaces). Such results is then adapted for a suitable FEM approximation, for which the main tool of proof is a generalization of the Lipschitz approximation method.

We present a multilevel preconditioner for the mixed finite element discretization of the biharmonic equation of first kind. While for the interior degrees of freedom a standard multigrid methods can be applied, a different approach is required on the boundary. The construction of the preconditioner is based on a BPX type multilevel representation in fractional Sobolev spaces. Numerical examples illustrate the obtained theoretical results.

The sequence {nα}, where α is an irrational number and {.} denotes fractional part, plays

a fundamental role in probability theory, analysis and number theory. For suitable α, this sequence provides an example for "most uniform" infinite sequences, i.e. sequences whose discrepancy has the

smallest possible order of magnitude. Such 'low discrepancy' sequences have important applications in Monte Carlo integration and other problems of numerical mathematics. For rapidly increasing n_k the behaviour of {n_kα} is similar to that of independent random variables, but its asymptotic properties depend strongly also on the number theoretic properties of n_k, providing a simple example for pseudorandom behaviour. Finally, for periodic f the sequence f(nα) provides a generalization of the trig-onometric system with many interesting  properties. In this lecture, we give a survey of the field  (going back more than 100 years) and formulate new results.