中文
相关论文

相关论文: Group divisible designs with block size 4 and grou…

200 篇论文

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,…

组合数学 · 数学 2024-01-23 R. Julian R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from…

组合数学 · 数学 2011-05-10 Melissa Keranen , Melanie Laffin

We report some group divisible designs with block size five, including types $6^{15}$ and $10^{15}$. As a consequence we are able to extend the known spectrum for 5-GDDs of type $g^u$.

组合数学 · 数学 2022-07-06 Anthony D. Forbes

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…

组合数学 · 数学 2019-06-06 Anthony D. Forbes

In this note, we give direct constructions of some group divisible designs (GDDs) with block size $4$ that have up to $50$ points.

组合数学 · 数学 2024-01-23 R. Julian. R. Abel , Thomas Britz , Yudhistira A. Bunjamin , Diana Combe

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,…

组合数学 · 数学 2019-03-19 Anthony D. Forbes

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…

组合数学 · 数学 2018-06-21 Anthony D. Forbes

We give direct constructions for 233 group divisible designs with block size five, mostly of type $g^u m^1$, $m > 0$.

组合数学 · 数学 2023-09-22 Anthony D. Forbes

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…

组合数学 · 数学 2018-09-05 Yu-pei Huang , Chia-an Liu , Yaotsu Chang , Chong-Dao Lee

Let $p$ be a prime such that $p \geq 5$. Let $G$ be a finite $p$-solvable group and let $p^a$ be the largest power of $p$ dividing $\chi(1)$ for an irreducible character $\chi$ of $G$, we show that $|G:F(G)|_p \leq p^{5.5a}$. Let $G$ be a…

群论 · 数学 2015-01-15 Yong Yang

This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…

群论 · 数学 2025-05-26 Chuhan Lei , Xiaoqin Zhan

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…

组合数学 · 数学 2018-02-27 Chariya Uiyyasathian , Nataphan Kitisin

We consider 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 t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence…

组合数学 · 数学 2014-10-23 Tao Feng , Xiaomiao Wang , Ruizhong Wei

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

群论 · 数学 2021-03-22 Lifang Wang , Lijian An

Let $G$ be a finite solvable group, let $p$ be a prime such that $p \geq 5$ and $O_p(G)=1$, and we denote $|G|_p=p^n$, then $G$ contains a block of defect less than or equal to $\lfloor \frac {3n} 5 \rfloor$. Let $G$ be a finite solvable…

群论 · 数学 2012-08-21 Yong Yang

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

群论 · 数学 2025-04-04 Christopher A. Schroeder , Hung P. Tong-Viet

This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…

组合数学 · 数学 2017-01-02 Chong-Dao Lee , Yaotsu Chang , Chia-an Liu

Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…

组合数学 · 数学 2011-10-18 Peter Dukes , Jesse Short-Gershman

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

群论 · 数学 2019-02-13 Hung P. Tong-Viet

A weak $c$-colouring of a design is an assignment of colours to its points from a set of $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block-equitable, if for each block, the number of points…

‹ 上一页 1 2 3 10 下一页 ›