Related papers: Blocking sets in chain geometries

We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.

The goal of this article is to describe several presentations of the infinity category of algebras over some monad on the infinity category of chain complexes.

In this paper we consider the structure of $\omega$-limit sets in subshifts of Baire space. We consider both subshifts of finite type and subshifts of bounded type and we demonstrate that many classical structure theorems for $\omega$-limit…

We discuss applications of minimal surfaces to comparison geometry.

We discuss the notion of essential dimension of a finite group and explain its relation with birational algebraic geometry. We show how this leads to a (partial) classification of simple finite groups of essential dimension less than or…

The main purpose this work is to study the minimal fixed point set of fiber-preserving maps for spaces which are fiber bundles over the circle and the fiber is the torus. Using the one-parameter fixed point theory is possible to describe…

Blocking sets and minimal codes have been studied for many years in projective geometry and coding theory. In this paper, we provide a new lower bound on the size of $t$-fold $s$-blocking sets without the condition $t \leq q$, which is…

We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic…

In this paper we discuss various aspects of the problem of determining the minimal dimension of an injective linear representation of a finite semigroup over a field. We outline some general techniques and results, and apply them to…

We study two principle minimizing problems, subject of different constraints. Our open sets are assumed bounded, except mentioning otherwise;precisely $\Omega=]0,1[^n \in {\mathbb{R}}^n , n=1 $ or $n=2$.

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.

In this short note we give and discuss a general multilinear expression of the structure function of an arbitrary semicoherent system in terms of its minimal path and cut sets. We also examine the link between the number of minimal path and…

We prove a semistable reduction theorem for principal bundles on curves in almost arbitrary characteristics. For exceptional groups we need some small explicit restrictions on the characteristic.

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of…

We provide a simple proof of the radial symmetry of any nonnegative minimizer for a general class of quasi-linear minimization problems.