English
Related papers

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

200 papers

An algebraic classification is given for spaces of holomorphic vector-valued modular forms of arbitrary real weight and multiplier system, associated to irreducible, T-unitarizable representations of the full modular group, of dimension…

Number Theory · Mathematics 2012-01-27 Christopher Marks

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

Logic · Mathematics 2014-02-27 Eliana Barriga , Alf Onshuus , Charles Steinhorn

A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of size $k$ where every $t$-set must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. A single…

Combinatorics · Mathematics 2024-11-12 Amanda Chafee , Brett Stevens

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

Commutative Algebra · Mathematics 2017-10-11 J. I. García-García , D. Marín-Aragón , M. A. Moreno-Frías , J. C. Rosales , A. Vigneron-Tenorio

Groups of order $4$ are isomorphic to either $\mathbb{Z}/4\mathbb{Z}$ or $\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}$. We give certain sufficient conditions permitting to specify the structure of class groups of order $4$ in the…

Number Theory · Mathematics 2020-04-21 Kalyan Chakraborty , Azizul Hoque , Mohit Mishra

We define a new type of Golomb ruler, which we term a resolvable Golomb ruler. These are Golomb rulers that satisfy an additional "resolvability" condition that allows them to generate resolvable symmetric configurations. The resulting…

Combinatorics · Mathematics 2020-04-15 Marco Buratti , Douglas R. Stinson

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

Combinatorics · Mathematics 2021-09-22 Jonathan Jedwab , Shuxing Li

An Erd\H{o}s-Ko-Rado set in a block design is a set of pairwise intersecting blocks. In this article we study Erd\H{o}s-Ko-Rado sets in 2-(v,k,1) designs, Steiner systems. The Steiner triple systems and other special classes are treated…

Combinatorics · Mathematics 2016-01-05 Maarten De Boeck

We classify four-dimensional $\mathcal{N}=1$ supersymmetric gauge theories with a simple gauge group admitting a large $N$ limit that flow to non-trivial superconformal fixed points in the infrared. We focus on the cases where the large $N$…

High Energy Physics - Theory · Physics 2025-10-23 Minseok Cho , Ki-Hong Lee , Jaewon Song

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

Number Theory · Mathematics 2026-04-29 Yifan Jing , Akshat Mudgal

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

Logic · Mathematics 2015-09-24 Pierre Simon

We give a summary of results for dimensions of spaces of cuspidal Siegel modular forms of degree 2. These results together with a list of dimensions of the irreducible representations of the finite groups GSp(4,Fp) are then used to produce…

Representation Theory · Mathematics 2012-09-18 Jeffery Breeding

Let $G$ be a simple algebraic group over an algebraically closed field $K$ with Lie algebra $\mathfrak{g}$. For unipotent elements $u \in G$ and nilpotent elements $e \in \mathfrak{g}$, the Jordan block sizes of $\operatorname{Ad}(u)$ and…

Group Theory · Mathematics 2024-01-30 Mikko Korhonen

A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…

Combinatorics · Mathematics 2025-02-19 Vladislav V. Kabanov

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…

Combinatorics · Mathematics 2021-07-13 Hengming Zhao , Rongcun Qin , Dianhua Wu

Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order $v$ is partitioned into two pairs. Each pair in such a partition is called a nested design pair…

Combinatorics · Mathematics 2024-10-21 Yeow Meng Chee , Son Hoang Dau , Tuvi Etzion , Han Mao Kiah , Wenqin Zhang

In this article, we identify the existence of a divisibility relationship between the number of ring homomorphisms and surjective group homomorphisms. We demonstrate that for finite cyclic structures, the number of ring homomorphisms from…

Commutative Algebra · Mathematics 2025-09-24 Sonu Kumar , Priyabrata Mandal

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…

Group Theory · Mathematics 2021-04-16 Víctor Sotomayor

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

Group Theory · Mathematics 2017-02-10 Bettina Eick

We characterize the SDP designs that give rise to four-weight spin models with two values. We prove that the only such designs are the symplectic SDP designs. The proof involves analysis of cardinalities of intersections of four blocks.

Combinatorics · Mathematics 2007-05-23 Carl Bracken , Gary McGuire
‹ Prev 1 8 9 10 Next ›