Related papers: Design Lines
We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…
We find monodromy formulas for line arrangements which are fibered with respect to the projection from one point. We use them to find $0$-dimensional translated components in the first characteristic variety of the arrangement $\mathcal…
We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a…
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…
The first part of this note contains a review of basic properties of the variety of lines contained in an embedded projective variety and passing through a general point. In particular we provide a detailed proof that for varieties defined…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
In this paper we detail a number of properties of the affine line of a derivator, including a number of morphisms between $\mathbb{D}$ and $\mathbb{A}^1_{\mathbb{D}}$, a monoidal structure on $\mathbb{A}^1_{\mathbb{D}}$ if $\mathbb{D}$ is…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with at least five invariant lines, including the line at…
A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…
The fundamental theorem of affine geometry is a classical and useful result. For finite-dimensional real vector spaces, the theorem roughly states that a bijective self-mapping which maps lines to lines is affine. In this note we prove…
Straight lines are common features in human made environments, which makes them a frequently explored feature for control applications. Many control schemes, like Visual Servoing, require the 3D parameters of the features to be estimated.…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
Almost designs ($t$-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike $t$-designs, it is not clear whether $t$-adesigns need also be $(t-1)$-designs…
Linear Geometry describes geometric properties that depend on the fundamental notion of a line. In this paper we survey basic notions and results of Linear Geomery that depend on the flat hulls: flats, exchange, rank, regularity,…