Related papers: On MPS construction of blocking sets in projective…

We consider the case where a particular incidence structure splits into two substructures. The incidence structure in question was used previously by the authors to construct semi-biplanes $sbp(k^2,k)$ or $sbp(k^2/2,k)$. A complete…

We construct and prove the projectiveness of the moduli spaces which are natural generalizations to the case of surfaces of the following: 1) $M_{g,n}$, the moduli space of $n$-marked stable curves, 2) $M_{g,n}(W)$, the moduli space of…

A conic of the Veronese surface in PG(5,3) is a quadrangle. If one such quadrangle is replaced with its diagonal triangle, then one obtains a point model $K$ for Witt's 5-$(12,6,1)$ design, the blocks being the hyperplane sections…

We study arrangements of $m$ hyperplanes in the $n$-dimensional real projective space, with a special focus on $m=n+3$ and $n=3$ or $n=4$.

We carry out a general analysis of the representations of the superconformal algebras SU(2,2/N), OSp(8/4,R) and OSp(8^*/4) and give their realization in superspace. We present a construction of their UIR's by multiplication of the different…

Let $G$ be a connected Lie group and $\Gamma \subset G$ a lattice. Connection curves of the homogeneous space $M=G/\Gamma$ are the orbits of one parameter subgroups of $G$. To \textit{block} a pair of points $m_1,m_2 \in M$ is to find a…

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

We analyze general structure of N-fold supersymmetry which provides a systematic framework to construct weakly quasi-solvable quantum mechanical systems. Main ingredients of our analysis are dimensional analysis and introduction of an…

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

This work presents a generalized notion of multiset mapping thus resolving a long standing obstacle in structural study of multiset processing. It has been shown that the mapping defined herein can model a vast array of notions as special…

Necessary and sufficient conditions are given for when a sequence of finite dimensional subspaces (X_n) can be blocked to be a skipped blocking decompositon (SBD). These are very similar to known results about blocking of biorthogonal…

We study singular 1/2 BPS solutions in M-theory using 11-dimensional superstar solutions. The superstar solutions and their corresponding plane wave limits could give an insight how one may deform the boundary conditions to get singular,…

Minimal codes are being intensively studied in last years. $[n,k]_{q}$-minimal linear codes are in bijection with strong blocking sets of size $n$ in $PG(k-1,q)$ and a lower bound for the size of strong blocking sets is given by…

For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…

We study the spatial structure of 1/4 BPS solitons in 4 dimensional N=4 gauge theory. A weak binding approximation is used where the soliton is made of several "ingredient" particles. Some spatial moduli are described which are not…

We rephrase the Wootters-Fields construction [Ann. Phys., {\bf 191}, 363 (1989)] of a full set of mutually unbiased bases in a complex vector space of dimensions $N=p^r$, where $p$ is an odd prime, in terms of the character vectors of the…

We revisit the main results from \cites{BGN_SoCG14,BGN_SIAM15} and \cite{LafforgueNaor14_GD} about the impossibility of dimension reduction for doubling subsets of $\ell_q$ for $q>2$. We provide an alternative elementary proof of this…

A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not…

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,…

We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…