Related papers: Bounds on ordered codes and orthogonal arrays
We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…
The relationship between associative composition algebras of dimensions 2 and 4 within the context of homogeneous spaces, with a particular focus on Hamiltonian quaternions, is explored. In the special case of Hamiltonian quaternions, the…
We study configuration spaces of linkages whose underlying graph are polygons with diagonal constrains, or more general, partial two-trees. We show that (with an appropriate definition) the oriented area is a Bott-Morse function on the…
It has been shown that the Cartan subalgebra of $W_{\infty}$- algebra is the space of the two-variable, definite-parity polynomials. Explicit expressions of these polynomials, and their basic properties are presented. Also has been shown…
Convex neural codes are subsets of the Boolean lattice that record the intersection patterns of convex sets in Euclidean space. Much work in recent years has focused on finding combinatorial criteria on codes that can be used to classify…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
Mixed level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao and Gilbert-Varshamov type bounds for mixed level orthogonal arrays. The computational complexity of the terms involved…
Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…
We study $T$-designs in the nonbinary Johnson scheme. This scheme generalizes both the Johnson and Hamming schemes and admits a bivariate $Q$-polynomial structure. Zhu (2021) provided a combinatorial characterization of $T$-designs in this…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
In this note, we present an analogue for codes in vector spaces with a Rosenbloom-Tsfasman metric of the well-known standard form of generator matrices for codes in spaces with the Hamming metric.
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
Special bases of orthogonal polynomials are defined, that are suited to expansions of density and potential perturbations under strict particle number conservation. Particle-hole expansions of the density response to an arbitrary…
The Schr\"odinger operators with exchange terms for certain Calogero-Sutherland quantum many body systems have eigenfunctions which factor into the symmetric ground state and a multivariable polynomial. The polynomial can be chosen to have…
We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
An exact calculation of the eigenvalue statistics of truncated random Haar distributed real orthogonal matrices has recently been carried out by Khoruzhenko, Sommers and Zyczkowski. We further develop this calculation, and use it to deduce…
The optimal Orlicz target space is exhibited for embeddings of fractional-order Orlicz-Sobolev spaces in $\mathbb R^n$. An improved embedding with an Orlicz-Lorentz target space, which is optimal in the broader class of all…
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…