English
Related papers

Related papers: Computing Hypercircles by Moving Hyperplanes

200 papers

We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.

Algebraic Geometry · Mathematics 2018-05-11 Niels Lubbes

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

Combinatorics · Mathematics 2018-06-15 Gregory J. Clark , Joshua N. Cooper

Graph problems are troublesome when it comes to MapReduce. Typically, to be able to design algorithms that make use of the advantages of MapReduce, assumptions beyond what the model imposes, such as the density of the input graph, are…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-05-15 Soheil Behnezhad , Mahsa Derakhshan , MohammadTaghi Hajiaghayi

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi , G. Korchmaros

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…

Symbolic Computation · Computer Science 2017-11-21 Jonas Szutkoski , Mark van Hoeij

In this paper, we evaluate the algebraic $K$-groups of a planar cuspidal curve over a perfect $\mathbb{F}_p$-algebra relative to the cusp point. A conditional calculation of these groups was given earlier by Hesselholt, assuming a…

K-Theory and Homology · Mathematics 2019-07-18 Lars Hesselholt , Thomas Nikolaus

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

Number Theory · Mathematics 2017-05-12 Nazar Arakelian

We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…

Computational Complexity · Computer Science 2016-08-16 André Grosse , Joerg Rothe , Gerd Wechsung

Let $k$ be an algebraically closed field of characteristic $p>0$ and let $C/k$ be a smooth connected affine curve. Denote by $\pi_1(C)$ its algebraic fundamental group. The goal of this paper is to characterize a certain subset of closed…

Algebraic Geometry · Mathematics 2013-12-03 Amilcar Pacheco , Pavel Zalesskii , Katherine F. Stevenson

Let $\mathcal X_g$ be a genus $g\geq 2$ superelliptic curve, $F$ its field of moduli, and $K$ the minimal field of definition. In this short note we construct an equation of the curve $\mathcal X_g$ over its minimal field of definition $K$…

Number Theory · Mathematics 2014-07-24 Lubjana Beshaj , Fred Thompson

These are the substantially expanded notes of the lectures of JK at the summer school "Higher-Dimensional Geometry over Finite Fields" in G\"ottingen, June 2007. The first part gives an overview of the methods. The main new result is the…

Algebraic Geometry · Mathematics 2007-10-31 János Kollár , Ulrich Derenthal

Let $K$ be a discretely valued Henselian field. Creutz and Viray show that the degree set of a curve $C$ over a $p$-adic field can miss infinitely many multiples of the index of $C$, a phenomenon that cannot occur over finitely generated…

Number Theory · Mathematics 2025-11-27 Alexander Galarraga , Alexander Wang

We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…

Algebraic Geometry · Mathematics 2023-10-04 David McKinnon

In this paper, we study non-hyperelliptic curves of genus $3$ with cyclic automorphism group of order $6$. Over an algebraically closed field $K$ of characteristic $\neq 2,3$, such curves are written as plane quartics $C_r: x^3 z + y^4 + r…

Algebraic Geometry · Mathematics 2024-06-04 Ryo Ohashi , Momonari Kudo , Shushi Harashita

Fix a non-negative integer g and a positive integer I dividing 2g-2. For any Henselian, discretely valued field K whose residue field is perfect and admits a degree I cyclic extension, we construct a curve C over K of genus g and index I.…

Number Theory · Mathematics 2007-05-23 Pete L. Clark

We extend a previously introduced semi-analytical representation of a decomposition of CA dynamics in arbitrary dimensions and neighborhood schemes via the use of certain universal maps in which CA rule vectors are derivable from the…

Cellular Automata and Lattice Gases · Physics 2017-08-29 Theophanes E. Raptis

In this paper we consider the problem of quantizing theories defined over configuration spaces described by non-commuting parameters. If one tries to do that by generalizing the path-integral formalism, the first problem one has to deal…

Mathematical Physics · Physics 2009-10-30 R. Casalbuoni

Let C/K: F = 0 be a smooth plane quartic over a complete discrete valuation field K. In a previous paper the authors togetehr with Q. Liu give various characterizations of the reduction (i.e. non-hyperelliptic genus 3 curve, hyperelliptic…

Algebraic Geometry · Mathematics 2019-06-04 Reynald Lercier , Elisa Lorenzo García , Christophe Ritzenthaler

In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…

Computational Geometry · Computer Science 2012-04-05 Jin-San Cheng , Kai Jin , Xiao-Shan Gao , Daniel Lazard

Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere…

Machine Learning · Computer Science 2023-12-13 Eduard Eiben , Robert Ganian , Iyad Kanj , Sebastian Ordyniak , Stefan Szeider
‹ Prev 1 3 4 5 6 7 10 Next ›