相关论文: Blocking sets in small finite linear spaces

In this paper, we propose a topological classification of points for 2D discrete binary images. This classification is based on the values of the calculus of topological numbers. Six classes of points are proposed: isolated point, interior…

For two metric spaces $\mathbb X$ and $\mathcal Y$, the chromatic number $\chi(\mathbb X;\mathcal Y)$ of $\mathbb X$ with forbidden $\mathcal Y$ is the smallest $k$ such that there is a coloring of the points of $\mathbb X$ with $k$ colors…

In this paper we consider linear systems of $\mathbb{P}^2$ with all but one of the base points of multiplicity 5. We give an explicit way to evaluate the dimensions of such systems.

We prove that if a finite point set in real space does not have too many points on a plane, then it spans a quadratic number of ordinary lines. This answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows that there is…

We derive two fixed point theorems for a class of metric spaces that includes all Banach spaces and all complete Busemann spaces. We obtain our results by the use of a 1-Lipschitz barycenter construction and an existence result for…

We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.

A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a \textit{powerful code} if, for all $X\subseteq E$, the number of vectors in $S$ that are zero in the positions indexed by $X$ is a power of 2. By…

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…

The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…

A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper…

We study two classes of spaces whose points are filters on partially ordered sets. Points in MF spaces are maximal filters, while points in UF spaces are unbounded filters. We give a thorough account of the topological properties of these…

Methods of *-representations in Hilbert space are applied to study of systems of $n$ subspaces in a linear space. It is proved that the problem of description of $n$-transitive subspaces in a finite-dimensional linear space is *-wild for $n…

It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…

For each integer $m \geq 2$, a network is constructed which is solvable over an alphabet of size $m$ but is not solvable over any smaller alphabets. If $m$ is composite, then the network has no vector linear solution over any $R$-module…

We consider the k-strong conflict-free coloring of a set of points on a line with respect to a family of intervals: Each point on the line must be assigned a color so that the coloring has to be conflict-free, in the sense that in every…

Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive restrictive conditions which such a cap…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…