Search arXivSearch

arXiv · 1507.08503

A New Approach to Examine q-Steiner Systems

Abstract

One of the most intriguing problems, in $q$-analogs of designs and codes, is the existence question of an infinite family of $q$-analog of Steiner systems (spreads not included) in general, and the existence question for the $q$-analog of the Fano plane in particular. We exhibit a completely new method to attack this problem. In the process we define a new family of designs whose existence is implied by the existence of $q$-Steiner systems, but could exist even if the related $q$-Steiner systems do not exist. The method is based on a possible system obtained by puncturing all the subspaces of the $q$-Steiner system several times. We define the punctured system as a new type of design and enumerate the number of subspaces of various types that it might have. It will be evident that its existence does not imply the existence of the related $q$-Steiner system. On the other hand, this type of design demonstrates how close can we get to the related $q$-Steiner system. Necessary conditions for the existence of such designs are presented. These necessary conditions will be also necessary conditions for the existence of the related $q$-Steiner system. Trivial and nontrivial direct constructions and a nontrivial recursive construction for such designs, are given. Some of the designs have a symmetric structure, which is uniform in the dimensions of the existing subspaces in the system. Most constructions are based on this uniform structure of the design or its punctured designs. Finally, the structure of the $q$-Fano plane for any given $q$, was considered based on this new approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tuvi Etzion. 2017-02-04. A New Approach to Examine q-Steiner Systems. https://arxiv.org/abs/1507.08503

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO