Related papers: Classification of large partial plane spreads in $…
A $q$-ary code of length $n$, size $M$, and minimum distance $d$ is called an $(n,M,d)_q$ code. An $(n,q^{k},n-k+1)_q$ code is called a maximum distance separable (MDS) code. In this work, some MDS codes over small alphabets are classified.…
The depth of a vector bundle E over the projective plane P^2 is the largest integer h such that [E]/h is in the Grothendieck group of coherent sheaves on P^2 where [E] is the class of E in this Grothendieck group. We show that a moduli…
The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We classify the (finite and infinite) virtually cyclic subgroups of the pure braid groups $P_{n}(RP^2)$ of the projective plane. The maximal finite subgroups of $P_{n}(RP^2)$ are isomorphic to the quaternion group of order 8 if $n=3$, and…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
We completely characterize the first two entries, namely the $(f_0, f_1)$-vector pairs, for $6$-dimension polytopes. We also find the characterization for $7$-dimension polytopes with excess degree greater than $11$ and, we conjecture…
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…
Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…
Here we explore the geometry of the osculating spaces to projective varieties of arbitrary dimension. In particular, we classify varieties having very degenerate higher order osculating spaces and we determine mild conditions for the…
The $d^2$ Pauli operators attached to a composite qudit in dimension $d$ may be mapped to the vectors of the symplectic module $\mathcal{Z}_d^{2}$ ($\mathcal{Z}_d$ the modular ring). As a result, perpendicular vectors correspond to…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
The space of degree d single-variable monic and centered complex polynomial vector fields can be decomposed into loci in which the vector fields have the same topological structure. We analyze the geometric structure of these loci and…
In this paper, we study certain moduli spaces of vector bundles on the blowup of the projective plane in at least 10 very general points. Moduli spaces of sheaves on general type surfaces may be nonreduced, reducible and even disconnected.…
In the projective planes $\mathrm{PG}(2,q)$, we collect the smallest known sizes of complete arcs for the regions \begin{align*} &\mbox{all } q\le160001,~~ q \mbox{ prime power};\\ &Q_{4}=\{34 \mbox{ sporadic }q'\mbox{s in the interval…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…