English
Related papers

Related papers: Quantitative Curve Selection Lemma

200 papers

In the Upper Degree-Constrained Partial Orientation problem we are given an undirected graph $G=(V,E)$, together with two degree constraint functions $d^-,d^+ : V \to \mathbb{N}$. The goal is to orient as many edges as possible, in such a…

Data Structures and Algorithms · Computer Science 2014-10-13 Marek Cygan , Tomasz Kociumaka

For a nondegenerate irreducible curve $C$ of degree $d$ in ${\Bbb P}^r$ over ${\Bbb F}_q$ with $r \geq 3$, we prove that the number $N_q(C)$ of ${\Bbb F}_q$-points of $C$ satisfies the inequality $N_q(C) \leq (d-1)q +1$, which is known as…

Algebraic Geometry · Mathematics 2011-08-26 Masaaki Homma

We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…

Algebraic Geometry · Mathematics 2019-09-12 Anantadulal Paul

We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…

Number Theory · Mathematics 2019-02-20 Aaron Levin

We initiate a systematic study of pseudo-deterministic quantum algorithms. These are quantum algorithms that, for any input, output a canonical solution with high probability. Focusing on the query complexity model, our main contributions…

Quantum Physics · Physics 2026-02-20 Hugo Aaronson , Tom Gur , Jiawei Li

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…

Combinatorics · Mathematics 2018-07-10 Micha Sharir , Joshua Zahl

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Numerical Analysis · Mathematics 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan

We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The…

Symbolic Computation · Computer Science 2023-07-12 Md Nazrul Islam , Adrien Poteaux , Rémi Prébet

Quantum curves arise from Seiberg-Witten curves associated to 4d $\mathcal{N}=2$ gauge theories by promoting coordinates to non-commutative operators. In this way the algebraic equation of the curve is interpreted as an operator equation…

High Energy Physics - Theory · Physics 2021-03-17 Jin Chen , Babak Haghighat , Hee-Cheol Kim , Marcus Sperling

Let $f(x)$ be a degree $(2g+1)$ monic polynomial with coefficients in an algebraically closed field $K$ with $char(K)\ne 2$ and without repeated roots. Let $\mathfrak{R}\subset K$ be the $(2g+1)$-element set of roots of $f(x)$. Let…

Algebraic Geometry · Mathematics 2019-08-30 Yuri G. Zarhin

We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…

Algebraic Geometry · Mathematics 2017-01-16 Madeline Brandt , DJ Bruce , Taylor Brysiewicz , Robert Krone , Elina Robeva

In [1], whether a target binary string s can be represented from a boolean formula with operands chosen from a set of binary strings W was studied. In this paper, we first examine selecting a maximum subset X from W, so that for any string…

Computational Complexity · Computer Science 2012-01-17 Peng Zhang

We investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…

Algebraic Geometry · Mathematics 2025-10-15 Manfred Buchacher

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

Symbolic Computation · Computer Science 2015-03-19 Michael Kerber , Michael Sagraloff

We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…

Algebraic Geometry · Mathematics 2023-09-22 Giulio Bresciani

Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…

Algebraic Geometry · Mathematics 2021-11-01 Antonio Lerario , Michele Stecconi

We present an algorithm that, for every fixed degree $n\ge 3$, will enumerate all degree-$n$ places of the projective line over a finite field $k$ up to the natural action of $\operatorname{PGL}_2(k)$ using $O(\log q)$ space and…

Number Theory · Mathematics 2025-10-23 Everett W. Howe

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

Number Theory · Mathematics 2023-02-15 Benjamin Matschke , Abhijit S. Mudigonda

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

For a line bundle L on a smooth surface S, it is now known that the degree of the Severi variety of cogenus-d curves is given by a universal polynomial in the Chern classes of L and S if L is d-very ample. For S rational, we relax the…

Algebraic Geometry · Mathematics 2013-02-08 Steven L. Kleiman , Vivek V. Shende , with an appendix by Ilya Tyomkin
‹ Prev 1 4 5 6 7 8 10 Next ›