English
Related papers

Related papers: Computing Hypercircles by Moving Hyperplanes

200 papers

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

Number Theory · Mathematics 2009-07-02 Nils Bruin , Michael Stoll

Let $C$ be a hyperelliptic curve of genus $g$ over the fraction field $K$ of a discrete valuation ring $R$. Assume that the residue field $k$ of $R$ is perfect and that $\mathrm{char}\ k > 2g+1$. Let $S = \mathrm{Spec}\ R$. Let $X$ be the…

Algebraic Geometry · Mathematics 2021-08-31 Padmavathi Srinivasan

Let C be a hyperelliptic curve of good reduction defined over a discrete valuation field K with algebraically closed residue field k. Assume moreover that char k \ne 2. Given d \in K^*\K^*2, we introduce an explicit description of the…

Number Theory · Mathematics 2014-09-26 Mohammad Sadek

We classify all possible limits of families of translates of a fixed, arbitrary complex plane curve. We do this by giving a set-theoretic description of the projective normal cone (PNC) of the base scheme of a natural rational map,…

Algebraic Geometry · Mathematics 2012-04-11 Paolo Aluffi , Carel Faber

Given a complex simply connected simple algebraic group $G$ of exceptional type and a maximal parabolic subgroup $P \subset G$, we classify all triples $(G,P,H)$ such that $H \subset G$ is a maximal reductive subgroup acting spherically on…

Representation Theory · Mathematics 2011-11-17 Bruno Niemann

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

Data Structures and Algorithms · Computer Science 2025-08-28 Tatsuya Gima , Yasuaki Kobayashi , Yuto Okada

We prove upper bounds on the number of rational points on transcendental curves in arbitrary $1$-h-minimal fields, similar to the Pila--Wilkie counting theorem in the o-minimal setting. These results extend results due to…

Number Theory · Mathematics 2025-07-08 Floris Vermeulen

Pseudospectral analysis is fundamental for quantifying the sensitivity and transient behavior of nonnormal matrices, yet its computational cost scales cubically with dimension, rendering it prohibitive for large-scale systems. While…

Numerical Analysis · Mathematics 2026-02-03 Vladimir R. Kostic , Dragana Lj. Cvetkovic , Ljiljana Cvetkovic

Let $C$ be a hyperelliptic curve $y^2 = f(x)$ over a discretely valued field $K$. The $p$-adic distances between the roots of $f(x)$ can be described by a completely combinatorial object known as the cluster picture. We show that the…

Number Theory · Mathematics 2020-10-28 Omri Faraggi , Sarah Nowell

We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…

Algebraic Geometry · Mathematics 2012-09-05 Lubjana Beshaj , Valmira Hoxha , Tony Shaska

Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…

High Energy Physics - Theory · Physics 2012-06-13 Sergei Gukov , Piotr Sułkowski

In this paper, we study the problem of computing a homotopy from a planar curve $C$ to a point that minimizes the area swept. The existence of such a minimum homotopy is a direct result of the solution of Plateau's problem. Chambers and…

Algebraic Topology · Mathematics 2017-07-10 Brittany Terese Fasy , Selcuk Karakoc , Carola Wenk

There is an algorithm that takes as input a global field k and produces a curve over k violating the local-global principle. Also, given a global field k and a nonnegative integer n, one can effectively construct a curve X over k such that…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

An elliptic curve $E$ defined over a $p$-adic field $K$ with a $p$-isogeny $\phi:E\rightarrow E^\prime$ comes equipped with an invariant $\alpha_{\phi/K}$ that measures the valuation of the leading term of the formal group homomorphism…

Number Theory · Mathematics 2017-03-08 Matthew Gealy , Zev Klagsbrun

We are concerned with the question of determining the set $C(\mathbb{Q})$, where $C$ is a curve defined by an equation of the form $y^q=f(x)$, where $q$ is an odd prime and $f$ is a polynomial defined over $\mathbb{Q}$. This question can…

Number Theory · Mathematics 2012-05-16 Michael Mourao

We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…

Algebraic Geometry · Mathematics 2014-10-08 J. Rafael Sendra , David Sevilla , Carlos Villarino

A non-commutative differential calculus on the $h$-superplane is presented via a contraction of the $q$-superplane. An R-matrix which satisfies both ungraded and graded Yang-Baxter equations is obtained and a new deformation of the $(1+1)$…

Quantum Algebra · Mathematics 2007-05-23 Salih Celik , Sultan A. Celik , Metin Arik

The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…

Commutative Algebra · Mathematics 2014-06-24 Lorenzo Robbiano

Let $C: y^2=f(x)$ be a hyperelliptic curve of genus $g\geq 1$, defined over a complete discretely valued field $K$, with ring of integers $O_K$. Under certain conditions on $C$, mild when residue characteristic is not $2$, we explicitly…

Number Theory · Mathematics 2024-11-20 Simone Muselli

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

Data Structures and Algorithms · Computer Science 2021-07-20 Amartya Shankha Biswas , Talya Eden , Ronitt Rubinfeld