English
Related papers

Related papers: Counting Theorems for Algebraic Relations

200 papers

We define a theory of descendent integration on the moduli spaces of stable pointed disks. The descendent integrals are proved to be coefficients of the $\tau$-function of an open KdV heirarchy. A relation between the integrals and a…

Symplectic Geometry · Mathematics 2024-10-30 Rahul Pandharipande , Jake P. Solomon , Ran J. Tessler

Let $G$ be a simple graph with vertex set $V(G)$. A set $S\subseteq V(G)$ is independent if no two vertices from $S$ are adjacent. For $X\subseteq V(G)$, the difference of $X$ is $d(X) = |X|-|N(X)|$ and an independent set $A$ is critical if…

Combinatorics · Mathematics 2015-09-18 Taylor Short

We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…

Number Theory · Mathematics 2025-06-18 Gal Binyamini , Fumiharu Kato

We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…

High Energy Physics - Theory · Physics 2023-07-12 Vsevolod Chestnov , Hjalte Frellesvig , Federico Gasparotto , Manoj K. Mandal , Pierpaolo Mastrolia

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

Combinatorics · Mathematics 2007-05-23 Jeff Kahn , Gil Kalai

Let $X$ be a convex polyomino such that its vertex set is a sublattice of $\mathbb{N}^2$. Let $\Bbbk[X]$ be the toric ring (over a field $\Bbbk$) associated to $X$ in the sense of Qureshi, \emph{J. Algebra}, 2012. Write the Hilbert series…

Commutative Algebra · Mathematics 2021-10-29 Manoj Kummini , Dharm Veer

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Algebraic Geometry · Mathematics 2016-09-06 J. Maurice Rojas

We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…

Number Theory · Mathematics 2014-09-09 Emmanuel Hallouin , Marc Perret

We develop a theory of vector-valued heights and intersections defined relative to finitely generated extensions K/k. These generalize both number field and geometric heights. When k is Q or F_p, or when a non-isotriviality condition holds,…

Number Theory · Mathematics 2020-10-15 Alexander Carney

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

Number Theory · Mathematics 2022-09-26 Gerold Schefer

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal

Let $n \in \mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and finitely many algebraic curves $T_1, \ldots, T_k$ with the following property: if $(x_1, \ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular moduli…

Number Theory · Mathematics 2025-02-26 Vahagn Aslanyan , Sebastian Eterović , Guy Fowler

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

Metric Geometry · Mathematics 2021-08-17 Brett Leroux , Luis Rademacher

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

Metric Geometry · Mathematics 2020-09-08 Travis Dillon , Pablo Soberón

Let $C$ be an irreducible algebraic curve defined over a number field and inside an algebraic torus of dimension at least 3. We partially answer a question posed by Levin on points on $C$ for which a non-trivial power lies again on $C$. Our…

Number Theory · Mathematics 2015-04-23 Martin Bays , Philipp Habegger

Let K be a field and let L/K be a finite extension. Let X/K be a scheme of finite type. A point of X(L) is said to be new if it does not belong to the union of X(F), when F runs over all proper subextensions of L. Fix now an integer g>0 and…

Number Theory · Mathematics 2017-11-10 Qing Liu , Dino Lorenzini

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

Metric Geometry · Mathematics 2019-07-12 Gergely Ambrus

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

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$,…

Combinatorics · Mathematics 2023-06-27 József Balogh , William Linz

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff