Related papers: Classification of large partial plane spreads in $…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
Six-dimensional (2, 0) theory can be defined on a large class of six-manifolds endowed with some additional topological and geometric data (i.e. an orientation, a spin structure, a conformal structure, and an R-symmetry bundle with…
In order to understand the parameter space of monic and centered complex polynomial vector fields of degree d in the complex plane, decomposed by the combinatorial classes of the vector fields, it is interesting to know the number of loci…
Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as defined in 2018 by the first author and Zhou, for which…
The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…
In this paper we present the complete classification of caps in PG(4,2). These results have been obtained using a computer based exhaustive search that exploits projective equivalence.
Brehm and K\"uhnel (1992) constructed three 15-vertex combinatorial 8-manifolds `like the quaternionic projective plane' with symmetry groups $\mathrm{A}_5$, $\mathrm{A}_4$, and $\mathrm{S}_3$, respectively. Gorodkov (2016) proved that…
Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…
A Gray code for a combinatorial class is a method for listing the objects in the class so that successive objects differ in some prespecified, small way, typically expressed as a bounded Hamming distance. In a previous work, the authors of…
The integer $\beta (\rho, v, k)$ is defined to be the maximum number of blocks in any $(v, k)$-packing in which the maximum partial parallel class (or PPC) has size $\rho$. This problem was introduced and studied by Stinson for the case…
Consider an opaque medium which contains 3D particles. All particles are convex bodies of the same shape, but they vary in size. The particles are randomly positioned and oriented within the medium and cannot be observed directly. Taking a…
In this paper, the approach for considering fast charged particles scattering on targets of complex structure, which contains some isolated substructures, was expanded to account quadratic potential terms. Based on this approach, the…
We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…
We prove that the moduli space of double covers ramified at two points $\mathcal{R}_{g,2}$ is uniruled for $3\leq g\leq 6$ and of general type for $g\geq 16$. Furthermore, we consider Prym-canonical divisorial strata in the moduli space…
We present conjectured candidates for the least perimeter partition of a disc into $N \le 10$ regions which take one of two possible areas. We assume that the optimal partition is connected, and therefore enumerate all three-connected…
Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853<= q<= 2879 and q=3511,4096, 4523,5003,5347,5641,5843,6011. For q<= 2377 and q=2401,2417,2437, the relation…
Let $C_{n-1}(n,q)$ be the code arising from the incidence of points and hyperplanes in the Desarguesian projective space PG($n,q$). Recently, Polverino and Zullo proved that within this code, all non-zero code words of weight at most…