8,802 research outputs found
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
We formulate and give partial answers to several combinatorial problems on
volumes of simplices determined by points in 3-space, and in general in
dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by
points in \RR^3 is at most , and there are point sets
for which this number is . We also present an time
algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby
extend an algorithm of Edelsbrunner, O'Rourke, and Seidel. In general, for
every k,d\in \NN, , the maximum number of -dimensional
simplices of minimum (nonzero) volume spanned by points in \RR^d is
. (ii) The number of unit-volume tetrahedra determined by
points in \RR^3 is , and there are point sets for which this
number is . (iii) For every d\in \NN, the minimum
number of distinct volumes of all full-dimensional simplices determined by
points in \RR^d, not all on a hyperplane, is .Comment: 19 pages, 3 figures, a preliminary version has appeard in proceedings
of the ACM-SIAM Symposium on Discrete Algorithms, 200
On hyperovals of polar spaces
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank 3. We give a computer-free proof for the uniqueness, up to isomorphism, of the hyperoval of size 126 of H(5, 4) and prove that the near hexagon E-3 has up to isomorphism a unique full embedding into the dual polar space DH(5, 4)
An Improved Point-Line Incidence Bound Over Arbitrary Fields
We prove a new upper bound for the number of incidences between points and
lines in a plane over an arbitrary field , a problem first
considered by Bourgain, Katz and Tao. Specifically, we show that points and
lines in , with , determine at most
incidences (where, if has positive
characteristic , we assume ). This improves on the
previous best known bound, due to Jones. To obtain our bound, we first prove an
optimal point-line incidence bound on Cartesian products, using a reduction to
a point-plane incidence bound of Rudnev. We then cover most of the point set
with Cartesian products, and we bound the incidences on each product
separately, using the bound just mentioned. We give several applications, to
sum-product-type problems, an expander problem of Bourgain, the distinct
distance problem and Beck's theorem.Comment: 18 pages. To appear in the Bulletin of the London Mathematical
Societ
Polygonal valuations
AbstractWe develop a valuation theory for generalized polygons similar to the existing theory for dense near polygons. This valuation theory has applications for the study and classification of generalized polygons that have full subpolygons as subgeometries
- …