Related papers: Equiangular lines in Euclidean spaces: dimensions …
We provide a new upper bound on the number of conjugacy classes in the group $U_n(q)$ of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of $U_n(q)$.
It has been conjectured that the optimal canonical degree of a minimal surface of general type is 36, from a work in the 70's of Beauville who proved that 36 was an upper bound. The highest canonical degree known for the problem was 16 by…
The geometric measure of entanglement of a pure quantum state is defined to be its distance to the space of product (seperable) states. Given an $n$-partite system composed of subsystems of dimensions $d_1,\ldots, d_n$, an upper bound for…
For lengths up to 47 except 37, we determine the largest minimum Euclidean weight among all Type I Z4-codes of that length. We also give the first example of an optimal odd unimodular lattice in dimension 41 explicitly, which is constructed…
We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…
We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we…
We prove that triangulations with maximum degree at most 5 satisfy the List-Edge-Coloring Conjecture.
In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…
We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of $q^r$-divisible codes over $\mathbb{F}_q$. We also give a few…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
We give some concrete constructions of real equiangular line sets. The emphasis here is on {\em building blocks} for certain angles which are then used to build up larger equiangular line sets. We concentrate on angles greater than or equal…
We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…
A lattice equable quadrilateral is a quadrilateral in the plane whose vertices lie on the integer lattice and which is equable in the sense that its area equals its perimeter. This paper treats the tangential and extangential cases. We show…
Recently we gave arguments that only two unique topologically different configurations of 7 equal all mutually touching round cylinders (the configurations being mirror reflections of each other) are possible in 3D, although a whole world…
How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…
Resolving the tension between quantum superpositions and the uniqueness of the classical world is a major open problem. One possibility, which is extensively explored both theoretically and experimentally, is that quantum linearity breaks…
A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…
We construct a new class of quasi-exactly solvable many-body Hamiltonians in arbitrary dimensions, whose ground states can have any correlations we choose. Some of the known correlations in one dimension and some recent novel correlations…
The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…
We study the proximity of the optimal value of the m-dimensional knapsack problem to the optimal value of that problem with the additional restriction that only one type of items is allowed to include in the solution. We derive exact and…