English
Related papers

Related papers: Quantitative Curve Selection Lemma

200 papers

In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…

Algebraic Geometry · Mathematics 2025-03-11 Antonio Lerario , Luca Rizzi , Daniele Tiberio

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

Algebraic Geometry · Mathematics 2013-08-01 Salvador Barone

Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a system of $s$ equalities and inequalities of multivariate…

Symbolic Computation · Computer Science 2013-09-20 Mohab Safey El Din , Elias Tsigaridas

In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open…

Computational Geometry · Computer Science 2026-01-13 Boris Aronov , Esther Ezra , Joshua Zahl

Let $\K=\C$, or $\R$, and $S_f$ be the set of points in $\K^n$ at which a polynomial map $f:\K^n\rightarrow\K^n$ is non-proper. Jelonek proved that $S_f$ is a semi-algebraic set that is ruled by polynomial curves, with $\dim S_f\leq n-1$,…

Algebraic Geometry · Mathematics 2019-09-17 Boulos El Hilany

Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…

Algebraic Geometry · Mathematics 2016-10-06 Saugata Basu , Cordian Riener

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

Algebraic Geometry · Mathematics 2010-10-21 Saugata Basu , Dmitrii V. Pasechnik , Marie-Francoise Roy

Using the generalized coherent states we argue that the path integral formulae for $SU(2)$ and $SU(1,1)$ (in the discrete series) are WKB exact,if the starting point is expressed as the trace of $e^{-iT\hat H}$ with $\hat H$ being given by…

High Energy Physics - Theory · Physics 2010-11-01 K. Funahashi , T. Kashiwa , S. Sakoda , K. Fujii

This paper is devoted to understanding curves $X$ over a number field $k$ that possess infinitely many solutions in extensions of $k$ of degree at most $d$; such solutions are the titular low degree points. For $d=2,3$ it is known (by the…

Number Theory · Mathematics 2024-10-31 Borys Kadets , Isabel Vogt

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…

Combinatorics · Mathematics 2024-11-05 Jonathan Tidor , Hung-Hsun Hans Yu

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

Optimization and Control · Mathematics 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

Erd\H{o}s and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $\mathbb R^{d}$ determine at most $Cn^{d/2}$ congruent $k$-simplices for even $d$. We obtain the first significant progress towards this…

Combinatorics · Mathematics 2021-12-21 Nora Frankl , Andrey Kupavskii

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

Algebraic Geometry · Mathematics 2007-05-23 Saugata Basu

In this paper, we focus on ordered $k$-flaw preference sets. Let $\mathcal{OP}_{n,\geq k}$ denote the set of ordered preference sets of length $n$ with at least $k$ flaws and $\mathcal{S}_{n,k}=\{(x_1,...,x_{n-k})\mid x_1+x_2+...…

Combinatorics · Mathematics 2008-06-03 Po-Yi Huang , Jun Ma , Yeong-Nan Yeh

We obtain results on the geometry of D-semianalytic and subanalytic subsets over a complete, non-trivially valued non-Archimedean field K, which is not necessarily algebraically closed. Among the results are a parameterized smooth…

Logic · Mathematics 2007-05-23 Y. Firat Celikler

The $k$-ellipse is the plane algebraic curve consisting of all points whose sum of distances from $k$ given points is a fixed number. The polynomial equation defining the $k$-ellipse has degree $2^k$ if $k$ is odd and degree…

Algebraic Geometry · Mathematics 2011-09-27 Jiawang Nie , Pablo A. Parrilo , Bernd Sturmfels

We prove that there exists a>0 such that for any integer d>2 and any topological types S_1,...,S_n of plane curve singularities, satisfying $\mu(S_1)+...+\mu(S_n) \leq ad^2$, there exists a reduced irreducible plane curve of degree d with…

alg-geom · Mathematics 2009-10-30 Gert-Martin Greuel , Christoph Lossen , Eugenii Shustin

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

Number Theory · Mathematics 2016-08-03 Bjorn Poonen , Michael Stoll

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

In probabilistic program analysis, quantitative analysis aims at deriving tight numerical bounds for probabilistic properties such as expectation and assertion probability. Most previous works consider numerical bounds over the whole…

Programming Languages · Computer Science 2026-01-06 Tengshun Yang , Shenghua Feng , Hongfei Fu , Naijun Zhan , Jingyu Ke , Shiyang Wu