相关论文: Hyperplane Arrangements with Large Average Diamete…

For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

Given a compact connected set $E$ in the unit disk $\mathbb{B}^{2}$, we give a new upper bound for the conformal capacity of the condenser $(\mathbb{B}^{2}, E)$ in terms of the hyperbolic diameter $t$ of $E$. Moreover, for $t>0$, we…

A point set $M$ in the Euclidean plane is called a planar integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on a straight line. A planar integral point set is called to be in…

We consider configurations of six-branes, five-branes and eight-branes in various superstring backgrounds. These configurations give rise to $(0,1)$ supersymmetric theories in six dimensions. The condition for RR charge conservation of a…

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

In this paper we study the systoles of arithmetic hyperbolic 2- and 3-manifolds. Our first result is the construction of infinitely many arithmetic hyperbolic 2- and 3-manifolds which are pairwise noncommensurable, all have the same…

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…

A supersaturated design is a design whose run size is not large enough for estimating all the main effects. The goodness of multi-level supersaturated designs can be judged by the generalized minimum aberration criterion proposed by Xu and…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

The set of chambers of a real hyperplane arrangement may be ordered by separation from some fixed chamber. When this poset is a lattice, Bjorner, Edelman, and Ziegler proved that the chambers are in natural bijection with the biconvex sets…

We define and study the magnitude and magnitude homology of a real hyperplane arrangement by regarding its tope graph as a metric space. We prove several structural results for the magnitude of arrangements, including a symmetry formula,…