English
Related papers

Related papers: On a problem of Neumann

200 papers

A remarkable theorem due to Peter Dembowski states that if $I$ is an inversive plane of even order $q$ then $q$ must be a power of two and $I$ must be the incidence system of points versus plane ovals in an ovoid in the projective $3$-space…

Combinatorics · Mathematics 2023-03-06 Bhaskar Bagchi

We study congruences of lines $X_\omega$ defined by a sufficiently general choice of an alternating 3-form $\omega$ in $n+1$ dimensions, as Fano manifolds of index $3$ and dimension $n-1$. These congruences include the…

Algebraic Geometry · Mathematics 2017-02-03 Pietro De Poi , Daniele Faenzi , Emilia Mezzetti , Kristian Ranestad

We show that some important classes of weak Fano $3$-folds of Picard rank $2$ do not satisfy Bott vanishing. Using this we show that any smooth projective $3$-fold $X$ of Picard rank $2$ with $-K_X$ nef which is the image of a projective…

Algebraic Geometry · Mathematics 2025-09-05 Supravat Sarkar

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

Combinatorics · Mathematics 2016-01-28 Andrew Suk , Bartosz Walczak

We prove an extension of the homology version of the Hofer-Zehnder conjecture proved by Shelukhin to the weighted projective spaces which are symplectic orbifolds. In particular, we prove that if the number of fixed points counted with…

Symplectic Geometry · Mathematics 2024-03-25 Simon Allais

We prove the generalised Mukai conjecture for $\mathbb{Q}$-factorial spherical Fano varieties. In this case, a stronger inequality holds featuring an extra term - the minimum absolute complexity of a log Calabi-Yau pair - which measures how…

Algebraic Geometry · Mathematics 2025-12-30 Giuliano Gagliardi , Johannes Hofscheier , Heath Pearson

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

Combinatorics · Mathematics 2025-04-30 Lisa Sauermann , Zixuan Xu

For an irreducible conic $\mathcal C$ in a Desarguesian plane of odd square order, estimating the number of points from a Baer subplane which are external to $\mathcal C$ is a natural problem. In this paper, a complete list of possibilities…

Combinatorics · Mathematics 2022-02-15 Vincenzo Pallozzi Lavorante

We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…

Logic · Mathematics 2020-10-16 Filippo Calderoni , Gianluca Paolini

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of…

Metric Geometry · Mathematics 2022-08-16 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

We prove a version of the well-known Denjoy-Ahlfors theorem about the number of asymptotic values of an entire function for properly immersed minimal surfaces of arbitrary codimension in R^N. The finiteness of the number of ends is proved…

Differential Geometry · Mathematics 2009-03-03 Vladimir G. Tkachev

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Combinatorics · Mathematics 2007-05-23 Jeremy J. Carroll

We study the geometry of the Fano schemes $\mathrm{\textbf{F}}_{k}(\mathrm{SD}_n^r)$ of the projective variety $\mathrm{SD}_n^r$ defined by the $r\times r$ minors of a symmetric $n\times n$ matrix filled with indeterminates. These schemes…

Algebraic Geometry · Mathematics 2023-10-12 Ahmad Mokhtar

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$. We show that if $|R| < \frac{3}{2}n$ and $P…

Combinatorics · Mathematics 2021-10-13 Mehdi Makhul , Rom Pinchasi

We prove a general existence theorem for nonlinear partial differential systems of any order in one complex variable. A special case of first order contains a well-known theorem of Nijenhuis and Woolf concerning local existence of…

Complex Variables · Mathematics 2011-09-20 Yifei Pan

A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…

Combinatorics · Mathematics 2011-12-13 Jacob Fox , Janos Pach , Andrew Suk

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

Let $Gr(k,n)$ be the Pl\"ucker embedding of the Grassmann variety of projective $k$-planes in $\P n$. For a projective variety $X$, let $\sigma_s(X)$ denote the variety of its $s-1$ secant planes. More precisely, $\sigma_s(X)$ denotes the…

Algebraic Geometry · Mathematics 2009-01-20 Hirotachi Abo , Giorgio Ottaviani , Chris Peterson

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…

Combinatorics · Mathematics 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi