Related papers: Cells in the box and a hyperplane
Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…
Edoukou, Ling and Xing in 2010, conjectured that in \mathbb{P}^n(\mathbb{F}_{q^2}), n \geq 3, the maximum number of common points of a non-degenerate Hermitian variety \mathcal{U}_n and a hypersurface of degree d is achieved only when the…
For each integer $D\ge3$, we give a sharp bound on the number of lines contained in a smooth complex $2D$-polarized $K3$-surface in $\mathbb{P}^{D+1}$. In the two most interesting cases of sextics in $\mathbb{P}^4$ and octics in…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…
Consider a face-to-face parallelohedral tiling of $\mathbb R^d$ and a $(d-k)$-dimensional face $F$ of the tiling. We prove that the valence of $F$ (i.e. the number of tiles containing $F$ as a face) is not greater than $2^k$. If the tiling…
We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…
We prove that the (n-2)-dimensional surface area (perimeter) of central hyperplane sections of the n-dimensional unit cube is maximal for the hyperplane perpendicular to the vector (1,1,0,...,0). This gives a positive answer to a question…
The hyperbolic Lie algebras with symmetrizable Cartan matrix are classified, there are 142 of them some of which can be ``superized'' to an almost affine Lie superalgebra. We list all 97 pairs (a hyperbolic Lie algebra $H$, its superized…
If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…
We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…
A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting such rectangular arrays with a fixed (numeric) number of rows,…
Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…
Below we consider the evolutes of plane real-algebraic curves and discuss some of their complex and real-algebraic properties. In particular, for a given degree $d\ge 2$, we provide lower bounds for the following four numerical invariants:…
We prove that if a finite point set in real space does not have too many points on a plane, then it spans a quadratic number of ordinary lines. This answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows that there is…
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
We consider the following problem: Preprocess a set $\mathcal{S}$ of $n$ axis-parallel boxes in $\mathbb{R}^d$ so that given a query of an axis-parallel box in $\mathbb{R}^d$, the pairs of boxes of $\mathcal{S}$ whose intersection…
A family of subsets of $\{1,\ldots,n\}$ is called {\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…