Related papers: Explicit constructions of optimal blocking sets an…
Given $s\in(1,2]$, define $$H_s[0,1]=\{f\in C[0,1]:{\dim}_HG_f([0,1])=s\}$$ and $$\overline{B}_s[0,1]=\{f\in C[0,1]:\overline{{\dim}}_BG_f([0,1])=s\}.$$ The main goal of this paper is to study the $(\alpha,\beta)$-lineability/spaceability…
Linear sets over finite fields are central objects in finite geometry and coding theory, with deep connections to structures such as semifields, blocking sets, KM-arcs, and rank-metric codes. Among them, $i$-clubs, a class of linear sets…
A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is…
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…
Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim., 34 (2024), pp. 1569-1594] by Bredies, Chenchene and Naldi. We particularize it to the case where…
We consider the problem of finding the minimal number of points required to intersect all lines in an affine space over the finite field of order 3. We also consider the problem of finding the minimal number of points required to intersect…
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…
We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…
In this paper, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an…
An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is…
Quasi-one-dimensional quantum structures with spectra scaling faster than the square of the eigenmode number (superscaling) can generate intrinsic, off-resonant optical nonlinearities near the fundamental physical limits, independent of the…
In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…
An $(r,M,2\delta;k)_q$ constant--dimension subspace code, $\delta >1$, is a collection $\cal C$ of $(k-1)$--dimensional projective subspaces of ${\rm PG(r-1,q)}$ such that every $(k-\delta)$--dimensional projective subspace of ${\rm…
Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda…
Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…