中文
相关论文

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

200 篇论文

In 2007, Ando and Egawa proved a theorem which provides a lower bound on the number of contractible edges preserving $4$-connectedness in $4$-connected graphs. In this paper, we refine their bounds, especially for the $4$-connected plane…

组合数学 · 数学 2026-04-06 Toshiki Abe , Michitaka Furuya , Raiji Mukae , Shoichi Tsuchiya

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…

数论 · 数学 2023-01-24 Eva Bayer-Fluckiger , Martino Borello , Peter Jossen

Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.

代数几何 · 数学 2012-08-24 Iwona Krzyżanowska , Zbigniew Szafraniec

At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in…

代数几何 · 数学 2016-06-14 Alessandro De Paris

Let $\epsilon, C$ be two positive real numbers, and $\mathcal C \subset \mathbb R$ be a DCC (descending chain condition) set. Let $(X, B = \sum b_j B_j)$ denote a projective surface with an $\mathbb R$-divisor. Then (1) The class $\{X\}$ of…

alg-geom · 数学 2017-02-20 Valery Alexeev

Let $Y$ be the complement of a plane quartic curve $D$ defined over a number field. Our main theorem confirms the Lang-Vojta conjecture for $Y$ when $D$ is a generic smooth quartic curve, by showing that its integral points are confined in…

数论 · 数学 2017-02-14 Dohyeong Kim

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

组合数学 · 数学 2020-02-25 Aaron Lin , Konrad Swanepoel

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

环与代数 · 数学 2022-11-28 Nicolas Doyon , Pierre-Olivier Parisé , William Verreault

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

组合数学 · 数学 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Boppana and Holzman (2017) proved that at least 13/32 of these sums satisfy $|S| \le 1$. Here we improve…

组合数学 · 数学 2021-06-07 Ravi B. Boppana , Harrie Hendriks , Martien C. A. van Zuijlen

The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…

数据结构与算法 · 计算机科学 2019-11-01 Victor Reis , Thomas Rothvoss

It is proved that the discriminant of $n\times n$ real symmetric matrices can be written as a sum of squares, where the number of summands equals the dimension of the space of $n$-variable spherical harmonics of degree $n$. The…

表示论 · 数学 2012-06-13 M. Domokos

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

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

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…

数论 · 数学 2013-08-19 Lenny Fukshansky , Glenn Henshaw

In our previous paper we have elaborated a certain signed count of real lines on real projective n-dimensional hypersurfaces of degree 2n-1. Contrary to the honest "cardinal" count, it is independent of the choice of a hypersurface, and by…

代数几何 · 数学 2019-11-19 Sergey Finashin , Viatcheslav Kharlamov

We examine quadratic surfaces in 3-space that are tangent to nine given figures. These figures can be points, lines, planes or quadrics. The numbers of tangent quadrics were determined by Hermann Schubert in 1879. We study the associated…

代数几何 · 数学 2021-05-20 Taylor Brysiewicz , Claudia Fevola , Bernd Sturmfels

It is well-known that the number of non-crossing perfect matchings of $2k$ points in convex position in the plane is $C_k$, the $k$th Catalan number. Garc\'ia, Noy, and Tejel proved in 2000 that for any set of $2k$ points in general…

计算几何 · 计算机科学 2015-02-19 Andrei Asinowski

We prove the sharp bound of at most 64 lines on complex projective quartic surfaces (resp. affine quartics) that are not ruled by lines. We study configurations of lines on certain non-K3 surfaces of degree four and give various examples of…

代数几何 · 数学 2017-05-23 Víctor González-Alonso , Sławomir Rams

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…

几何拓扑 · 数学 2012-08-21 Sergei Lanzat , Michael Polyak

We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…

度量几何 · 数学 2017-08-10 Adrian Dumitrescu , Csaba D. Tóth