Related papers: Bounds on ordered codes and orthogonal arrays

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic…

We study the packing dimension of unions of subsets of $k$-planes in $\mathbb{R}^n$ using tools from algorithmic information theory, obtaining an analog of a result of H\'era and a mild generalization of a recent result of Fraser. Along the…

The set of subspaces of a given dimension in an attenuated space has a structure of a symmetric association scheme and this association scheme is called an association scheme based on an attenuated space. Association schemes based on…

We obtain a combinatorial expression for the coefficients of the boundary map of real isotropic and odd orthogonal Grassmannians providing a natural generalization of the formulas already obtained for Lagrangian and maximal isotropic…

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…

We establish a new set of pointwise inequalities that order curvature invariants across various Petrov and Segre types of spacetimes. In arbitrary spacetime dimension, we systematically analyze inequalities among contractions of the Ricci…

A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…

We obtain the eigenvalues of the harmonic oscillator in a space with a screw dislocation. By means of a suitable nonorthogonal basis set with variational parameters we obtain sufficiently accurate eigenvalues for an arbitrary range of…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

We present a number of new results about range searching for colored (or "categorical") data: 1. For a set of $n$ colored points in three dimensions, we describe randomized data structures with $O(n\mathop{\rm polylog}n)$ space that can…

We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…

Random Matrix Theory is a powerful tool in applied mathematics. Three canonical models of random matrix distributions are the Gaussian Orthogonal, Unitary and Symplectic Ensembles. For matrix ensembles defined on k-fold tensor products of…

We study the eigenvalues of a Laplace-Beltrami operator defined on the set of the symmetric polynomials, where the eigenvalues are expressed in terms of partitions of integers. By assigning partitions with the restricted uniform measure,…

Let $R$ be the polynomial ring in $n$ variables with coefficients in a field $K$ of characteristic zero. Let $D_n$ be the $n$-th Weyl algebra over $K$. Suppose that $f \in R$ defines a hyperplane arrangement in the affine space $K^n$. Then…

For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours…

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue…

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by…

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

The orthogonality relations of multivariate Krawtchouk polynomials are discussed. In case of two variables, the necessary and sufficient conditions of orthogonality is given by Gr\"unbaum and Rahman in [SIGMA 6 (2010), 090, 12 pages,…