English
Related papers

Related papers: Group divisible designs with block size 4 and grou…

200 papers

It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…

Information Theory · Computer Science 2017-06-02 Cunsheng Ding

We show that Nichols algebras of most simple Yetter-Drinfeld modules over the projective special linear group over a finite field, corresponding to semisimple orbits, have infinite dimension. We introduce a new criterium to determine when a…

Quantum Algebra · Mathematics 2018-03-14 Nicolás Andruskiewitsch , Giovanna Carnovale , Gastón Andrés García

In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$, there exists a super-simple $(v,5,2)$ directed design, also for these parameters there exists a super-simple $(v,5,2)$ directed design such that its smallest defining…

Combinatorics · Mathematics 2022-07-13 M. Mohammadnezhad , S. Golalizadeh , M. Boostan , N. Soltankhah

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

Group Theory · Mathematics 2020-07-01 Andrea Lucchini , Claude Marion , Gareth Tracey

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

Group Theory · Mathematics 2020-07-22 M. Zarrin

This paper investigates the existence and properties of spherical $5$-designs of minimal type. We focus on two cases: tight spherical $5$-designs and antipodal spherical $4$-distance $5$-designs. We prove that a tight spherical $5$-design…

Combinatorics · Mathematics 2025-08-27 Sho Suda , Zili Xu , Wei-Hsuan Yu

I give an elementary proof that a quasi-symmetric design without repeated blocks on $v$ points has at most $v\choose2$ blocks, with equality if and only if it is a tight $4$-design.

Combinatorics · Mathematics 2021-01-07 Peter J. Cameron

Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers…

Group Theory · Mathematics 2013-09-24 Roghayeh Hafezieh , Pablo Spiga

In this paper, we investigate finite solvable tidy groups. We classify the tidy $\{ p, q \}$-groups. Combining this with a previous result, we are able to characterize the finite tidy solvable groups. Using this characterization, we bound…

Let $G=SL(2,5)$ be the special linear group of $2 \times 2$-matrices with coefficients in the field with $5$ elements. We show that the principal block over a splitting field $K$ of characteristic two of the group algebra $KG$ has a…

Representation Theory · Mathematics 2021-01-26 Bernhard Böhmler , Rene Marczinzik

This note is devoted to the construction of two very easy examples, of respective dimensions 4 and 6, of graded Lie algebras whose grading is not given by a semigroup, the latter one being a semisimple algebra. It is shown that 4 is the…

Rings and Algebras · Mathematics 2008-09-29 Alberto Elduque

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

Group Theory · Mathematics 2018-03-06 Hung P. Tong-Viet

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

Group Theory · Mathematics 2014-09-02 E. I. Khukhro , P. Shumyatsky

Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptographic applications. Despite progress in fixed dimensions…

Information Theory · Computer Science 2025-04-10 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang , Wei Lu

In this paper we prove that free solvable groups have finite Krull dimension. In fact, this is true for much wider class of solvable groups, termed rigid groups. Along the way we study the algebraic structure of the limit solvable groups…

Group Theory · Mathematics 2008-08-22 A. Myasnikov , N. Romanovskiy

Let $G$ be a simple, simply connected linear algebraic group of exceptional type defined over $\mathbb{F}_q$ with Frobenius endomorphism $F: G \to G$. In this work we give upper bounds on the number of simple modules in the quasi-isolated…

Representation Theory · Mathematics 2019-07-25 Ruwen Hollenbach

This paper deals with block-transitive $t$-$(v,k,\lambda)$ designs in affine spaces for large $t$, with a focus on the important index $\lambda=1$ case. We prove that there are no non-trivial 5-$(v,k,1)$ designs admitting a block-transitive…

Combinatorics · Mathematics 2018-07-03 Michael Huber

We show that the Nichols algebra of a simple Yetter-Drinfeld module over a projective special linear group over a finite field whose support is a semisimple orbit has infinite dimension, provided that the elements of the orbit are…

Quantum Algebra · Mathematics 2024-11-01 N. Andruskiewitsch , G. Carnovale , G. García

Let $\Psi(t,k)$ denote the set of pairs $(v,\lambda)$ for which there exists a graphical $t$-$(v,k,\lambda)$ design. Most results on graphical designs have gone to show the finiteness of $\Psi(t,k)$ when $t$ and $k$ satisfy certain…

Combinatorics · Mathematics 2007-12-27 Yeow Meng Chee , Petteri Kaski

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

Combinatorics · Mathematics 2023-05-09 M. Epstein , D. L. Kreher , S. S. Magliveras
‹ Prev 1 3 4 5 6 7 10 Next ›