اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe limit theorem with respect to the matrices on non-backtracking paths of a graph
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a limit theorem with respect to the matrices related to non-backtracking paths of a regular graph. The limit obtained closely resembles the $k$th moments of the arcsine law. Furthermore, we obtain the asymptotics of the averages of the $p^m$th Fourier coefficients of the cusp forms related to the Ramanujan graphs defined by A. Lubotzky, R. Phillips and P. Sarnak.
قيم البحث
اقرأ أيضاً
Recently, Gnutzmann and Smilansky presented a formula for the bond scattering matrix of a graph with respect to a Hermitian matrix. We present another proof for this Gnutzmann and Smilanskys formula by a technique used in the zeta function of a graph
. Furthermore, we generalize Gnutzmann and Smilanskys formula to a regular covering of a graph. Finally, we define an $L$-fuction of a graph, and present a determinant expression. As a corollary, we express the generalization of Gnutzmann and Smilanskys formula to a regular covering of a graph by using its $L$-functions.
Given three nonnegative integers $p,q,r$ and a finite field $F$, how many Hankel matrices $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ over $F$ have rank $leq r$ ? This question is classical, and the answer ($q^{2r}$ when $rleqminleft{ p,qright}
$) has been obtained independently by various authors using different tools (Daykin, Elkies, Garcia Armas, Ghorpade and Ram). In this note, we study a refinement of this result: We show that if we fix the first $k$ of the entries $x_{0},x_{1},ldots,x_{k-1}$ for some $kleq rleqminleft{ p,qright} $, then the number of ways to choose the remaining $p+q-k+1$ entries $x_{k},x_{k+1},ldots,x_{p+q}$ such that the resulting Hankel matrix $left( x_{i+j}right) _{0leq ileq p, 0leq jleq q}$ has rank $leq r$ is $q^{2r-k}$. This is exactly the answer that one would expect if the first $k$ entries had no effect on the rank, but of course the situation is not this simple. The refined result generalizes (and provides an alternative proof of) a result by Anzis, Chen, Gao, Kim, Li and Patrias on evaluations of Jacobi-Trudi determinants over finite fields.
In this paper, we study growth rate of product of sets in the Heisenberg group over finite fields and the complex numbers. More precisely, we will give improvements and extensions of recent results due to Hegyv{a}ri and Hennecart (2018).
Let $G$ be a connected graph. The edge revised Szeged index of $G$ is defined as $Sz^{ast}_{e}(G)=sumlimits_{e=uvin E(G)}(m_{u}(e|G)+frac{m_{0}(e|G)}{2})(m_{v}(e|G)+frac{m_{0}(e|G)}{2})$, where $m_{u}(e|G)$ (resp., $m_{v}(e|G)$) is the number of edge
s whose distance to vertex $u$ (resp., $v$) is smaller than the distance to vertex $v$ (resp., $u$), and $m_{0}(e|G)$ is the number of edges equidistant from both ends of $e$. In this paper, we give the minimal and the second minimal edge revised Szeged index of cacti with order $n$ and $k$ cycles, and all the graphs that achieve the minimal and second minimal edge revised Szeged index are identified.
We define a zeta function woth respect to the twisted Grover matrix of a mixed digraph, and present an exponential expression and a determinant expression of this zeta function. As an application, we give a trace formula with respect to the twisted Grover matrix of a mixed digraph.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
