Circulant graphs and tessellations on flat tori

Circulant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes. Via this approach we present geometric interpretations for a bound on the diameter of a circulant graph, derive new bounds for the genus of a class of circulant graphs and establish connections with spherical codes and perfect codes in Lee spaces.     

Circulant graphs and tessellations on flat tori

Circulant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes. Via this approach we present geometric interpretations for a bound on the diameter of a circulant graph, derive new bounds for the genus of a class of circulant graphs and establish connections with spherical codes and perfect codes in Lee spaces.     

On Linear Programming Bounds for Spherical Codes and Designs

We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsartes linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as the average of the best known upper and lower bounds. When the dimension n of the design is fixed, and the strength k goes to infinity, the LP bound on designs turns out, in conjunction with known lower bounds, to be proportional to k^n-1.     

Unimodular lattices with long shadow

Let L be an odd unimodular lattice of dimension n with shadow n−16. If min(L)?3 then dim(L)?46 and there is a unique such lattice in dimension 46 and no lattices in dimensions 44 and 45. To prove this, a shadow theory for theta series with spherical coefficients is developed.     

Constructive spherical codes near the Shannon bound

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance ρ. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of ρ. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenating geometric codes meeting the TVZ bound with a Lee metric BCH code over GF(p), we obtain spherical codes that are polynomial time constructible. Their parameters outperform those obtained by Lachaud and Stern (IEEE Trans Inf Theory 40(4):1140–1146, 1994). At very high rate they are above 98% of the Shannon bound.     

A Gilbert-Varshamov-type bound for lattice packings

A Gilbert-Varshamov-type bound for Euclidean packings was recently found by Nebe and Xing. In this present paper, we derive a Gilbert-Varshamov-type bound for lattice packings by generalizing Rush's approach of combining p-ary codes with the lattice pZn. Specifically, we will exploit suitable sublattices of Zn as well as lattices of number fields in our construction. Our approach allows us to compute the center densities of lattices of moderately large dimensions which compare favorably with the best known densities given in the literature as well as the densities derived directly via Rush's method.     

How small can a lattice of order-dimension n be?

The aim of this paper is to study the order-dimension of partition lattices and linear lattices. Our investigations were motivated by a question due to Bill Sands: For a lattice L, does dim L=n always imply |L|≥2 ⁿ ? We will answer this question in the negative since both classes of lattices mentioned above form counterexamples. In the case of the partition lattices, we will determine the dimension up to an absolute constant. For the linear lattice over GF(2), L _n , we determine the dimension up to a factor C/n for an absolute constant C.     

A bound for certain <Emphasis Type="Italic">s</Emphasis>-extremal lattices and codes

In this paper we introduce the notion of s-extremal lattice for unimodular Type I lattices. We give a bound on the existence of certain such s-extremal lattices: an s-extremal lattice of dimension n and minimal even norm μ must satisfy n < 12μ. This result implies that such lattices are also extremal and that there are a finite number of them. We also give an equivalent bound for s-extremal self-dual codes: an s-extremal code with doubly-even minimum distance d and length n must satisfy n < 6d, moreover such codes are extremal. Received: 25 July 2006     

Bounds for solid angles of lattices of rank three

We find sharp absolute constants C₁ and C₂ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C₁,C₂]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in RN with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in R³. Such spherical configurations come up in connection with the kissing number problem.     

Instanton approximation, periodic ASD connections, and mean dimension

We study a moduli space of ASD connections over S³×R. We consider not only finite energy ASD connections but also infinite energy ones. So the moduli space is infinite dimensional in general. We study the (local) mean dimension of this infinite dimensional moduli space. We show the upper bound on the mean dimension by using a “Runge-approximation” for ASD connections, and we prove its lower bound by constructing an infinite dimensional deformation theory of periodic ASD connections.     

Point Sets on the Sphere \mathbb{S}^{2} with Small Spherical Cap Discrepancy

In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of spherical Fibonacci lattices converges with order?N ^?1/2. Such point sets are therefore useful for numerical integration and other computational simulations. The proof uses an area-preserving Lambert map. A?detailed analysis of the level curves and sets of the pre-images of spherical caps under this map is given.     

On the divergence of multiple Fourier-Haar series

It is proved that for any dimension n ?? 2, L(ln⁺ L) ^n?1 is the widest integral class in which the almost everywhere convergence of spherical partial sums of multiple Fourier-Haar series is provided. Moreover,it is shown that the divergence effects of rectangular and spherical general terms of multiple Fourier-Haar series can be achieved simultaneously on a set of full measure by an appropriate rearrangement of values of arbitrary summable function f not belonging to L(ln⁺ L) ^n?1.     

Dimension of the crown Skn

In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted S^k_n, for which the dimension is given by the formula $\text{2?(n+k)}\text{(k+2)}$. Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.     

A symmetric Roos bound for linear codes

The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound to prove the actual minimum distance for a class of dual BCH codes of length q²−1 over Fq. We give cyclic codes [63,38,16] and [65,40,16] over F₈ that are better than the known [63,38,15] and [65,40,15] codes.     

