Related papers: Linear sets on the projective line with complement…
The purpose of the present article is to examine the essence of what has commonlybeen described as a "projective line", but which is here named a "meridian". This shall be done in several papers: this first paper devoted to the meridian…
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…
It is known that a linear two-weight code $C$ over a finite field $\F_q$ corresponds both to a multiset in a projective space over $\F_q$ that meets every hyperplane in either $a$ or $b$ points for some integers $a<b$, and to a strongly…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
The equivalence problem of $\mathbb{F}_q$-linear sets of rank n of $PG(1,q^n)$ is investigated, also in terms of the associated variety, projecting configurations, $\mathbb{F}_q$-linear blocking sets of R\'edei type and MRD-codes.
We present the notion of a filtered bundle as a generalisation of a graded bundle. In particular, we weaken the necessity of the transformation laws for local coordinates to exactly respect the weight of the coordinates by allowing more…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane $\mathbb{P}^2$. They appear in the study of resonance and characteristic varieties of complex hyperplane arrangement complements…
The projective space of order $n$ over the finite field $\Fq$, denoted here as $\Ps$, is the set of all subspaces of the vector space $\Fqn$. The projective space can be endowed with distance function $d_S(X,Y) = \dim(X) + \dim(Y) -…
In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also…
A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…
In this paper, we establish equivariant mirror symmetry for the weighted projective line. This extends the results by B. Fang, C.C. Liu and Z. Zong, where the projective line was considered [{\it Geometry \& Topology} 24:2049-2092, 2017].…
In this paper, we exhibit the equivalence between different notions of unique range sets, namely, unique range sets, weighted unique range sets and weak-weighted unique range sets under certain conditions.\par Also, we present some…
In this article we present a class of codes with few weights arising from special type of linear sets. We explicitly show the weights of such codes, their weight enumerator and possible choices for their generator matrices. In particular,…
Projective spaces for finite-dimensional vector spaces over general fields are considered. The geometry of these spaces and the theory of line bundles over these spaces is presented. Particularly, the space of global regular sections of…
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
We review some recent studies about the parameter determination of top quarks, W bosons, Higgs bosons, supersymmetric particles and in the ADD model of extra dimensions at a linear collider.
We address here spanning tree problems on a graph with binary edge weights. For a general weighted graph the minimum spanning tree is solved in super-linear running time, even when the edges of the graph are pre-sorted. A related problem,…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…