Related papers: Resolving sets and semi-resolving sets in finite p…

Let $L=\mathbb F_{q^n}$ be a finite field and let $F=\mathbb F_q$ be a subfield of $L$. Consider $L$ as a vector space over $F$ and the associated projective space that is isomorphic to ${\mathrm{PG}}(n-1,q)$. The properties of the…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Let $S \subset \R^{k + m}$ be a compact semi-algebraic set defined by a system of $\ell$ polynomial inequalities of degree at most 2. $ Let $\pi$ denote the standard projection from $\R^{k + m}$ onto $\R^m$. We prove that for any $q >0$,…

We consider a non-degenerate conic in $\PG(2,q^2)$, $q$ odd, that is tangent to $\ell_\infty$ and look at its structure in the Bruck-Bose representation in $\PG(4,q)$. We determine which combinatorial properties of this set of points in…

In this paper we study a family of scattered $\F_q$--linear sets of rank $tn$ of the projective space $PG(2n-1,q^t)$ ($n \geq 1$, $t\geq 3$), called of {\it pseudoregulus type}, generalizing results contained in [G. Marino, O. Polverino, R.…

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…

A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…

This work focuses on higgledy-piggledy sets of $k$-subspaces in $\text{PG}(N,q)$, i.e. sets of projective subspaces that are 'well-spread-out'. More precisely, the set of intersection points of these $k$-subspaces with any $(N-k)$-subspace…

The small finitistic dimension $\fPD(R)$ of a ring $R$ is defined to be the supremum of projective dimensions of $R$-modules with finite projective resolutions. In this paper, we investigate the small finitistic dimensions of four types of…

We study how to formalize in the Coq proof assistant the smallest projective space PG(3,2). We then describe formally the spreads and packings of PG(3,2), as well as some of their properties. The formalization is rather straightforward,…

We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG$(n,q)$, $n\ge 5$ odd, and show that the members of the family are the smallest possible examples if $n\ge 9$ or $q\ge 25$.

In this paper we consider binary linear codes spanned by incidence matrices of Steiner 2-designs associated with maximal arcs in projective planes of even order, and their dual codes. Upper and lower bounds on the 2-rank of the incidence…

The ring of projective invariants of eight ordered points on the line is a quotient of the polynomial ring on V, where V is a fourteen-dimensional representation of S_8, by an ideal I_8, so the modular fivefold (P^1)^8 // GL(2) is Proj(Sym*…

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

It is known that all resolution IV regular $2^{n-m}$ designs of run size $N=2^{n-m}$ where $5N/16<n<N/2$ must be projections of the maximal even design with $N/2$ factors and, therefore, are even designs. This paper derives a general and…

Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the maximal matrix size of these LMIs is…

A closed subscheme of codimension two $T \subset P^2$ is a quasi complete intersection (q.c.i.) of type $(a,b,c)$ if there exists a surjective morphism $\mathcal{O} (-a) \oplus \mathcal{O} (-b) \oplus \mathcal{O} (-c) \to \mathcal{I} _T$.…