In recent years, Loop Quantum Gravity has emerged as a solid candidate for a nonperturbative quantum theory of General Relativity. It is a background independent theory based on a description of the gravitational field in terms of holonomies and fluxes. In order to discuss its physical implications, a lot of attention has been paid to the application of the quantization techniques of Loop Quantum Gravity to symmetry reduced models with cosmological solutions, a line of research that has been called Loop Quantum Cosmology. We summarize its fundamentals and the main differences with respect to the more conventional quantization approaches employed in cosmology until now. In addition, we comment on the most important results that have been obtained in Loop Quantum Cosmology by analyzing simple homogeneous and isotropic models. These results include the resolution of the classical big-bang singularity, which is replaced by a quantum bounce.

No abstract

This paper is devoted to introducing a new approach for computing the topology of a real algebraic plane curve presented either parametrically or defined by its implicit equation when the corresponding polynomials which describe the curve are known only "by values". This approach is based on the replacement of the usual algebraic manipulation of the polynomials (and their roots) appearing in the topology determination of the given curve with the computation of numerical matrices (and their eigenvalues). Such numerical matrices arise from a typical construction in Elimination Theory known as the Bézout matrix which in our case is specified by the values of the defining polynomial equations on several sample points.

No abstract

No abstract

The availability of the implicit equation of a plane curve or of a 3D surface can be very useful in order to solve many geometric problems involving the considered curve or surface: for example, when dealing with the point position problem or answering intersection questions. On the other hand, it is well known that in most cases, even for moderate degrees, the implicit equation is either difficult to compute or, if computed, the high degree and the big size of the coefficients makes extremely difficult its use in practice.We will show that, for several problems involving plane curves, 3D surfaces and some of their constructions (for example, offsets), it is possible to use the implicit equation (or, more precisely, its properties) without needing to explicitly determine it. We replace the computation of the implicit equation by the evaluation of the considered parameterizations in a set of points and its use, in order to deal with the considered geometric problems, is translated into one or several generalized eigenvalue problems on matrix pencils (depending again on several evaluations of the considered parameterizations). This is the so called "Polynomial Algebra by Values" approach where the huge polynomial equations coming from Elimination Theory (e.g., using resultants) are replaced by big structured and sparse numerical matrices. For these matrices there are well known numerical techniques allowing to provide the results we need to answer the geometric questions on the considered curves and surfaces.

No abstract

No abstract