Related papers: Thresholds for $(n,q,2)$-Steiner Systems via Refin…

The symmetric difference of the $q$-binomial coefficients $F_{n,k}(q)={n+k\brack k}-q^{n}{n+k-2\brack k-2}$ was introduced by Reiner and Stanton. They proved that $F_{n,k}(q)$ is symmetric and unimodal for $k \geq 2$ and $n$ even by using…

The generalized $q$-Kneser graph $K_q(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-dimensional subspaces of an $n$-dimensional $F_q$-vectorspace with two vertices $U_1$ and $U_2$ adjacent if and only if…

Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…

Let $N=L_n(q)$, {$n \geq 2$}, $q$ a prime power, be a projective linear simple group. We classify all Steiner quadruple systems admitting a group $G$ with $N \leq G \leq \Aut(N)$. In particular, we show that $G$ cannot act as a group of…

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

In the closed, non-Haken, hyperbolic class of examples generated by (2p,q) Dehn fillings of Figure 8 knot space, the geometrically incompressible one-sided surfaces are identified by the filling ratio p/q and determined to be unique in all…

Let $p, k, q$ be positive integers with $p-2 \geqslant k$ and let $K_{p,k}^{q}$ be the generalized pineapple graph which is obtained by joining independent set of $q$ vertices with $k$ vertices of a complete graph $K_{p}.$ In \cite{TSH2},…

Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erd\H{o}s-R\'enyi random graph G(n,d/n). While…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it…

Let $n,p,k$ be three positive integers. We prove that the rational fractions of $q$: $${n \brack k}_{q} {}_3\phi_{2} [ . {matrix}q^{1-k},q^{-p},q^{p-n} q,q^{1-n} {matrix}| q;q^{k+1}]\quad\textrm{and}\quad q^{(n-p)p}\qbi{n}{k}{q} {}_3\phi_2[…

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

We pick up a solvable ${\cal PT}-$symmetric quantum square well on an interval of $x \in := (-L,L)\mathbb{G}^{(2)}$ (with an $\alpha-$dependent non-Hermiticity given by Robin boundary conditions) and generalize it. In essence, we just…

We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prove a sharp threshold result for the appearance of G_{n,p_1}…

We study the problem of guaranteeing the connectivity of a given graph by protecting or strengthening edges. Herein, a protected edge is assumed to be robust and will not fail, which features a non-uniform failure model. We introduce the…

We study $S(t-1,t,2t)$, which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs.…

We prove two generalisations of the Binomial theorem that are also generalisations of the q-binomial theorem. These generalisations arise from the commutation relations satisfied by the components of the co-multiplications of non-simple…

A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…

Let $\Phi_{n}(q)$ denote the $n$-th cyclotomic polynomial in $q$. Recently, Guo and Schlosser [Constr. Approx. 53 (2021), 155--200] put forward the following conjecture: for an odd integer $n>1$, \begin{align*}…