Related papers: Explicit orthogonal and unitary designs

Let $\Psi_{k,n}$ denote the number of inequivalent binary self-orthogonal $[n,k]$ codes. We present a method which allows us to compute $\Psi_{k,n}$ explicitly for a moderate $k$ and an arbitrary $n$. Included in this paper are explicit…

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

In this paper, orthogonal projection along a geodesic to the chosen k-plane is introduced using edge and Gram matrix of an n-simplex in hyperbolic or spherical n-space. The distance from a point to k-plane is obtained by the orthogonal…

A family of multivariate orthogonal polynomials generalizing the standard (univariate) Charlier polynomials is shown to arise in the matrix elements of the unitary representation of the Euclidean group E(d) on oscillator states. These…

We introduce the concept of n-OU and n-OO matrix sets, a collection of n mutually-orthogonal unitary and real orthogonal matrices under Hilbert-Schmidt inner product. We give a detailed characterization of order-three n-OO matrix sets under…

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as…

Formulas for the expansion of arbitrary invariant group functions in terms of the characters for the Sp(2N), SO(2N+1), and SO(2N) groups are derived using a combinatorial method. The method is similar to one used by Balantekin to expand…

This article is devoted to the investigation of semidirect products of groups of loops and groups of diffeomorphisms of finite and infinte dimensional real, complex and quaternion manifolds. Necessary statements about quaternion manifolds…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

During their investigation of power-sequence terraces, Anderson and Preece briefly mention a construction of a terrace for the cyclic group $\mathbb{Z}_n$ when $n$ is odd and $2n+1$ is prime; it is built using the discrete logarithm modulo…

In the Maximum Independent Set of Objects problem, we are given an $n$-vertex planar graph $G$ and a family $\mathcal{D}$ of $N$ objects, where each object is a connected subgraph of $G$. The task is to find a subfamily $\mathcal{F}…

In this paper we investigate linear error correcting codes and projective caps related to the Grassmann embedding $\varepsilon_k^{gr}$ of an orthogonal Grassmannian $\Delta_k$. In particular, we determine some of the parameters of the codes…

We describe a (3,3)-homogeneous orthomodular posets for some cardinality of their sets of atoms. We examine a state space and a set of two-valued states of such logics. Particular homogeneous OMPs with exactly k pure states (k=1,...,7,…

Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…

A design is called $t$-pyramidal when it has an automorphism group which fixes $t$ points and acts sharply transitively on the remaining points. We determine all symmetric $(2^k-1,2^{k-1},2^{k-2})$-designs which are $(2^{k-1}-1)$-pyramidal…

A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…

We find an explicit presentation of relative odd unitary Steinberg groups constructed by odd form rings and of relative doubly laced Steinberg groups over commutative rings, i.e. the Steinberg groups associated with the Chevalley group…