6 citations · 14 across the 57 of their papers we have counts for
67 papers
Recovering of the Grassmann graph from the subgraph of non-degenerate subspaces
Mark Pankov
Let be a (not necessarily finite) field. A subspace of the vector space is called {\it non-degenerate} if it is not contained in a coordinate hyperpla…
Symmetric -designs in terms of the geometry of binary simplex codes of dimension
Mark Pankov, Krzysztof Petelczyc, Mariusz Żynel
Let and for a certain . Consider the point-line geometry of -element subsets of an -element set. Maximal singular subspaces of this geometry co…
A non-surjective Wigner-type theorem in terms of equivalent pairs of subspaces
Mark Pankov
Let be an infinite-dimensional complex Hilbert space and let be the set of all closed subspaces of whose dimension and codimension both are infin…
Maximal cliques in the graph of -ary simplex codes of dimension two
Mariusz Kwiatkowski, Andrzej Matraś, Mark Pankov +1
We consider the induced subgraph of the corresponding Grassmann graph formed by -ary simplex codes of dimension , . This graph contains precisely two types of maximal…
On maximal cliques in the graph of simplex codes
Mariusz Kwiatkowski, Mark Pankov
The induced subgraph of the corresponding Grassmann graph formed by simplex codes is considered. We show that this graph, as the Grassmann graph, contains two types of maximal cliq…
Point-line geometries related to binary equidistant codes
Mark Pankov, Krzysztof Petelczyc, Mariusz Zynel
We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some…