Related papers: Fixed block configuration group divisible designs …
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…
We give a new construction of difference families generalizing Szekeres's difference families \cite{Sze}. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of…
For each $n\leq 6$, we characterize all the groups which can occur as either the orientation preserving topological symmetry group or the topological symmetry group of some embedding of $K_n$ in $S^3$.
Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…
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…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple…
Perfect difference families (PDFs for short) are important both in theoretical and in applications. Perfect difference matrices (PDMs for short) and the equivalent structure had been extensively studied and used to construct perfect…
We consider $p$-blocks with abelian defect groups and in the first part prove a relationship between its Loewy length and that for blocks of normal subgroups of index $p$. Using this, we show that if $B$ is a $2$-block of a finite group…
In this article, we study $2$-designs with $\gcd(r,\lambda)=1$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type. We obtain four infinite families of such designs and…
Given natural numbers $k \leq s \leq n$, we ask: what is the minimal VC-dimension of a family $\mathcal{F}$ of $s$-subsets of $[n]$ that covers all $k$-subsets of $[n]$? We first show that for sufficiently large $n$ this number is always…
We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…
The finiteness problem of stationary configurations for the planar five-vortex problem is considered in this paper. The numbers of equilibria and rigidly translating configurations are shown to be at most 6 and 24 respectively. The numbers…
Let $F_n$ be a free group of rank $n$, with free generating set $X$. A subset $D$ of $F_n$ is a \emph{Distinct Difference Configuration} if the differences $g^{-1}h$ are distinct, where $g$ and $h$ range over all (ordered) pairs of distinct…
We establish necessary and sufficient conditions for invertibility of symmetric three-by-three block matrices having a double saddle-point structure \fb{that guarantee the unique solvability of double saddle-point systems}. We consider…
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…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…