English
Related papers

Related papers: Lines in higgledy-piggledy position

200 papers

A locally compact stable plane of positive topological dimension will be called semiaffine if for every line $L$ and every point $p$ not in $L$ there is at most one line passing through $p$ and disjoint from $L$. We show that then the plane…

Geometric Topology · Mathematics 2024-10-15 Rainer Löwen , Markus Johannes Stroppel

A partial geometry $S$ admitting an abelian Singer group $G$ is called of rigid type if all lines of $S$ have a trivial stabilizer in $G$. In this paper, we show that if a partial geometry of rigid type has fewer than $1000000$ points it…

Combinatorics · Mathematics 2020-07-29 Stefaan De Winter , Ellen Kamischke , Eric Neubert , Zeying Wang

This work deals with the presence of topological structures in models of two real scalar fields in the two-dimensional spacetime. The subject concerns the presence of a geometric constriction, which appears with a modification of the…

High Energy Physics - Theory · Physics 2024-03-11 D. Bazeia , M. A. Feitosa , R. Menezes , G. S. Santiago

We show that the conditions imposed on a second order linear differential equation with rational coefficients on the complex line by requiring it to have regular singularities with fixed exponents at the points of a finite set $P$ and…

Algebraic Geometry · Mathematics 2016-08-09 Szilard Szabo

In this work we reproduce the characterization of $\Gg^s$-sets from the euclidean setting [J. London Math. Soc. 49:267-280,1994] to more general metric spaces. These sets have Hausdorff dimension at least $s$ and are closed by countable…

Metric Geometry · Mathematics 2021-06-10 Felipe Negreira , Emiliano Sequeira

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

Combinatorics · Mathematics 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the…

Combinatorics · Mathematics 2026-04-02 Tilen Marc

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Combinatorics · Mathematics 2014-12-30 Pierre Aboulker , Xiaomin Chen , Guangda Huzhang , Rohan Kapadia , Cathryn Supko

We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…

Combinatorics · Mathematics 2007-05-23 L. M. Pretorius , K. J. Swanepoel

We study the rigidity properties of Grassmannian frames: basis-like sets of unit vectors that correspond to optimal Grassmannian line packings. It is known that Grassmannian frames characterized by the Welch bound must satisfy the…

Functional Analysis · Mathematics 2017-02-21 Peter G. Casazza , John I. Haas

A basis of the ideal of the complement of a linear subspace in a projective space over a finite field is given. As an application, the second largest number of points of plane curves of degree $d$ over the finite field of $q$ elements is…

Algebraic Geometry · Mathematics 2015-09-09 Masaaki Homma , Seon Jeong Kim

We study subsystem codes whose gauge group has local generators in the 2D geometry. It is shown that there exists a family of such codes defined on lattices of size LxL with the number of logical qubits k and the minimum distance d both…

Quantum Physics · Physics 2013-05-29 Sergey Bravyi

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

Combinatorics · Mathematics 2015-09-21 János Barát , Géza Tóth

It is shown that the maximum size of a binary subspace code of packet length $v=6$, minimum subspace distance $d=4$, and constant dimension $k=3$ is $M=77$; in Finite Geometry terms, the maximum number of planes in $\operatorname{PG}(5,2)$…

Combinatorics · Mathematics 2015-10-16 Thomas Honold , Michael Kiermaier , Sascha Kurz

We classify complex hyperplane arrangements $\mathcal A$ whose intersection posets $L(\mathcal A)$ satisfy $L(\mathcal A)=\pi_i^{-1}\circ\pi_i\bigl(L(\mathcal A)\bigr)$ for $i=1,\dots,n$. Here $\pi_i$ denotes the projection from $\mathbb…

Combinatorics · Mathematics 2025-10-14 Toshio Oshima

A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n -…

Combinatorics · Mathematics 2025-06-04 Panna Gehér , Géza Tóth

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

We identify the semigroups consisting of bounded composition operators on the Hardy spaces $H^p(\U)$ of the upper half-plane. We show that any such semigroup is strongly continuous on $H^p(\U)$ but not uniformly continuous and we identify…

Functional Analysis · Mathematics 2011-09-27 Athanasios G. Arvanitidis

This note is an appendix to 'Measures of irrationality for hypersurfaces of large degree' by L. Ein, R. Lazarsfeld and B. Ullery. We prove an existence result for families of curves having low gonality, and lying on fundamental loci of…

Algebraic Geometry · Mathematics 2016-12-01 Francesco Bastianelli , Pietro De Poi

We show that any set of $n$ points in general position in the plane determines $n^{1-o(1)}$ pairwise crossing segments. The best previously known lower bound, $\Omega\left(\sqrt n\right)$, was proved more than 25 years ago by Aronov, Erd\H…

Combinatorics · Mathematics 2023-05-02 János Pach , Natan Rubin , Gábor Tardos
‹ Prev 1 8 9 10 Next ›