Related papers: Hoffman's coclique bound for normal regular digrap…

We give an explicit presentation for each lower bound cluster algebra. Using this presentation, we show that each lower bound algebra Grobner degenerates to the Stanley-Reisner scheme of a vertex-decomposable ball or sphere, and is thus…

We extend the generalised hodograph method to regular non- diagonalisable integrable systems of hydrodynamic type, in light of the relation between such systems and F-manifolds with compatible connection. The method allows the construction…

We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…

We develop a new technique for computing higher limits of functors over filtered posets by constructing explicit fibrant replacements within a suitable model category structure. We apply this procedure to develop two systematic vanishing…

In this paper, we study the relative perturbation bounds for joint eigenvalues of commuting tuples of normal $n \times n$ matrices. Some Hoffman-Wielandt type relative perturbation bounds are proved using the Clifford algebra technique. A…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…

In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, \lambda, \mu)$ satisfying $\mu = \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the…

Let $W$ be a Coxeter group. The goal of the paper is to construct new Hopf algebras that contain Hecke algebras $H_{\bf q}(W)$ as (left) coideal subalgebras. Our Hecke-Hopf algebras ${\bf H}(W)$ have a number of applications. In particular…

We investigate fat Hoffman graphs with smallest eigenvalue at least -3, using their special graphs. We show that the special graph S(H) of an indecomposable fat Hoffman graph H is represented by the standard lattice or an irreducible root…

We generalize quantum Drinfeld Hecke algebras by incorporating a 2-cocycle on the associated finite group. We identify these algebras as specializations of deformations of twisted skew group algebras, giving an explicit connection to…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

Starting with the average particle distribution function for bosons and fermions for non-extensive thermodynamics , as proposed in \cite{CMP}, we obtain the corresponding density matrix operators and hamiltonians. In particular, for the…

In the realm of invertible symmetry, the topological approach based on classifying spaces dominates the classification of 't Hooft anomalies and symmetry protected topological phases. We explore the alternative algebraic approach based on…

Consider a random graph model with $n$ vertices where each vertex has a vertex-type drawn from some discrete distribution. Suppose that the number of arcs to be placed between each pair of vertex-types is known, and that each arc is placed…

We consider non-Hermitian random matrices $X \in \mathbb{C}^{n \times n}$ with general decaying correlations between their entries. For large $n$, the empirical spectral distribution is well approximated by a deterministic density,…

We derive the limiting distribution for the largest eigenvalues of the adjacency matrix for a stochastic blockmodel graph when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate…

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a graph $G$ is edge covered by connected isometric subgraphs…

Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence…