Related papers: Constructing minimal blocking sets using field red…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
Optimal block designs in small blocks are explored when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first develop an approximate theory which leads to a convenient multiplicative…
Multiple coverings of the farthest-off points ($(R,\mu)$-MCF codes) and the corresponding $(\rho,\mu)$-saturating sets in projective spaces $PG(N,q)$ are considered. We propose and develop some methods which allow us to obtain new small…
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
In this paper we survey with complete proofs some well--known, but hard to find, results about constructing closed embedded minimal surfaces in a closed 3-dimensional manifold via min--max arguments. This includes results of J. Pitts, F.…
We describe a prescription for constructing conformal blocks in conformal field theories in any space-time dimension with arbitrary quantum numbers. Our procedure reduces the calculation of conformal blocks to constructing certain group…
A Block Structure Preserving Model Order Reduction approach is proposed for Integral Equations methods based on the Augmented Electric Field Integral Equation. This approach allows for representing the unknown fields with dedicated…
Working in the Virasoro picture, it is argued that the logarithmic minimal models LM(p,p')=LM(p,p';1) can be extended to an infinite hierarchy of logarithmic conformal field theories LM(p,p';n) at higher fusion levels n=1,2,3,.... From the…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
Observing a linear superposition principle, a family of new minimal hypersurfaces in Euclidean space is found, as well as that linear combinations of generalized helicoids induce new algebraic minimal cones of arbitrarily high degree.
This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…
By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…
The sequence in which a complex product is assembled directly impacts the ease and efficiency of the assembly process, whether executed by a human or a robot. A sequence that gives the assembler the greatest freedom of movement is therefore…
This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…
In this paper we investigate three-dimensional superconformal gauge theories with N=3 supersymmetry. Independently from specific models, we derive the shortening conditions for unitary representations of the Osp(3|4) superalgebra and we…
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…
Inspired by protein folding, we explored the construction of three-dimensional structures and machines from one-dimensional chains of simple building blocks. This approach not only allows us to recreate the self-replication mechanism…
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access…
Scattered linear sets of pseudoregulus type in $\mathrm{PG}(1,q^t)$ have been defined and investigated in [G. Lunardon, G. Marino, O. Polverino, R. Trombetti: Maximum scattered linear sets of pseudoregulus type and the Segre Variety ${\cal…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…