Related papers: On tight spherical designs

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…

We have made substantial advances in elucidating the properties of the susceptibility of the square lattice Ising model. We discuss its analyticity properties, certain closed form expressions for subsets of the coefficients, and give an…

A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…

The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear…

We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…

For a positive integer $n$, let $\mathcal T(n)$ be the set of all integers greater than or equal to $n$. An integral quadratic form $f$ is called tight $\mathcal T(n)$-universal if the set of nonzero integers that are represented by $f$ is…

The aim of this paper is to present a construction of $t$-divisible designs for $t>3$, because such divisible designs seem to be missing in the literature. To this end, tools such as finite projective spaces and their algebraic varieties…

We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Generalizations of QCD in which the number of colors N is taken to infinity are characterized by profound mathematical properties, with far-reaching implications for fundamental problems and for phenomenological issues alike. In this…

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

We study the connection between the theory of spherical designs and the question of extrema of the height function of lattices. More precisely, we show that a full-rank n-dimensional Euclidean lattice, all layers of which hold a spherical…

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…

The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…

We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…

Relative $t$-designs in the $n$-dimensional hypercube $\mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,\lambda)$ designs by allowing multiple block sizes as well as…

Let $f(\mathbf x)$ be a non-singular quadratic form with sufficiently many mixed terms and $t$ an integer. For a sequence of weights $\mathcal A$ we study the number of weighted solutions to $f(\mathbf x) = t$. In particular, we give…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…