A construction of spherical 3-designs
We give a construction for spherical 3-designs. This construction is a generalization of Bondarenko's work.
math.CO↗
arXiv subjects
Tsuyoshi Miezaki
Publications and source records attributed to Tsuyoshi Miezaki.
On the cycle index and the weight enumerator
In this paper, we introduce the concept of the complete cycle index and discuss a relation with the complete weight enumerator in coding theory. This work was motivated by Cameron's lecture note "Polynomial aspects of codes, matroids and permutation groups."
math.CO↗
The support designs of the triply even codes of length 48
In this paper, we present examples of codes all of whose weight classes support 1-designs, with duals whose classes include two that support 2-designs. We can find these examples in the triply even binary codes of length 48, which have been classified by Betsumiya and Munemasa.
math.CO↗
On Eisenstein polynomials and zeta polynomials
Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we provide new analogous properties of Eisenstein polynomials and zeta polynomials. These properties are finite analogies of certain properties of Eisenstein series.
math.CO↗
On Eisenstein polynomials and zeta polynomials II
Eisenstein polynomials, which were defined by the second author, are analogues of the concept of an Eisenstein series. The second author conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In the previous paper, the first author provided new analogous properties of Eisenstein polynomials and zeta polynomials for the Type II case. In this paper, the analogous properties of Eisenstein polynomials and zeta polynomials are shown to also hold for the Type I, Type III, and Type IV cases. These properties are finite analogies of certain properties of Eisenstein series.
math.CO↗
New invariants for integral lattices
Let $Λ$ be any integral lattice in Euclidean space. It has been shown that for every integer $n>0$, there is a hypersphere that passes through exactly $n$ points of $Λ$. Using this result, we introduce new lattice invariants and give some computational results related to two-dimensional Euclidean lattices of class number one.
math.CO↗
A generalization of the Tutte polynomials
In this paper, we introduce the concept of the Tutte polynomials of genus $g$ and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tutte polynomials. The Tutte polynomials are matroid invariants, and we claim that the Tutte polynomials of genus $g$ are also matroid invariants. The main result of this paper and the forthcoming paper declares that the Tutte polynomials of genus $g$ are complete matroid invariants.
math.CO↗
An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
Let C be an extremal binary doubly even self-dual code of length n and s(C) denote the largest integer t such that the support design of C holds a t-design for some weight. In this paper, we prove s(C) \leq 7.
math.CO↗
The McKay-Thompson series of Mathieu Moonshine modulo two
In this note, we describe the parity of the coefficients of the McKay-Thompson series of Mathieu moonshine. As an application, we prove a conjecture of Cheng, Duncan and Harvey stated in connection with Umbral moonshine for the case of Mathieu moonshine.
math.NT↗
On the support designs of extremal binary doubly even self-dual codes
Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.
math.CO↗
On the Existence of Frames of Some Extremal Odd Unimodular Lattices and Self-Dual Zk-Codes
For some extremal (optimal) odd unimodular lattices L in dimensions n=12,16,20,32,36,40 and 44, we determine all positive integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths 12,16,20,32,36,40 and 44 and a near-extremal Type I Zk-code of length 28 for positive integers k with only a few exceptions.
math.CO↗
Conformal designs and D.H. Lehmer's conjecture
In 1947, Lehmer conjectured that the Ramanujan τ-function τ(m) is non-vanishing for all positive integers m, where τ(m) are the Fourier coefficients of the cusp form Δof weight 12. It is known that Lehmer's conjecture can be reformulated in terms of spherical t-design, by the result of Venkov. In this paper, we show that τ(m) = 0 is equivalent to the fact that the homogeneous space of the moonshine vertex operator algebra (V^\natural)_{m+1} is a conformal 12-design. Therefore, Lehmer's conjecture is now reformulated in terms of conformal t-designs.
math.QA↗
On the Existence of Extremal Type II Z2k-Codes
For lengths 8,16 and 24, it is known that there is an extremal Type II Z2k-code for every positive integer k. In this paper, we show that there is an extremal Type II Z2k-code of lengths 32,40,48,56 and 64 for every positive integer k. For length 72, it is also shown that there is an extremal Type II Z4k-code for every positive integer k with k \ge 2.
math.CO↗
Frames in the odd Leech lattice
In this paper, we show that there is a frame of norm k in the odd Leech lattice for every k\ge 3.
math.NT↗
On the nonexistence of ternary extremal self-dual codes
In this note, we give a new nonexistence result of ternary extremal self-dual codes.
math.CO↗
Nonexistence for extremal Type II $\ZZ_{2k}$-Codes
In this paper, we show that an extremal Type II $\ZZ_{2k}$-code of length $n$ dose not exist for all sufficiently large $n$ when $k=2,3,4,5,6$.
math.CO↗
An Optimal Odd Unimodular Lattice in Dimension 72
It is shown that if there is an extremal even unimodular lattice in dimension 72, then there is an optimal odd unimodular lattice in that dimension. Hence, the first example of an optimal odd unimodular lattice in dimension 72 is constructed from the extremal even unimodular lattice which has been recently found by G. Nebe.
math.CO↗
On Euclidean designs and the potential energy
We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the concept of strong Euclidean designs from the viewpoint of the linear programming bound, and we give a Fisher type inequality for strong Euclidean designs. A finite set on Euclidean space is called a Euclidean a-code if any distinct two points in the set are separated at least by a. As a corollary of the linear programming bound, we give a method to determine an upper bound on the cardinalities of Euclidean a-codes on concentric spheres of given radii. Similarly we also give a method to determine a lower bound on the cardinalities of Euclidean t-designs as an analogue of the linear programming bound.
math.CO↗