Related papers: On the matrix sequence $\{\Gamma(A^m)\}_{m=1}^\inf…

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…

The Abels-Margulis-Soifer lemma states that if a semigroup $\Gamma$ acts strongly irreducibly by linear transformations on a finite-dimensional real vector space, then any element of $\Gamma$ can be multiplied by an element of some fixed…

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

A boolean matrix is blocky if its $1$-entries form a collection of 1-monochromatic submatrices that are disjoint in both rows and columns. Blocky matrices are precisely the set of boolean matrices with $\gamma_2$ factorization norm at most…

This paper introduces a method for studying the correlation structure of a range of responses modelled by a multivariate generalised linear mixed model (MGLMM). The methodology requires the existence of clusters of observations and that…

This work is devoted to the analysis of the interplay between internal variables and high-contrast microstructure in inelastic solids. As a concrete case-study, by means of variational techniques, we derive a macroscopic description for an…

Let $(A,\mathfrak{m})$ be a commutative complete equicharacteristic Gorenstein isolated singularity of dimension $d $ with $k = A/\mathfrak{m}$ algebraically closed. Let $\Gamma(A)$ be the AR (Auslander-Reiten) quiver of $A$. Let…

We consider a variational problem modeling transition between flat and wrinkled region in a thin elastic sheet, and identify the $\Gamma$-limit as the sheet thickness goes to 0, thus extending the previous work of the first author [Bella,…

We analyse the $\Gamma$-convergence of general non-local convolution type functionals with varying densities depending on the space variable and on the symmetrized gradient. The limit is a local free-discontinuity functional, where the bulk…

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…

Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…

Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…

The alliance polynomial of a graph $\Gamma$ with order $n$ and maximum degree $\delta_1$ is the polynomial $A(\Gamma; x) = \sum_{k=-\delta_1}^{\delta_1} A_{k}(\Gamma) \, x^{n+k}$, where $A_{k}(\Gamma)$ is the number of exact defensive…

The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs, it is natural to ask whether it holds for digraphs with…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…