Search arXivSearch

arXiv · 2107.04790

On balanced $(Z_{4u}\times Z_{8v},\{4,5\},1)$ difference packings

Abstract

Let $K$ be a set of positive integers and let $G$ be an additive group. A $(G, K, 1)$ difference packing is a set of subsets of $G$ with sizes from $K$ whose list of differences covers every element of $G$ at most once. It is balanced if the number of blocks of size $k\in K$ does not depend on $k$. In this paper, we determine a balanced $(Z_{4u}\times Z_{8v},{4,5},1)$ difference packing of the largest possible size whenever $uv$ is odd. The corresponding optimal balanced $(4u, 8v,\{4,5\},1)$ optical orthogonal signature pattern codes are also obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hengming Zhao, Rongcun Qin, Dianhua Wu. 2021-07-10. On balanced $(Z_{4u}\times Z_{8v},\{4,5\},1)$ difference packings. https://arxiv.org/abs/2107.04790

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