中文
相关论文

相关论文: Bounding the signed count of real bitangents to pl…

200 篇论文

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

离散数学 · 计算机科学 2020-08-11 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , Torsten Ueckerdt , David R. Wood

We compare two partitions of real bitangents to smooth plane quartics into sets of 4: one coming from the closures of connected components of the avoidance locus and another coming from tropical geometry. When both are defined, we use the…

代数几何 · 数学 2024-11-20 Hannah Markwig , Sam Payne , Kris Shaw

We study the topology of the set X of the solutions of a system of two quadratic inequalities in the real projective space RP^n (e.g. X is the intersection of two real quadrics). We give explicit formulae for its Betti numbers and for those…

代数几何 · 数学 2012-09-07 Antonio Lerario

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

代数几何 · 数学 2014-03-25 Wouter van Heijst

In this short note we prove a sector counting lemma for a class of Fermi surface on the plane which are $C^2$-differentiable and strictly convex. This result generalizes the one proved in \cite{FKT} for the class of…

数学物理 · 物理学 2021-09-20 Zhituo Wang

We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…

代数几何 · 数学 2024-08-28 Máté L. Telek

One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…

代数几何 · 数学 2013-08-20 A. Popolitov , Sh. Shakirov

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

组合数学 · 数学 2010-10-12 George B. Purdy , Justin W. Smith

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

最优化与控制 · 数学 2008-09-22 Didier Henrion

In the present paper, we revisit the geometry of smooth plane quartics and their bitangents from several perspectives. First, we study in detail the weak combinatorics of arrangements of bitangents associated with highly symmetric quartic…

代数几何 · 数学 2025-02-17 Marek Janasz , Piotr Pokora , Marcin Zieliński

We define a signed count of real rational pseudo-holomorphic curves appearing in a one-parameter family of real Spin symplectic K3 surfaces. We show that this count is an invariant of the deformation class of the family. In the case of a…

辛几何 · 数学 2015-04-17 Crétois Rémi

The intersection of a quadric and a cubic surface in 3-space is a canonical curve of genus 4. It has 120 complex tritangent planes. We present algorithms for computing real tritangents, and we study the associated discriminants. We focus on…

代数几何 · 数学 2018-06-08 Avinash Kulkarni , Yue Ren , Mahsa Sayyary Namin , Bernd Sturmfels

We study lines on smooth cubic surfaces over the field of $p$-adic numbers, from a theoretical and computational point of view. Segre showed that the possible counts of such lines are $0,1,2,3,5,7,9,15$ or $27$. We show that each of these…

代数几何 · 数学 2023-09-25 Rida Ait El Manssour , Yassine El Maazouz , Enis Kaya , Kemal Rose

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

组合数学 · 数学 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

组合数学 · 数学 2007-05-23 A. Iosevich , M. Rudnev , V. Ten

Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…

度量几何 · 数学 2024-02-09 Javier Cabello Sánchez , Adrián Gordillo-Merino

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

数论 · 数学 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

The characteristic numbers of smooth plane quartics are computed using intersection theory on a component of the moduli space of stable maps. This completes the verification of Zeuthen's prediction of characteristic numbers of smooth plane…

代数几何 · 数学 2007-05-23 Ravi Vakil

In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…

代数几何 · 数学 2026-03-17 Milena Radnović , Ruzzel Ragas

In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…

交换代数 · 数学 2011-08-18 Laurent Busé , Guillaume Chèze