1,276 research outputs found
Equiangular lines in Euclidean spaces
We obtain several new results contributing to the theory of real equiangular
line systems. Among other things, we present a new general lower bound on the
maximum number of equiangular lines in d dimensional Euclidean space; we
describe the two-graphs on 12 vertices; and we investigate Seidel matrices with
exactly three distinct eigenvalues. As a result, we improve on two
long-standing upper bounds regarding the maximum number of equiangular lines in
dimensions d=14, and d=16. Additionally, we prove the nonexistence of certain
regular graphs with four eigenvalues, and correct some tables from the
literature.Comment: 24 pages, to appear in JCTA. Corrected an entry in Table
Blind Multilinear Identification
We discuss a technique that allows blind recovery of signals or blind
identification of mixtures in instances where such recovery or identification
were previously thought to be impossible: (i) closely located or highly
correlated sources in antenna array processing, (ii) highly correlated
spreading codes in CDMA radio communication, (iii) nearly dependent spectra in
fluorescent spectroscopy. This has important implications --- in the case of
antenna array processing, it allows for joint localization and extraction of
multiple sources from the measurement of a noisy mixture recorded on multiple
sensors in an entirely deterministic manner. In the case of CDMA, it allows the
possibility of having a number of users larger than the spreading gain. In the
case of fluorescent spectroscopy, it allows for detection of nearly identical
chemical constituents. The proposed technique involves the solution of a
bounded coherence low-rank multilinear approximation problem. We show that
bounded coherence allows us to establish existence and uniqueness of the
recovered solution. We will provide some statistical motivation for the
approximation problem and discuss greedy approximation bounds. To provide the
theoretical underpinnings for this technique, we develop a corresponding theory
of sparse separable decompositions of functions, including notions of rank and
nuclear norm that specialize to the usual ones for matrices and operators but
apply to also hypermatrices and tensors.Comment: 20 pages, to appear in IEEE Transactions on Information Theor
Abstract hyperovals, partial geometries, and transitive hyperovals
Includes bibliographical references.2015 Summer.A hyperoval is a (q+2)- arc of a projective plane π, of order q with q even. Let G denote the collineation group of π containing a hyperoval Ω. We say that Ω is transitive if for any pair of points x, y is an element of Ω, there exists a g is an element of G fixing Ω setwise such that xg = y. In1987, Billotti and Korchmaros proved that if 4||G|, then either Ω is the regular hyperoval in PG(2,q) for q=2 or 4 or q = 16 and |G||144. In 2005, Sonnino proved that if |G| = 144, then π is desarguesian and Ω is isomorphic to the Lunelli-Sce hyperoval. For our main result, we show that if G is the collineation group of a projective plane containing a transitivehyperoval with 4 ||G|, then |G| = 144 and Ω is isomorphic to the Lunelli-Sce hyperoval. We also show that if A(X) is an abstract hyperoval of order n ≡ 2(mod 4); then |Aut(A(X))| is odd. If A(X) is an abstract hyperoval of order n such that Aut(A(X)) contains two distinct involutions with |FixX(g)| and |FixX(ƒ)| ≥ 4. Then we show that FixX(g) ≠FixX(ƒ). We also show that there is no hyperoval of order 12 admitting a group whose order is divisible by 11 or 13, by showing that there is no partial geometry pg(6, 10, 5) admitting a group of order 11 or of order 13. Finally, we were able to show that there is no hyperoval in a projective plane of order 12 with a dihedral subgroup of order 14, by showing that that there is no partial geometry pg(7, 12, 6) admitting a dihedral group of order 14. The latter results are achieved by studying abstract hyperovals and their symmetries
Problems on q-Analogs in Coding Theory
The interest in -analogs of codes and designs has been increased in the
last few years as a consequence of their new application in error-correction
for random network coding. There are many interesting theoretical, algebraic,
and combinatorial coding problems concerning these q-analogs which remained
unsolved. The first goal of this paper is to make a short summary of the large
amount of research which was done in the area mainly in the last few years and
to provide most of the relevant references. The second goal of this paper is to
present one hundred open questions and problems for future research, whose
solution will advance the knowledge in this area. The third goal of this paper
is to present and start some directions in solving some of these problems.Comment: arXiv admin note: text overlap with arXiv:0805.3528 by other author
Coding Theory and Algebraic Combinatorics
This chapter introduces and elaborates on the fruitful interplay of coding
theory and algebraic combinatorics, with most of the focus on the interaction
of codes with combinatorial designs, finite geometries, simple groups, sphere
packings, kissing numbers, lattices, and association schemes. In particular,
special interest is devoted to the relationship between codes and combinatorial
designs. We describe and recapitulate important results in the development of
the state of the art. In addition, we give illustrative examples and
constructions, and highlight recent advances. Finally, we provide a collection
of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in
Information and Coding Theory", ed. by I. Woungang et al., World Scientific,
Singapore, 201
- …