Related papers: Gram mates, sign changes in singular values, and i…
The Gram spectrahedron $\text{Gram}(f)$ of a form $f$ with real coefficients parametrizes the sum of squares decompositions of $f$, modulo orthogonal equivalence. For $f$ a sufficiently general positive binary form of arbitrary degree, we…
Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…
Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…
We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$. We show that if the diameter is at least…
In this note we extend our study of the rich geometry of the graph of a curve defined as the weighted sum of two exponentials. Let $\gamma_{a,b}^{s}: [0,1] \rightarrow \mathbb{C}$ be defined as $$\gamma_{a,b}^s(t) = (1-s) \exp(2 \pi i a t)…
For positive semidefinite $n\times n$ matrices $A$ and $B$, the singular value inequality $(2+t)s_{j}(A^{r}B^{2-r}+A^{2-r}B^{r})\leq 2s_{j}(A^{2}+tAB+B^{2})$ is shown to hold for $r=\frac{1}{2}, 1, \frac{3}{2}$ and all $-2<t\leq 2$.
Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
Given an isolated, quasi-homogeneous singularity $X$ we prove that there is a group isomorphism between the group of rank one reflexive sheaves on $X$ and the free abelian group generated by $\mathbb{C}^*$-divisors, modulo linear…
In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…
In this paper we construct non-negative gradings on a basic Brauer tree algebra $A_{\Gamma}$ corresponding to an arbitrary Brauer tree $\Gamma$ of type $(m,e)$. We do this by transferring gradings via derived equivalence from a basic Brauer…
A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
A class of one-relator groups such that every group in the class is determined by a triple of integers and is an HNN-extension of some Baumslag -- Solitar group is considered. A criterion for two groups in this class to be isomorphic and…