相关论文: Hyper-reguli in PG(5,q)

We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…

We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…

We investigate unification constraints in the simplest renormalizable non-supersymmetric SU(5) framework. We show that in the scenario where the Higgs sector is composed of the 5, 24, and 45 dimensional representations the proton could be…

We study totally real number fields that admit a universal quadratic form whose coefficients are rational integers. We show that $\mathbb Q(\sqrt 5)$ is the only such real quadratic field, and that among fields of degrees 3, 4, 5, and 7…

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

We characterise the quintic (i.e. 5-regular) multigraphs with the property that every edge lies in a triangle. Such a graph is either from a set of small graphs or is formed by adding a perfect matching to a line graph of a cubic graph as…

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to…

Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…

We give a classification of ordered five points in $\mathbb P^3$ under the diagonal action of $GL_4$ over an algebraically closed field of characteristic $0$, by an explicit description of the diagonal action of $GL_4$ on the quintuple of…

It is found that $15$ different types of two-qubit $X$-states split naturally into two sets (of cardinality $9$ and $6$) once their entanglement properties are taken into account. We {characterize both the validity and entangled nature of…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

In [2] and [19] are presented the first two families of maximum scattered $\mathbb{F}_q$-linear sets of the projective line $\mathrm{PG}(1,q^n)$. More recently in [23] and in [5], new examples of maximum scattered $\mathbb{F}_q$-subspaces…

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.

We prove that the parameter $x$ of a tight set $\mathcal{T}$ of a hyperbolic quadric $\mathsf{Q}^+(2n+1,q)$ of an odd rank $n+1$ satisfies ${x\choose 2}+w(w-x)\equiv 0\mod q+1$, where $w$ is the number of points of $\mathcal{T}$ in any…

In this paper, we construct intriguing sets in five classes of strongly regular graphs defined on nonisotropic points of finite classical polar spaces, and determine their intersection numbers.

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

Minimal 1-saturating sets in the projective plane $PG(2,q)$ are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information theory, as data compression, compression with distortion,…

Let $L$ be a prime alternating link with $n$ crossings. We show that for each fixed $g$, the number of genus $g$ incompressible surfaces in the complement of $L$ is bounded by a polynomial in $n$. Previous bounds were exponential in $n$.

In this paper, we study the cardinality of the smallest set of lines of the finite projective spaces $\operatorname{PG}(n,q)$ such that every plane is incident with at least one line of the set. This is the first main open problem…