相关论文: Resolving sets and semi-resolving sets in finite p…

We prove that if X is any 2-regular projective scheme (in the sense of Castelnuovo-Mumford) then X is "small". This means that if L is a linear space and Y:= L\cap X is finite, then Y is "linearly independent" in the sense that the…

A basis of the ideal of the complement of a linear subspace in a projective space over a finite field is given. As an application, the second largest number of points of plane curves of degree $d$ over the finite field of $q$ elements is…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Let $G$ be a finite simple graph on $n$ vertices, that contains no isolated vertices, and let $I(G) \subseteq S = K[x_1, \dots, x_n]$ be its edge ideal. In this paper, we study the pair of integers that measure the projective dimension and…

We construct two-weight sets in PG$(3n-1,q)$, $n\geq2$ with the same weights as those that would arise from the blow-up of a maximal $q$-arc in PG$(2,q^n)$. The construction is of particular interest when $q$ is odd, as it is well known…

We prove three theorems about solutions of $\Delta u + e^{2u} = 0$ in the plane. The first two describe explicitly all concave and quasiconcave solutions. The third theorem says that the diameter of the plane with respect to the metric with…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

Given a finite set, $X$, of points in projective space for which the Hilbert function is known, a standard result says that there exists a subset of this finite set whose Hilbert function is ``as big as possible'' inside $X$. Given a finite…

A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric…

We show that $A_2(7,4) \leq 388$ and, more generally, $A_q(7,4) \leq (q^2-q+1)[7]_q + q^4 - 2q^3 + 3q^2 - 4q + 4$ by semidefinite programming for $q \leq 101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$,…

We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…

We give a criterion for a projective surface to become a quotient of a fake projective plane. We also give a detailed information on the elliptic fibration of a $(2,3)$-elliptic surface that is the minimal resolution of a quotient of a fake…

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Injective resolutions of modules are key objects of homological algebra, which are used for the computation of derived functors. Semiinjective resolutions of chain complexes are more general objects, which are used for the computation of…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

A simple counting argument is used to show that for all $q$, an Andr\'e hyper-regulus $\mathbb X$ in $PG(5,q)$ has exactly two switching sets. Moreover, there are exactly $2(q^2+q+1)$ planes in $PG(5,q)$ that meet every plane of $\mathbb X$…

This paper is a continuation of the papers J. Pure Appl. Algebra, 210 (2007), 437--445 and J. Algebra Appl., 8 (2009), 219--227. Namely, we introduce and study a doubly filtered set of classes of modules of finite Gorenstein projective…

The task of identifying resolving sets has been extensively studied due to its wide relevance in fields such as chemistry, robot navigation, combinatorial optimization, pattern recognition, and image processing. These applications have…

We establish that the minimum number of arcs required to partition the Galois projective plane $\text{PG}(2,q)$ is $q+1$. Furthermore, we determine the exact value for a fractional variant of this problem. We extend our analysis to affine…