中文
相关论文

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

200 篇论文

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…

组合数学 · 数学 2019-08-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang

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 cycle with four blocks $C(k_{1}, k_{2},k_{3},k_{4})$ is an oriented cycle formed of four blocks of lengths $k_{1}, k_{2}, k_{3}$ and $k_{4}$ respectively. Recently, Cohen et al. conjectured that for every positive integers $k_{1}, k_{2},…

组合数学 · 数学 2023-08-29 Darine Al-Mniny , Soukaina Zayat

Even though Peltesohn proved that a cyclic (v,3,1)-design exists if and only if $v\equiv 1,3\pmod{6}$ as early as 1939, the problem of determining the spectrum of cyclic (v,k,1)-designs with k>3 is far from being settled, even for k=4. This…

组合数学 · 数学 2022-07-05 Menglong Zhang , Tao Feng , Xiaomiao Wang

The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n/2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an edge-colouring of $G$ guarantee the existence of a properly…

组合数学 · 数学 2026-03-24 Natalie Behague , Francesco Di Braccio , Bertille Granet , Allan Lo

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

组合数学 · 数学 2022-04-19 Lin Niu , Xiangwen Li

We present the first example of a grand unified theory (GUT) with a modular symmetry interpreted as a family symmetry. The theory is based on supersymmetric $SU(5)$ in 6d, where the two extra dimensions are compactified on a…

高能物理 - 唯象学 · 物理学 2020-02-04 Francisco J. de Anda , Stephen F. King , Elena Perdomo

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

组合数学 · 数学 2025-07-08 Meysam Korivand , Nasrin Soltankhah , Sandi Klavžar

Let $\gg$ be a complex reductive Lie algebra and $\kk\subset\gg$ be any reductive in $\gg$ subalgebra. We call a $(\gg,\kk)$-module $M$ bounded if the $\kk$-multiplicities of $M$ are uniformly bounded. In this paper we initiate a general…

表示论 · 数学 2007-10-05 Ivan Penkov , Vera Serganova

Let $G$ be a planar graph with no two 3-cycles sharing an edge. We show that if $\Delta(G)\geq 9$, then $\chi'_l(G) = \Delta(G)$ and $\chi''_l(G)=\Delta(G)+1.$ We also show that if $\Delta(G)\geq 6$, then $\chi'_l(G)\leq\Delta(G)+1$ and if…

组合数学 · 数学 2011-10-12 Daniel W. Cranston

We prove the non existence of quantum caps of sizes 37 and 39. This completes the spectrum of quantum caps in PG(4, 4). This also implies the non existence of linear [[37,27,4]] and [[39,29,4]]-codes. The problem of the existence of non…

组合数学 · 数学 2009-12-23 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

代数拓扑 · 数学 2019-09-20 Martin Cadek , Michael Crabb , Tomas Salac

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\delta(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\delta(G)\geq |G|/2$, then $G$ has a…

组合数学 · 数学 2016-07-22 Amelia Taylor

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…

组合数学 · 数学 2017-07-21 Peter Danziger , Sophia Park

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…

群论 · 数学 2020-03-16 Igor Lima , Raimundo Bastos , José R. Rogério

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…

组合数学 · 数学 2019-10-28 Elena Mohr , Dieter Rautenbach

A graph $G$ is divisible by a graph $H$ if the characteristic polynomial of $G$ is divisible by that of $H$. In this paper, a necessary and sufficient condition for recursive graphs to be divisible by a path is used to show that the H-shape…

组合数学 · 数学 2023-05-04 Zhen Chen , Jianfeng Wang , Maurizio Brunetti , Francesco Belardo

We show that the first cohomology group of the Hurwitz space of fully-marked admissible covers $H^1(\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underline{\mu}))$ vanishes for covers of degree $ d = 3$ and deduce the same result…

代数几何 · 数学 2025-12-02 Amy Q. Li

We study in detail the structure of Grand Unified Theories derived as the low-energy limit of orbifold four-dimensional strings. To this aim, new techniques for building level-two symmetric orbifold theories are presented. New classes of…

高能物理 - 理论 · 物理学 2009-10-09 G. Aldazabal , A. Font , L. E. Ibanez , A. M. Uranga

We continue and complete our previous paper `Lifts of projective congruence groups' [2] concerning the question of whether there exist noncongruence subgroups of $\SL_2(\Z)$ that are projectively equivalent to one of the groups…

数论 · 数学 2012-12-24 Ian Kiming