English
Related papers

Related papers: Semi-cyclic holey group divisible designs with blo…

200 papers

In this paper we discuss the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When n=3, a 3-SCHGDD of type (3,m^t) is equivalent to a…

Combinatorics · Mathematics 2014-04-24 Tao Feng , Xiaomiao Wang , Yanxun Chang

In this paper we investigate combinatorial constructions for $w$-cyclic holely group divisible packings with block size three (briefly by $3$-HGDPs). For any positive integers $u,v,w$ with $u\equiv0,1~(\bmod~3)$, the exact number of base…

Combinatorics · Mathematics 2020-06-15 Zenghui Fang , Junling Zhou , Lidong Wang

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

Combinatorics · Mathematics 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…

Combinatorics · Mathematics 2026-02-24 Xiuling Shan , Lidong Wang , Yanxun Chang , Xiaomiao Wang

We deal with group divisible designs that have block size 4 and group type g^u m^1, where g = 2 or 4 (mod 6). We show that the necessary conditions for the existence of a 4-GDD of type g^u m^1 are sufficient when g = 14, 20, 22, 26, 28, 32,…

Combinatorics · Mathematics 2019-03-19 Anthony D. Forbes

A holey Schr\"oder design of type $h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k$ (HSD$(h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k))$ is equivalent to a frame idempotent Schr\"oder quasigroup (FISQ$(h_1^{n_1}h_4^{n_2}\cdots h^{n_k}_k))$ of order $n$ with…

Combinatorics · Mathematics 2022-04-26 Dianhua Wu , Hantao Zhang

Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…

Combinatorics · Mathematics 2019-08-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang

An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…

Combinatorics · Mathematics 2017-07-21 Peter Danziger , Sophia Park

Given a subgroup $H$ of a group $(G,+)$, a $(G,H,k,1)$ difference family (DF) is a set $\mathcal F$ of $k$-subsets of $G$ such that $\{f-f':f,f'\in F, f\neq f',F\in \mathcal F\}=G\setminus H$. Let $g\mathbb Z_{gh}$ is the subgroup of order…

Combinatorics · Mathematics 2023-06-22 Chenya Zhao , Binwei Zhao , Yanxun Chang , Tao Feng , Xiaomiao Wang , Menglong Zhang

A group divisible design $\mbox{GDD}(m,n;\lambda_1,\lambda_2)$, is an ordered pair $(V, \cal{B})$ where $V$ is an $(m+n)$-set of symbols while $\cal{B}$ is a collection of $3$-subsets (called blocks) of $V$ satisfying the following…

Combinatorics · Mathematics 2018-02-27 Chariya Uiyyasathian , Nataphan Kitisin

Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known…

Combinatorics · Mathematics 2018-09-05 Yu-pei Huang , Chia-an Liu , Yaotsu Chang , Chong-Dao Lee

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber

We discuss group divisible designs with block size four and type $g^u b^1 (gu/2)^1$, where $u = 5$, 6 and 7. For integers $a$ and $b$, we prove the following. (i) A 4-GDD of type $(4a)^5 b^1 (10a)^1$ exists if and only if $a \ge 1$, $b…

Combinatorics · Mathematics 2019-06-06 Anthony D. Forbes

Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…

Information Theory · Computer Science 2022-07-18 Xiaoqiang Wang , Chunming Tang , Cunsheng Ding

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…

Information Theory · Computer Science 2008-07-18 Yeow Meng Chee , Gennian Ge , Alan C. H. Ling

In this paper we provide a $4$-GDD of type $2^2 5^5$, thereby solving the existence question for the last remaining feasible type for a $4$-GDD with no more than $30$ points. We then show that $4$-GDDs of type $2^t 5^s$ exist for all but a…

Combinatorics · Mathematics 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…

Combinatorics · Mathematics 2025-07-10 Minjia Shi , Xiaoxiao Li , Denis S. Krotov

We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…

Rings and Algebras · Mathematics 2025-08-25 Altaf Alshuhail

We show that the necessary conditions for the existence of 4-GDDs of type g^u m^1 are sufficient for g congruent to 0 (mod h), h = 39, 51, 57, 69, 87, 93, and for g = 13, 17, 19, 23, 25, 29, 31 and 35. More generally, we show that for all g…

Combinatorics · Mathematics 2018-06-21 Anthony D. Forbes

Let $q>2$ be a prime number, $d$ be an odd square-free natural number, and $n$ be a non-negative integer. We prove that a semisimple quasitriangular Hopf algebra of dimension $dq^n$ is solvable in the sense of Etingof, Nikshych and Ostrik.…

Rings and Algebras · Mathematics 2017-03-31 Jingcheng Dong , Li Dai
‹ Prev 1 2 3 10 Next ›