16,188 research outputs found
Frame difference families and resolvable balanced incomplete block designs
Frame difference families, which can be obtained via a careful use of
cyclotomic conditions attached to strong difference families, play an important
role in direct constructions for resolvable balanced incomplete block designs.
We establish asymptotic existences for several classes of frame difference
families. As corollaries new infinite families of 1-rotational
-RBIBDs over are
derived, and the existence of -RBIBDs is discussed. We construct
-RBIBDs for , whose
existence were previously in doubt. As applications, we establish asymptotic
existences for an infinite family of optimal constant composition codes and an
infinite family of strictly optimal frequency hopping sequences.Comment: arXiv admin note: text overlap with arXiv:1702.0750
New -designs from strong difference families
Strong difference families are an interesting class of discrete structures
which can be used to derive relative difference families. Relative difference
families are closely related to -designs, and have applications in
constructions for many significant codes, such as optical orthogonal codes and
optical orthogonal signature pattern codes. In this paper, with a careful use
of cyclotomic conditions attached to strong difference families, we improve the
lower bound on the asymptotic existence results of -DFs for .
We improve Buratti's existence results for - designs and
- designs, and establish the existence of seven new
- designs for
,
.Comment: Version 1 is named "Improved cyclotomic conditions leading to new
2-designs: the use of strong difference families". Major revision according
to the referees' comment
Query-Efficient Locally Decodable Codes of Subexponential Length
We develop the algebraic theory behind the constructions of Yekhanin (2008)
and Efremenko (2009), in an attempt to understand the ``algebraic niceness''
phenomenon in . We show that every integer ,
where , and are prime, possesses the same good algebraic property as
that allows savings in query complexity. We identify 50 numbers of this
form by computer search, which together with 511, are then applied to gain
improvements on query complexity via Itoh and Suzuki's composition method. More
precisely, we construct a -query LDC for every positive
integer and a -query
LDC for every integer , both of length , improving the
queries used by Efremenko (2009) and queries used by Itoh and
Suzuki (2010).
We also obtain new efficient private information retrieval (PIR) schemes from
the new query-efficient LDCs.Comment: to appear in Computational Complexit
High-order symbolic strong-coupling expansion for the Bose-Hubbard model
Combining the process-chain method with a symbolized evaluation we work out
in detail a high-order symbolic strong-coupling expansion (HSSCE) for
determining the quantum phase boundaries between the Mott insulator and the
superfluid phase of the Bose-Hubbard model for different fillings in hypercubic
lattices of different dimensions. With a subsequent Pad{\'e} approximation we
achieve for the quantum phase boundaries a high accuracy, which is comparable
to high-precision quantum Monte-Carlo simulations, and show that all the Mott
lobes can be rescaled to a single one. As a further cross-check, we find that
the HSSCE results coincide with a hopping expansion of the quantum phase
boundaries, which follow from the effective potential Landau theory (EPLT).Comment: 15 pages, 11 figures. For the latest version and more information see
https://www.physik.uni-kl.de/eggert/papers/index.htm
- …