Related papers: A dynamical approach to nonhomogeneous spectra

We examine "dynamical similarities" in the Lagrangian framework. These are symmetries of an intrinsically determined physical system under which observables remain unaffected, but the extraneous information is changed. We establish three…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…

Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…

Let $G$ be a simple, connected graph and let $A(G)$ be the adjacency matrix of $G$. If $D(G)$ is the diagonal matrix of the vertex degrees of $G$, then for every real $\alpha \in [0,1]$, the matrix $A_{\alpha}(G)$ is defined as…

For a real set $A$ consider the semigroup $S(A)$, additively generated by $A$; that is, the set of all real numbers representable as a (finite) sum of elements of $A$. If $A \subset (0,1)$ is open and non-empty, then $S(A)$ is easily seen…

Let $A=(a_{ij})\in M_n(\R)$ be an $n$ by $n$ symmetric stochastic matrix. For $p\in [1,\infty)$ and a metric space $(X,d_X)$, let $\gamma(A,d_X^p)$ be the infimum over those $\gamma\in (0,\infty]$ for which every $x_1,...,x_n\in X$ satisfy…

The main focus of this work is the reconstruction of the signals $f$ and $g_{i}$, $i=1,...,N$, from the knowledge of their sums $h_{i}=f+g_{i}$, under the assumption that $f$ and the $g_{i}$'s can be sparsely represented with respect to two…

Let $G$ be a graph on $n$ vertices of independence number $\alpha(G)$ such that every induced subgraph of $G$ on $n-k$ vertices has an independent set of size at least $\alpha(G) - \ell$. What is the largest possible $\alpha(G)$ in terms of…

The noncommutative spectral action extends our familiar notion of commutative spaces, using the data encoded in a spectral triple on an almost commutative space. Varying a rather simple action, one can derive all of the standard model of…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in [0,1]$, Nikiforov \cite{VN1} defined the matrix $A_{\alpha}(G)$ as $$A_{\alpha}(G)=\alpha…

For a connected graph $G$, let $A(G)$ be the adjacency matrix of $G$ and $D(G)$ be the diagonal matrix of the degrees of the vertices in $G$. The $A_{\alpha}$-matrix of $G$ is defined as \begin{align*} A_\alpha (G) = \alpha D(G) +…

Consider a finite dimensional complex Hilbert space $\cH$, with $dim(\cH) \geq 3$, define $\bS(\cH):= \{x\in \cH \:|\: ||x||=1\}$, and let $\nu_\cH$ be the unique regular Borel positive measure invariant under the action of the unitary…

In this article, we define a special function called the Bigamma function. It provides a generalization of Euler's gamma function. Several algebraic properties of this new function are studied. In particular, results linking this new…

We are interested in the following problem: given an open, bounded domain $\Omega \subset \mathbb{R}^2$, what is the largest constant $\alpha = \alpha(\Omega) > 0$ such that there exist an infinite sequence of disks $B_1, B_2, \dots, B_N,…

Let $G$ be a graph on $n$ vertices, its adjacency matrix and degree diagonal matrix are denoted by $A(G)$ and $D(G)$, respectively. In 2017, Nikiforov \cite{0007} introduced the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ for…

Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…

For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and $\mathcal{A}(G)$ are the diagonal tensor of…

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the original graph. It has a long history in scientific computing…

In this paper we develop the basic homotopy theory of G-symmetric spectra (that is, symmetric spectra with a G-action) for a finite group G, as a model for equivariant stable homotopy with respect to a G-set universe. This model lies in…