English
Related papers

Related papers: Lines in higgledy-piggledy position

200 papers

A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$…

Metric Geometry · Mathematics 2007-09-24 David Bremner , Antoine Deza , Feng Xie

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

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

Metric Geometry · Mathematics 2020-02-11 T. M. Osipchuk

A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.

Algebraic Geometry · Mathematics 2016-08-10 Masaaki Homma , Seon Jeong Kim

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

Combinatorics · Mathematics 2025-12-16 N. N. Avdeev , E. A. Lushina

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \in…

Computational Geometry · Computer Science 2019-08-22 Therese Biedl , Stefan Felsner , Henk Meijer , Alexander Wolff

A blocking set in an affine plane is a set of points $B$ such that every line contains at least one point of $B$. The best known lower bound for blocking sets in arbitrary (non-desarguesian) affine planes was derived in the 1980's by Bruen…

Combinatorics · Mathematics 2018-04-26 Maarten De Boeck , Geertrui Van de Voorde

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Group Theory · Mathematics 2023-09-29 Nikolay Nikolov

We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…

Algebraic Geometry · Mathematics 2010-03-29 Gábor Megyesi , Frank Sottile

The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…

Metric Geometry · Mathematics 2007-10-02 Antoine Deza , Feng Xie

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…

Information Theory · Computer Science 2010-12-17 Arya Mazumdar , Ron M. Roth , Pascal O. Vontobel

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

Rings and Algebras · Mathematics 2024-08-20 Gustavo Granja , Aleksandar Milivojevic

All possible interactions of a point particle with background electromagnetic, gravitational and higher-spin fields is considered in the two-time physics worldline formalism in (d,2) dimensions. This system has a counterpart in a recent…

High Energy Physics - Theory · Physics 2009-11-07 Itzhak Bars , Cemsinan Deliduman

A family of sets $F$ is said to satisfy the $(p,q)$ property if among any $p$ sets in $F$, some $q$ have a non-empty intersection. Hadwiger and Debrunner (1957) conjectured that for any $p \geq q \geq d+1$ there exists $c=c_d(p,q)$, such…

Combinatorics · Mathematics 2018-11-06 Chaya Keller , Shakhar Smorodinsky

We compute part of the superfield in terms of the component fields of 11-dimensional on-shell supergravity by using `Gauge completion' in 2nd-order formalism. The result is the same as was derived recently in 1.5-order formalism by B. de…

High Energy Physics - Theory · Physics 2007-05-23 Yuuichirou Shibusa

Let F be R or C, d the dimension of F over R. Denote by P(F) either the affine plane A(F) or the hyperbolic plane H(F) over F. An arrangement L of k lines in P(F) (pairwise non-parallel in the hyperbolic case) has a link at infinity K(L)…

Geometric Topology · Mathematics 2007-05-23 Lee Rudolph

Having in mind their potential quantum physical applications, we classify all geometric hyperplanes of the near hexagon that is a direct product of a line of size three and the generalized quadrangle of order two. There are eight different…

Mathematical Physics · Physics 2009-12-07 Metod Saniga , Peter Levay , Michel Planat , Petr Pracna

Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…

Metric Geometry · Mathematics 2007-05-23 Christopher J. Hillar , Darren L. Rhea
‹ Prev 1 4 5 6 7 8 10 Next ›