Related papers: The minimum rank problem over finite fields

The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We…

The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…

Let $\mathbb{F}_q$ be a field with $q$ elements. In this note, we study some generalized arcs, that is, sets of $\mathbb{F}_q$-points in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ such that no six of them are on a conic. First, we…

Given a finite Lie incidence geometry which is either a polar space of rank at least $3$ or a strong parapolar space of symplectic rank at least $4$ and diameter at most $4$, or the parapolar space arising from the line Grassmannian of a…

Let $\mathcal{G}$ be a finite group scheme over an algebraically closed field $k$ of characteristic ${\rm char}(k)=p\geq 3$. In generalization of the familiar notion from the modular representation theory of finite groups, we define the…

We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…

We describe methods to determine all the possible torsion groups of an elliptic curve that actually appear over a fixed quadratic field. We use these methods to find, for each group that can appear over a quadratic field, the field with the…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…

We present a diagram surveying equivalence or strict implication for properties of different nature (algebraic, model theoretic, topological, etc.) about groups definable in o-minimal structures. All results are well-known and an extensive…

In the past decades, many scholars concerned which edge-extremal problems have spectral analogues? Recently, Wang, Kang and Xue showed an interesting result on $F$-free graphs [J. Combin. Theory Ser. B 159 (2023) 20--41]. In this paper, we…

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…

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They exist only in odd characteristic, but recently Zhou introduced an even characteristic analogue which has similar applications.…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

Consistent coupling of effective field theories with a quantum theory of gravity appears to require bounds on the the rank of the gauge group and the amount of matter. We consider landscapes of field theories subject to such to boundedness…

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…

The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Let $\mathbb{F}_q$ denote the finite field with $q$ elements. In this work, we use characters to give the number of rational points on suitable curves of low degree over $\mathbb{F}_q$ in terms of the number of rational points on elliptic…

We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of intriguing open problems, and formulate new ones.

The method is based on the preliminary transformation of the traditionally used matrices or adjacency lists in the graph theory into refined projections free from redundant information, and their subsequent use in constructing shortest…