English
Related papers

Related papers: Small transitive homogeneous $3$-$(v,\{4,6\},1)$ d…

200 papers

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…

Combinatorics · Mathematics 2014-10-23 Tao Feng , Xiaomiao Wang , Ruizhong Wei

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

Combinatorics · Mathematics 2015-11-17 Greg Aloupis , Brad Ballinger , Sébastien Collette , Stefan Langerman , Attila Pór , David R. Wood

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

Combinatorics · Mathematics 2010-02-17 Harold N. Ward

A balanced incomplete block design is a set system in which all pairs of distinct elements occur with a constant frequency. By contrast, a Sarvate-Beam design induces an interval of distinct frequencies on pairs. In this paper, we settle…

Combinatorics · Mathematics 2022-01-05 Peter J. Dukes , Joanna Niezen

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

Combinatorics · Mathematics 2018-03-14 William J. Martin , Douglas R. Stinson

In this paper we construct structures from Mathieu group $M_{11}$. We classify transitive $t$-designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{11}$. Thereby we proved the existence of designs with…

Combinatorics · Mathematics 2017-06-20 Dean Crnkovic , Andrea Svob

The problem of classifying the convex pentagons that admit tilings of the plane is a long-standing unsolved problem. Previous to this article, there were 14 known distinct kinds of convex pentagons that admit tilings of the plane. Five of…

Metric Geometry · Mathematics 2015-10-06 Casey Mann , Jennifer McLoud-Mann , David Von Derau

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

Information Theory · Computer Science 2019-04-10 Chunming Tang

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, \lambda, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized Howell design, denoted $t$-$GHD_{k}(s,v;\lambda)$, is…

Combinatorics · Mathematics 2015-11-04 R. Julian R. Abel , Robert F. Bailey , Andrea C. Burgess , Peter Danziger , Eric Mendelsohn

Among the properties of homogeneity of incidence structures flag-transitivity obviously is a particularly important and natural one. Consequently, in the last decades also flag-transitive Steiner tdesigns (i.e. flag-transitive t-(v,k,1)…

Combinatorics · Mathematics 2018-07-03 Michael Huber

This paper is an attempt to compute the decomposition numbers of the blocks of the symmetric group which have "small defect"; that is, blocks of weight smaller than the characteristic. We present various methods for computing such…

Representation Theory · Mathematics 2007-05-23 Gordon James , Andrew Mathas

Let $\mathcal{D}=(\mathcal{P},\mathcal{B})$ be a non-trivial block-transitive $t$-$(k^2,k,\lambda)$ design with $G\leq \Aut(\mathcal{D})$ and $X\unlhd G\leq \Aut(X)$, where $X=PSL(n,q)(n\geq3).$ We prove that $t=2$ and the parameters…

Group Theory · Mathematics 2025-11-14 Guoqiang Xiong , Haiyan Guan

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Group Theory · Mathematics 2017-06-19 Teng Fang , Xin Gui Fang , Binzhou Xia , Sanming Zhou

In [Bal18] a new method of constructing simplex designs based on cyclic group on $n$ elements has been proposed. One of the claims put forward therein is existence of 3-point simplex 3-design in dimension $d = 3$. In this manuscript we…

Combinatorics · Mathematics 2025-05-12 Jakub Czartowski

This paper determined all pairs $(\mathcal{D},G)$ where $\mathcal{D}$ is a non-symmetric 2-$(v,k,\lambda)$ design with $(r,\lambda)=1$ and $G$ is the almost simple flag-transitive automorphism group of $\mathcal{D}$ with an exceptional…

Combinatorics · Mathematics 2019-07-16 Yongli Zhang , Shenglin Zhou

In this paper, we show that for a non-trivial quasi-symmetric $2$-design $\mathcal{D}$ with two block intersection numbers $x=0$ and $2\leq y\leq10$, if $G\leq \mathrm{Aut}(\mathcal{D})$ is flag-transitive and point-primitive, then $G$ is…

Combinatorics · Mathematics 2024-10-28 Jianbing Lu , Yu Zhuang

Let $\mathcal D$ be a nontrivial symmetric $(v,k,\lambda)$ design, and $G$ be a subgroup of the full automorphism group of $\mathcal D$. In this paper we prove that if $G$ acts flag-transitively, point-primitively on $\mathcal D$ and…

Combinatorics · Mathematics 2015-03-25 Shenglin Zhou , Delu Tian

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

We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…

Combinatorics · Mathematics 2022-01-04 Sung-Yell Song , Theodore Tranel

A \textbf{double-change covering design} (DCCD) is a $v$-set $V$ and an ordered list $\mathcal{L}$ of $b$ blocks of size $k$ where every pair from $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly…

Combinatorics · Mathematics 2025-11-04 Amanda Lynn Chafee , Brett Stevens
‹ Prev 1 4 5 6 7 8 10 Next ›