Minimal generating sets for the mapping class group of a surface



Minimal generating sets for the mapping class group of a surface
Korkmaz, Mustafa (2012-01-01)
Minimal truncation error constants for Runge-Kutta method for stochastic optimal control problems
Bakan, Hacer Oz; Yilmaz, Fikriye; Weber, Gerhard Wilhelm (2018-03-15)
In this work, we obtain strong order-1 conditions with minimal truncation error constants of Runge–Kutta method for the optimal control of stochastic differential equations (SDEs). We match Stratonovich–Taylor expansion of the exact solution with Stratonovich–Taylor expansion of our approximation method that is defined by the Runge–Kutta scheme, term by term, in order to get the strong order-1 conditions. By a conclusion and an outlook to future research, the paper ends.
Minimal non-FC-groups and coprime automorphisms of quasi-simple groups
Ersoy, Kıvanç; Kuzucuoğlu, Mahmut; Department of Mathematics (2004)
A group G is called an FC-group if the conjugacy class of every element is finite. G is called a minimal non-FC-group if G is not an FC-group, but every proper subgroup of G is an FC-group. The first part of this thesis is on minimal non-FC-groups and their finitary permutational representations. Belyaev proved in 1998 that, every perfect locally finite minimal non-FC-group has non-trivial finitary permutational representation. In Chapter 3, we write the proof of Belyaev in detail. Recall that a group G is ...
Minimal extension of Einstein’s gravity at the quartic order
Kenar, Esin; Tekin, Bayram; Department of Physics (2018)
We study an extension of Einstein general relativity theory at the quartic order in the curvature. The extended theory has a unique vacuum and a single massless spin-2 excitation about this vacuum, just like general relativity, hence it is called a minimal extension. The extended theory can also be obtained from a particular form of Born-Infeld gravity. We show that the Schwarzschild and Kerr black holes are not exact solutions and the Kretschmann scalar obeys a non-linear wave equation, suggesting that bla...
Maximal matching polytope in trees
Tural, Mustafa Kemal (2016-06-01)
Given a weighted simple graph, the minimum weighted maximal matching (MWMM) problem is the problem of finding a maximal matching of minimum weight. The MWMM problem is NP-hard in general, but is polynomial-time solvable in some special classes of graphs. For instance, it has been shown that the MWMM problem can be solved in linear time in trees when all the edge weights are equal to one. In this paper, we show that the convex hull of the incidence vectors of maximal matchings (the maximal matching polytope)...
Citation Formats
M. Korkmaz, Minimal generating sets for the mapping class group of a surface. 2012, p. 463.