Related papers: Linear sets on the projective line with complement…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
A weighted complementarity problem (wCP) is to find a pair of vectors belonging to the intersection of a manifold and a cone such that the product of the vectors in a certain algebra equals a given weight vector. If the weight vector is…
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…
The present paper is a sequel to our paper "Metric characterization of isometries and of unital operator spaces and systems". We characterize certain common objects in the theory of operator spaces (unitaries, unital operator spaces,…
Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…
In this article we studied the relationship between metric spaces and multiplicative metric spaces. Also, we pointed out some fixed and common fixed point results under some contractive conditions in multiplicative metric spaces can be…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
This paper deals with the triangle singularity defined by the \linebreak equation $f=X_1^{p_1}+X_2^{p_2}+X_3^{p_3}$ for weight triple $(p_1,p_2,p_3)$, as well as the category of coherent sheaves over the weighted projective line…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
In \cite{PSMA}, Pal et al. introduced some weighted means and gave some related inequalities by using an approach for operator monotone functions. This paper discusses the construction of these weighted means in a simple and nice setting…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…
In this thesis, we present results related to complementarity problems. We study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed…
Trajectories of light rays in a static spacetime are described by unparametrised geodesics of the Riemannian optical metric associated with the Lorentzian spacetime metric. We investigate the uniqueness of this structure and demonstrate…
In this paper we investigate whether positive elements in the multiplier algebras of certain finite C*-algebras can be written as finite linear combinations of projections with positive coefficients (PCP). Our focus is on the category of…
We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.
Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such…
We discuss two concepts of metric and linear connections in noncommutative geometry, applying them to the case of the product of continuous and discrete (two-point) geometry.