Related papers: Explicit orthogonal and unitary designs

Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…

We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…

A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a…

An $(n_k)$-configuration is a set of $n$ points and $n$ lines in the projective plane such that their point-line incidence graph is $k$-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are…

A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…

In this paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…

Calculating the diameter of an undirected graph requires quadratic running time under the Strong Exponential Time Hypothesis and this barrier works even against any approximation better than 3/2. For planar graphs with positive edge…

For each irreducible module of the symmetric group on $N$ objects there is a set of parametrized nonsymmetric Jack polynomials in $N$ variables taking values in the module. These polynomials are simultaneous eigenfunctions of a commutative…

We provide a new tableau model from which one can easily deduce the characters of finite-dimensional irreducible polynomial representations of the special orthogonal group $SO_n(\mathbb{C})$. This model originates from the representation…

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

Let $A \in \mathbb{R}^{n \times n}$ be invertible, $x \in \mathbb{R}^n$ unknown and $b =Ax $ given. We are interested in approximate solutions: vectors $y \in \mathbb{R}^n$ such that $\|Ay - b\|$ is small. We prove that for all $0<…

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…

We present a Veronese formulation of the octonionic and split-octonionic projective and hyperbolic planes. This formulation of the incidence planes highlights the relationship between the Veronese vectors and the rank-1 elements of the…

We derive a family of high-order, structure-preserving approximations of the Riemannian exponential map on several matrix manifolds, including the group of unitary matrices, the Grassmannian manifold, and the Stiefel manifold. Our…

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum…

Let $k$ be a commutative Noetherian ring, and $k[S]$ the polynomial ring whose indeterminates are parameterized by elements in a set $S$. We show that $k[S]$ is Noetherian up to highly homogenous actions of groups. In particular, there is a…

In this paper, we study matricial representations of certain finitely presented groups with N-generators of order-2. As an application, we consider a group algebra under our representations. Specifically, we characterize the inverses of all…

Classifying orthogonal arrays is a well known important class of problems that asks for finding all non-isomorphic, non-negative integer solutions to a class of systems of constraints. Solved instances are scarce. We develop two new methods…

We study the problem of $k$-means clustering in the space of straight-line segments in $\mathbb{R}^{2}$ under the Hausdorff distance. For this problem, we give a $(1+\epsilon)$-approximation algorithm that, for an input of $n$ segments, for…