English
Related papers

Related papers: On the Guy-Kelly Conjecture for the No-Three-In-Li…

200 papers

A mistake is pointed out in EGA I, Elements of algebraic geometry, concerning corollary (2.4.4) which is not correct. Quite likely, the hitch has already been noticed, and reported, but we know not who, nor where. New research is…

Algebraic Geometry · Mathematics 2016-10-18 Labib Haddad

Bell's theorem states that no description of a Bell experiment can be simultaneously local, realistic in the sense of counterfactual definiteness, and free of conspiracy between settings and hidden state. The recent generation of…

Quantum Physics · Physics 2026-05-15 Richard D Gill , Inge S. Helland , Bart Jongejan

We prove new results on existence of solutions for the prescribed gaussian curvature problem on the euclidean sphere S^2. Those results are achieved by relating this problem with the holomorphic triples theory on Riemann surfaces. We think…

Differential Geometry · Mathematics 2015-03-20 Alexandre C. Gonçalves

There are two invariants associated to any line arrangement: the freeness defect $\nu(C)$ and an upper bound for it, denoted by $\nu'(C)$, coming from a recent result by Uli Walther. We show that $\nu'(C)$ is combinatorially determined, at…

Algebraic Geometry · Mathematics 2019-02-26 Alexandru Dimca , Gabriel Sticlaru

We provide a geometric proof of the Schubert calculus interpretation of the Horn conjecture, and show how the saturation conjecture follows from it. The geometric proof gives a strengthening of Horn and saturation conjectures. We also…

Algebraic Geometry · Mathematics 2007-05-23 Prakash Belkale

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , Micha Sharir

In this paper, we investigate the relative power of several conjectures that attracted recently lot of interest. We establish a connection between the Network Coding Conjecture (NCC) of Li and Li and several data structure like problems…

Computational Complexity · Computer Science 2021-02-19 Pavel Dvořák , Michal Koucký , Karel Král , Veronika Slívová

Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…

Number Theory · Mathematics 2008-03-06 Graham Everest , Valery Mahe

The Golomb-Welch conjecture (1968) states that there are no $e$-perfect Lee codes in $\mathbb{Z}^n$ for $n\geq 3$ and $e\geq 2$. This conjecture remains open even for linear codes. A recent result of Zhang and Ge establishes the…

Information Theory · Computer Science 2018-09-25 Claudio Qureshi

We show new upper and lower bounds for the effective differential Nullstellensatz for differential fields of characteristic zero with several commuting derivations. Seidenberg was the first to address this problem in 1956, without giving a…

Commutative Algebra · Mathematics 2020-11-17 Richard Gustavson , Marina Kondratieva , Alexey Ovchinnikov

Building on the genus-3 reduction $C_A : w^2 = \lambda^8 + A \lambda^4 + 1$ established in our companion paper (arXiv:2604.09328), we give an unconditional proof of the perfect-cuboid conjecture ("Conjecture B") on $1{,}072$ explicit…

Number Theory · Mathematics 2026-05-01 René Peschmann

The computation of the dimension of linear systems of plane curves through a bunch of given multiple points is one of the most classic issues in Algebraic Geometry. In general, it is still an open problem to understand when the points fail…

Algebraic Geometry · Mathematics 2020-04-07 Łucja Farnik , Francesco Galuppi , Luca Sodomaco , William Trok

The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is 220/219 due to…

Computational Complexity · Computer Science 2012-06-13 Michael Lampis

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

Combinatorics · Mathematics 2024-11-07 Dániel T. Nagy , Zoltán Lóránt Nagy , Russ Woodroofe

We prove the GGS conjecture (1993), due to Gerstenhaber, Giaquinto, and Schack, which gives a particularly simple explicit quantization of classical r-matrices for Lie algebras gl(n) in terms of an element R satisfying the quantum…

Quantum Algebra · Mathematics 2007-05-23 Travis Schedler

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

Given any set of points $S$ in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in $S$, exist, such that each of them has a point in $S$ as its lower-left corner, they are pairwise interior…

Computational Geometry · Computer Science 2021-02-12 Ruben Hoeksma , Matthew Maat

Determining the precise integrality gap for the subtour LP relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years in the general case of symmetric costs that obey triangle…

Data Structures and Algorithms · Computer Science 2011-07-11 Frans Schalekamp , David P. Williamson , Anke van Zuylen

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

Combinatorics · Mathematics 2023-12-25 Ting-Wei Chao , Hung-Hsun Hans Yu

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

Number Theory · Mathematics 2025-04-01 M Krithika , P Vanchinathan