Related papers: A dynamical approach to nonhomogeneous spectra

The size of the smallest $k$-regular graph of girth at least $g$ is denoted by the well-studied function $n(k,g)$. We introduce an analogous function $n(H,g)$, defined as the smallest size graph of girth at least $g$ that is a lift (or…

In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…

In this paper using a transform defined by the translation operator we introduce the concept of spectrum of sequences that are bounded by $n^\nu$, where $\nu$ is a natural number. We apply this spectral theory to study the asymptotic…

We give a sharp comparison between the spectra of two Riemannian manifolds (Y,g) and (X,g_0) under the following assumptions: (X,g_0) has bounded geometry, (Y,g) admits a continuous Gromov-Hausdorff {\epsilon}-approximation onto (X,g_0) of…

Let $G$ be a connected graph of order $n$ with $n\geq25$. A $\{P_3,P_4,P_5\}$-factor is a spanning subgraph $H$ of $G$ such that every component of $H$ is isomorphic to an element of $\{P_3,P_4,P_5\}$. Nikiforov introduced the…

Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…

Physical systems with symmetries are described by functions containing kinematical and dynamical parts. We consider the case when kinematical symmetries are described by a noncompact semisimple real Lie group $G$. Then separation of…

This is the second part of the paper that provides a new strategy for the heterogeneous change detection (HCD) problem, that is, solving HCD from the perspective of graph signal processing (GSP). We construct a graph to represent the…

The rapid adoption of synthetic data for training Large Language Models (LLMs) has introduced the technical challenge of "model collapse"-a degenerative process where recursive training on model-generated content leads to a contraction of…

Gaussian process is a theoretically appealing model for nonparametric analysis, but its computational cumbersomeness hinders its use in large scale and the existing reduced-rank solutions are usually heuristic. In this work, we propose a…

A graph $G$ is said to be \emph{determined by its spectrum} if any graph having the same spectrum as $G$ is isomorphic to $G$. Let $K_n \setminus P_{\ell}$ be the graph obtained from $K_n$ by removing edges of $P_\ell$, where $P_\ell$ is a…

Classical persistent homology is a powerful mathematical tool for shape comparison. Unfortunately, it is not tailored to study the action of transformation groups that are different from the group Homeo(X) of all self-homeomorphisms of a…

We bring together three key amplification mechanisms in linear dynamical systems: spectral criticality, resonance, and non-normality. We present a unified linear framework that both distinguishes and quantitatively links these effects…

The main aim of this paper is to prove that the double inequality \frac{(k-1)!}{\Bigl\{x+\Bigl[\frac{(k-1)!}{|\psi^{(k)}(1)|}\Bigr]^{1/k}\Bigr\}^k}…

For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…

A unified framework is proposed for tests of unobserved heterogeneity in parametric statistic models based on Neyman's $C(\alpha)$ approach. Such tests are irregular in the sense that the first order derivative of the log likelihood with…

Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…

Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…

For $\nu\in[0,1]$ and a complex parameter $\sigma,$ $Re\, \sigma>0,$ we discuss a linear inhomogeneous functional difference equation with variable coefficients on a complex plane $z\in\mathbb{C}$: \[…