Related papers: Enumeration of Seidel matrices
We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…
The maximal graded subalgebras for four families of Lie superalgebras of Cartan type over a field of prime characteristic are studied. All maximal reducible graded subalgebras are described completely and their isomorphism classes,…
Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…
We show that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $20$, and that if equality is attained, then the…
If the face\mbox{-}cycles at all the vertices in a map are of the same type, then the map is said to be a semi-equivelar map. Automorphism (symmetry) of a map can be thought of as a permutation of the vertices which preserves the…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the…
A set of lines in $\mathbb{R}^d$ passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-point semidefinite constraints developed by Bachoc and…
We prove that any $\ell$ positive definite $d \times d$ matrices, $M_1,\ldots,M_\ell$, of full rank, can be simultaneously spectrally balanced in the following sense: for any $k < d$ such that $\ell \leq \lfloor \frac{d-1}{k-1} \rfloor$,…
We obtain several norm and eigenvalue inequalities for positive matrices partitioned into four blocks. The results involve the numerical range of the off-diagonal block X, especially the distance from 0 to W(X).
We prove some eigenvalue inequalities for positive semidefinite matrices partitioned into four blocks. The inradius of the numerical range of the off-diagonal block contributes to these estimates. Some related norm inequalities are given…
If $G$ is a graph and $\mathbf{m}$ is an ordered multiplicity list which is realizable by at least one symmetric matrix with graph $G$, what can we say about the eigenvalues of all such realizing matrices for $\mathbf{m}$? It has sometimes…
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…
It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced…
We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…
This paper examines the spectral characterizations of oriented graphs. Let $\Sigma$ be an $n$-vertex oriented graph with skew-adjacency matrix $S$. Previous research mainly focused on self-converse oriented graphs, proposing arithmetic…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
This paper is devoted to the complete algebraic and geometric classification of complex $5$-dimensional Zinbiel algebras. In particular, we proved that the variety of complex $5$-dimensional Zinbiel algebras has dimension $24$, it is…
Let K be an arbitrary (commutative) field and L be an algebraic closure of it. Let V be a linear subspace of M_n(K), with n>2. We show that if every matrix of V has at most one eigenvalue in K, then dim V<=1+n(n-1)/2. If every matrix of V…
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…