Results 101 to 110 of about 519,259 (281)
Método para Obtener los Elementos de las Secciones Cónicas por Medio de Derivación Implícita
As a result of the research project "Strategies for differential calculus meaningful teaching and learning", this paper shows an alternative method to find simplified expressions to determine coordinates and equations for conical sections with focal axis
María C. González-Mazuelo+1 more
doaj
What is... Random Algebraic Geometry? [PDF]
We survey some ideas from the subject of Random Algebraic Geometry, a field that introduces a probabilistic perspective on classical topics in real algebraic geometry. This offers a modern approach to classical problems, such as Hilbert's Sixteenth Problem.
arxiv
Real Algebraic Geometry and Ordered Structures [PDF]
Patrick M. Gilmer
openalex +1 more source
Multi‐view subspace clustering with incomplete graph information
Abstract The core of multi‐view clustering is how to exploit the shared and specific information of multi‐view data properly. The data missing and incompleteness bring great challenges to multi‐view clustering. In this paper, we propose an innovative multi‐view subspace clustering method with incomplete graph information, so‐called incomplete multiple ...
Xiaxia He+5 more
wiley +1 more source
Topology of Injective Endomorphisms of Real Algebraic Sets [PDF]
Using only basic topological properties of real algebraic sets and regular morphisms we show that any injective regular self-mapping of a real algebraic set is surjective. Then we show that injective morphisms between germs of real algebraic sets define a partial order on the equivalence classes of these germs divided by continuous semi-algebraic ...
arxiv
Morphisms, line bundles and moduli spaces in real algebraic geometry [PDF]
Jacek Bochnak+2 more
openalex +1 more source
A Sharper Ramsey Theorem for Constrained Drawings
ABSTRACT Given a graph G $G$ and a collection C ${\mathscr{C}}$ of subsets of Rd ${{\mathbb{R}}}^{d}$ indexed by the subsets of vertices of G $G$, a constrained drawing of G $G$ is a drawing where each edge is drawn inside some set from C ${\mathscr{C}}$, in such a way that nonadjacent edges are drawn in sets with disjoint indices.
Pavel Paták
wiley +1 more source
Abstract The accurate prediction and simulation of thermal transients in district heating networks is essential for the meaningful analysis of combined heat and power systems. For this purpose, the focus of this paper lies on the development of a consistent and comprehensive modelling framework that links diverse pipe model categories to specific ...
Xiu Liu, Kai Strunz
wiley +1 more source
Sylvester-Gallai type theorems for quadratic polynomials
Sylvester-Gallai type theorems for quadratic polynomials, Discrete Analysis 2020:13, 34 pp. The [Sylvester-Gallai theorem](https://en.wikipedia.org/wiki/Sylvester%E2%80%93Gallai_theorem) asserts that given $n$ points in a plane that are not contained in
Amir Shpilka
doaj +1 more source