Related papers: Blocking Sets of Index Three
A path P(k,l,r) is an oriented path consisting of k forward arcs, followed by l backward arcs, and then by r forward arcs. We prove the existence of any oriented path of length n-1 with three blocks having the middle block of length one in…
We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while the latter provides better reliability. We specify the…
Let X, Y, and Z be topological modules over a topological ring $R$. In the first part of the paper, we introduce three different classes of bounded bigroup homomorphisms from $X\times Y$ into $Z$ with respect to the three different uniform…
In a striking 2019 article, Antieau, Gepner and Heller found {\it K--}theoretic obstructions to bounded t-structures. We will survey their work, as well as some progress since. The focus will be on the open problems that arise from this.
We describe explicitely the structures of standard $(g,K)$-modules of $SL(3,R)$.
We show that there is a set which is not a set of multiple recurrence despite being a set of recurrence for nil-Bohr sets. This answers Huang, Shao, and Ye's \enquote{higher-order} version of Katznelson's Question on Bohr recurrence and…
From a recent perspective, the structure of a 3-connected graph is studied in this paper. It stipulates the minimum dominating set of a 3-connected graph. Also, we count the number of structures, as a consequence, the upper bound is…
In this paper, we define posets of types B, C, and D. These posets encode the matrix forms of certain Lie algebras which lie between the algebras of upper-triangular and diagonal matrices. Interestingly, such type-B, C, and D Lie poset…
In this paper, we characterise the smallest sets $B$ consisting of points and hyperplanes in $\text{PG}(n,q)$, such that each $k$-space is incident with at least one element of $B$. If $k > \frac {n-1} 2$, then the smallest construction…
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes. The detailed description of…
We study the behavior of blocks in flat families of finite-dimensional algebras. In a general setting we construct a finite directed graph encoding a stratification of the base scheme according to the block structures of the fibers. This…
Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every element of F. In [C. Keller and M. A. Perles, On the smallest…
In this paper we present a complete characterization of the smallest sets which block all the simple perfect matchings in a complete convex geometric graph on $2m$ vertices. In particular, we show that all these sets are caterpillar graphs…
Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…
The group $PGL(2,q)$ acts $3$-transitively on the projective line $GF(q) \cup \{\infty\}$. Thus, an orbit of its action on the $k$-subsets of the projective line is the block set of a $3$-$(q+1,k,\lambda)$ design. We find the parameters of…
LDPC codes are used in many applications, however, their error correcting capabilities are limited by the presence of stopping sets and trapping sets. Trapping sets and stopping sets occur when specific low-wiehgt error patterns cause a…
Let $\mathcal{L}$ be a pencil of plane curves defined over $\mathbb{F}_q$ with no $\mathbb{F}_q$-points in its base locus. We investigate the number of curves in $\mathcal{L}$ whose $\mathbb{F}_q$-points form a blocking set. When the degree…
We define a trisection of a closed, orientable three dimensional manifold into three handlebodies, and a notion of stabilization for these trisections. Several examples of trisections are described in detail. We define the trisection genus…
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
We study two long-standing conjectures concerning lower bounds for the Betti numbers of a graded module over a polynomial ring. We prove new cases of these conjectures in codimensions five and six by reframing the conjectures as arithmetic…