In his book “Homotopy Theory and Duality,” Peter Hilton described the concepts of relative homotopy theory in module theory. We study in this paper the possibility of parallel concepts of fibration and cofibration in module theory, analogous to the existing theorems in algebraic topology. First, we discover that one can study relative homotopy groups, of modules, from a viewpoint which is close...

This paper presents the solution of the nonlinear equation that governs the flow of a viscous, incompressible fluid between two converging-diverging rigid walls using an improved homotopy analysis method. The results obtained by this new technique show that the improved homotopy analysis method converges much faster than both the homotopy analysis method and the optimal homotopy asymptotic meth...

We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy fibrant diagrams correspond to contexts of a certain shape in type theory. This has two main applications. First, by considering inverse diagrams in Voevodsky...

Integral symplectic 4–manifolds may be described in terms of Lefschetz fibrations. In this note we give a formula for the signature of any Lefschetz fibration in terms of the second cohomology of the moduli space of stable curves. As a consequence we see that the sphere in moduli space defined by any (not necessarily holomorphic) Lefschetz fibration has positive “symplectic volume”; it evaluate...

We explain how the notion of homotopy colimits gives rise to that of mapping spaces, even in categories which are not simplicial. We apply the technique of model approximations and use elementary properties of the category of spaces to be able to construct resolutions. We prove that the homotopy category of any monoidal model category is always a central algebra over the homotopy category of Sp...

The total domination number of a simple, undirected graph G is the minimum cardinality of a subset D of the vertices of G such that each vertex of G is adjacent to some vertex in D. In 2007 Graffiti.pc, a program that makes graph theoretical conjectures, was used to generate conjectures on the total domination number of connected graphs. More recently, the program was used to generate conjectur...