English
Related papers

Related papers: Linear sets on the projective line with complement…

200 papers

It is well known that there are no stable bundles of rank greater than 1 on the projective line. In this paper, our main purpose is to study the existence problem for stable coherent systems on the projective line when the number of…

Algebraic Geometry · Mathematics 2020-06-19 P. E. Newstead , Montserrat Teixidor i Bigas

We define and explore the notion of linear weightings for vector bundles, extending the recent work by Loizides and Meinrenken. We construct weighted normal bundles and deformation spaces in the category of vector bundles. We explain how a…

Differential Geometry · Mathematics 2023-12-06 Daniel Hudson

A compact classification of the projective lines defined over (commutative) rings (with unity) of all orders up to thirty-one is given. There are altogether sixty-five different types of them. For each type we introduce the total number of…

Algebraic Geometry · Mathematics 2011-11-09 Metod Saniga , Michel Planat , Maurice Kibler , Petr Pracna

In this manuscript, we construct a class of projective three-weight linear codes and two classes of projective four-weight linear codes over F2 from the defining sets construction, and determine their weight distributions by using additive…

Information Theory · Computer Science 2025-11-04 Qunying Liao , Zhaohui Zhang , Peipei Zheng

A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…

Combinatorics · Mathematics 2022-10-24 Charles J. Colbourn , Colin Ingalls , Jonathan Jedwab , Mark Saaltink , Ken W. Smith , Brett Stevens

We determine those maps between affine or projective spaces that are linear in the abstract sense of transforming collinear points into collinear points and whose restriction to any line is constant or injective. Our results are extensions…

Algebraic Geometry · Mathematics 2023-07-28 Juan B. Sancho de Salas

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Optimization and Control · Mathematics 2022-06-10 Adrian S. Lewis , Genaro López-Acedo , Adriana Nicolae

We consider bounded 2-metric spaces satisfying an additional axiom, and show that a contractive mapping has either a fixed point or a fixed line.

Metric Geometry · Mathematics 2011-04-08 Abdelkrim Aliouche , Carlos T. Simpson

We introduce a notion of a connection on a coherent sheaf on a weighted projective line (in the sense of Geigle and Lenzing). Using a theorem of Huebner and Lenzing we show, under a mild hypothesis, that if one considers coherent sheaves…

Algebraic Geometry · Mathematics 2009-04-23 William Crawley-Boevey

Extending the `metric spaces' of Lawvere, we study `real metrics', with values in the extended real line. Formally, this ordered set is a symmetric monoidal closed category, and our structures are enriched categories on the latter.…

Algebraic Topology · Mathematics 2026-05-14 Marco Grandis

We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some important cases, automorphisms induced by non-monomial…

Combinatorics · Mathematics 2024-07-12 Mark Pankov , Krzysztof Petelczyc , Mariusz Zynel

In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…

Information Theory · Computer Science 2020-04-28 Chunming Tang , Yan Qiu , Qunying Liao , Zhengchun Zhou

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-30 Thomas Honold

We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…

Optimization and Control · Mathematics 2023-11-02 Christian Biefel , Martin Schmidt

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh

The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…

Category Theory · Mathematics 2007-05-23 Marco Grandis

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective…

Optimization and Control · Mathematics 2024-01-26 Andreas Löhne , Benjamin Weißing

We describe recent work on preprojective algebras and moduli spaces of their representations. We give an analogue of Kac's Theorem, characterizing the dimension types of indecomposable coherent sheaves over weighted projective lines in…

Rings and Algebras · Mathematics 2007-05-23 William Crawley-Boevey

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

Classical Analysis and ODEs · Mathematics 2008-02-03 Anne de Médicis , Dennis W. Stanton