Related papers: Equiangular line systems and switching classes con…
A proper vertex coloring of the graph $G$ such that each vertex dominates at least one color class and the cardinalities of the color classes differ by at most $1$ is called an equitable dominator coloring of $G$. The minimum number of…
We consider the problem of determining the class of continuous-time dynamical systems that can be globally linearized in the sense of admitting an embedding into a linear system on a higher-dimensional Euclidean space. We solve this problem…
We solve the problem of topological classification for smooth structurally stable flows on closed four-dimensional manifolds, the non-wandering set of which contains exactly two saddle equilibria, and the wandering set contains isolated…
An equilateral dimension of a normed space is a maximal number of pairwise equidistant points of this space. The aim of this paper is to study the equilateral dimension of certain classes of finite dimensional normed spaces. The well-known…
We prove that an alternating e-form on a vector space over a quasi-algebraically closed field always has a singular (e-1)-dimensional subspace, provided that the dimension of the space is strictly greater than e. Here an (e-1)-dimensional…
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Some variants of energy can also be found in the literature which are defined on the concepts of Laplacian matrix, Distance…
We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…
Dimension-varying linear systems are investigated. First, a dimension-free state space is proposed. A cross dimensional distance is constructed to glue vectors of different dimensions together to form a cross-dimensional topological space.…
In this paper we consider the equiform motion of a helix in Euclidean space $\mathbf{E}^7$. We study and analyze the corresponding kinematic three dimensional surface under the hypothesis that its scalar curvature $\mathbf{K}$ is constant.…
The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…
The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…
We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…
This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…
We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
A subset $S$ of vertices of a connected graph $G$ is a distance-equalizer set if for every two distinct vertices $x, y \in V (G) \setminus S$ there is a vertex $w \in S$ such that the distances from $x$ and $y$ to $w$ are the same. The…
Retaining the combinatorial Euclidean structure of a regular icosahedron, namely the 20 equiangular (planar) triangles, the 30 edges of length 1, and the 12 different vertices together with the incidence structure, we investigate variations…
Hexagonal circle patterns are introduced, and a subclass thereof is studied in detail. It is characterized by the following property: For every circle the multi-ratio of its six intersection points with neighboring circles is equal to -1.…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…