Asymptotically efficient two-sample rank tests for modal directions on spheres

A general class of optimal and distribution-free rank tests for the two-sample modal directions problem on (hyper-) spheres is proposed, along with an asymptotic distribution theory for such spherical rank tests. The asymptotic optimality of the spherical rank tests in terms of power-equivalence to the spherical likelihood ratio tests is studied, while the spherical Wilcoxon rank test, an important case for the class of spherical rank tests, is further investigated. A data set is reanalyzed and some errors made in previous studies are corrected. On the usual sphere, a lower bound on the asymptotic Pitman relative efficiency relative to Hotelling’s T²-type test is established, and a new distribution for which the spherical Wilcoxon rank test is optimal is also introduced.     

Non-free extensions of the simplex codes over a chain ring with four elements

Let R be a chain ring with four elements. In this paper, we present two new constructions of R-linear codes that contain a subcode associated with a simplex code over the ring R. The simplex codes are defined as the codes generated by a matrix having as columns the homogeneous coordinates of all points in some projective Hjelmslev geometry PHG(R ^k ). The first construction generalizes a recent result by Kiermaier and Zwanzger to codes of arbitrary dimension. We provide a geometric interpretation of their construction which is then extended to projective Hjelmslev spaces of arbitrary dimension. The second construction exploits the possibility of adding two non-free rows to the generator matrix of a linear code over R associated with a given point set. Though the construction works over both chain rings with four elements, the better codes are obtained for ${R=\mathbb{Z}_4}$ .     

Minimum Weight and Dimension Formulas for Some Geometric Codes

The geometric codes are the duals of the codes defined by the designs associated with finite geometries. The latter are generalized Reed–Muller codes, but the geometric codes are, in general, not. We obtain values for the minimum weight of these codes in the binary case, using geometric constructions in the associated geometries, and the BCH bound from coding theory. Using Hamada's formula, we also show that the dimension of the dual of the code of a projective geometry design is a polynomial function in the dimension of the geometry.     

On the number of lattice points in a small sphere and a recursive lattice decoding algorithm

Let L be a lattice in ${\mathbb{R}^n}$ . This paper provides two methods to obtain upper bounds on the number of points of L contained in a small sphere centered anywhere in ${\mathbb{R}^n}$ . The first method is based on the observation that if the sphere is sufficiently small then the lattice points contained in the sphere give rise to a spherical code with a certain minimum angle. The second method involves Gaussian measures on L in the sense of Banaszczyk (Math Ann 296:625–635, 1993). Examples where the obtained bounds are optimal include some root lattices in small dimensions and the Leech lattice. We also present a natural decoding algorithm for lattices constructed from lattices of smaller dimension, and apply our results on the number of lattice points in a small sphere to conclude on the performance of this algorithm.     

Extremal ranks and transformation of variables for extremes of functions of multivariate Gaussian processes

The exit rate from a ‘safe region’ plays an important role in dynamic reliability theory with multivariate random loads. For Gaussian processes the exit rate is simply calculated only for spherical or linear boundaries. However, many smooth boundaries, not of any of these types, are asymptotically spherical in variables of lower dimension, having a greater curvature in the remaining variables. As is shown in this paper, the asymptotic exit rate is then simply expressed as the exit rate from a sphere for a process of the lower dimensions, corrected by an explicit factor.The procedure circumvents the need to calculate complicated exit rate integrals for general boundaries, reducing the problem to a Gaussian probability integral for independent variables.A result of independent interest relates the tail distribution for a sum of a noncentral χ²-variable and a weighted sum of squares of noncentral normal variables, to the tail distribution of the χ²-variable only.     

Frobenius-Schur indicators and exponents of spherical categories

We obtain two formulae for the higher Frobenius-Schur indicators: one for a spherical fusion category in terms of the twist of its center and the other one for a modular tensor category in terms of its twist. The first one is a categorical generalization of an analogous result by Kashina, Sommerhäuser, and Zhu for Hopf algebras, and the second one extends Bantay's 2nd indicator formula for a conformal field theory to higher degrees. These formulae imply the sequence of higher indicators of an object in these categories is periodic. We define the notion of Frobenius-Schur (FS-)exponent of a pivotal category to be the global period of all these sequences of higher indicators, and we prove that the FS-exponent of a spherical fusion category is equal to the order of the twist of its center. Consequently, the FS-exponent of a spherical fusion category is a multiple of its exponent, in the sense of Etingof, by a factor not greater than 2. As applications of these results, we prove that the exponent and the dimension of a semisimple quasi-Hopf algebra H have the same prime divisors, which answers two questions of Etingof and Gelaki affirmatively for quasi-Hopf algebras. Moreover, we prove that the FS-exponent of H divides dim⁴(H). In addition, if H is a group-theoretic quasi-Hopf algebra, the FS-exponent of H divides dim²(H), and this upper bound is shown to be tight.