Lattice Point Counting through Fractal Geometry and Stationary Phase for Surfaces with Vanishing Curvature

Autor: Campolongo, Elizabeth Grace

We explore lattice point counting and the method of stationary phase through the lens of questions about the number of lattice points on and near surfaces with vanishing curvature. Our focus is on spheres arising from the Heisenberg groups. In partic

Externí odkaz: http://rave.ohiolink.edu/etdc/view?acc_num=osu1658269573881902

Calculation of the Differential Geometry Properties of Implicit Parametric Surfaces Intersection

Autor: Jiménez-Vilcherrez, Judith Keren

Publikováno v: Computational Science and Its Applications – ICCSA 2020

Generally, to calculate the Frenet-Serret apparatus of a curve, it is necessary to have a parameterization of it; but when it is difficult to obtain a parameterization of the curve, as is the case of the curves obtained by the intersection of two imp

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmc_________::fcb3c4174c4471444ed544f8138957e0
http://europepmc.org/articles/PMC7974858

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Maximum number of points on intersection of a cubic surface and a non-degenerate Hermitian surface

Autor: Peter Beelen, Mrinmoy Datta

Publikováno v: Beelen, P & Datta, M 2020, ' Maximum number of points on intersection of a cubic surface and a non-degenerate Hermitian surface ', Moscow Mathematical Journal, vol. 20, no. 3, pp. 453-474 . https://doi.org/10.17323/1609-4514-2020-20-3-453-474

In 1991 Sørensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree d and a non-degenerate Hermitian surface in P3(Fq2). The conjecture was proven to be true by Edoukou in the case when d = 2. In this p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7a75dcda700fa3296238752b0bd422b
http://arxiv.org/abs/1802.06681

A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics

Autor: Michael Hemmer, Laurent Dupont, Elmar Schömer, Sylvain Petitjean

Publikováno v: Journal of Symbolic Computation
Journal of Symbolic Computation, Elsevier, 2011, 46 (4), pp.467-494. ⟨10.1016/j.jsc.2010.11.002⟩
Journal of Symbolic Computation, 2011, 46 (4), pp.467-494. ⟨10.1016/j.jsc.2010.11.002⟩

International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arra

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64f5e3b4e3cf872a45c8ff9d7f493268
https://hal.inria.fr/inria-00537592