Related papers: Bounds on ordered codes and orthogonal arrays
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$.…
We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of…
In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…
We present an overview of randomized orthogonalization techniques that construct a well-conditioned basis whose sketch is orthonormal. Randomized orthogonalization has recently emerged as a powerful paradigm for reducing the computational…
The Krakow-Orsay collaboration has applied methods borrowed from equilibrium statistical mechanics and analytic combinatorics to study the geometry of random networks. Results contained in a series of recent publications and concerning…
Spectral correlations in unitary invariant, non-Gaussian ensembles of large random matrices possessing an eigenvalue gap are studied within the framework of the orthogonal polynomial technique. Both local and global characteristics of…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
Connection coefficients between different orthonormal bases satisfy two discrete orthogonal relations themselves. For classical orthogonal polynomials whose weights are invariant under the action of the symmetric group, connection…
We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and…
We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…
A long-standing sample compression conjecture asks to linearly bound the size of the optimal sample compression schemes by the Vapnik-Chervonenkis (VC) dimension of an arbitrary class. In this paper, we explore the rich metric and…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
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 consider an arrangement $\A$ of $n$ hyperplanes in $\R^d$ and the zone $\Z$ in $\A$ of the boundary of an arbitrary convex set in $\R^d$ in such an arrangement. We show that, whereas the combinatorial complexity of $\Z$ is known only to…