اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProperties of a $q$-analogue of zero forcing
77
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor, then the neighbor is filled for free. This paper investigates a $q$-analogue of zero forcing which introduces a third option involving an oracle. Basic properties of this game are established including determining all graphs which have minimal cost $1$ or $2$ for all possible $q$, and finding the zero forcing number for all trees when $q=1$.
قيم البحث
اقرأ أيضاً
In this paper we shall survey the various methods of evaluating Hankel determinants and as an illustration we evaluate some Hankel determinants of a q-analogue of Catalan numbers. Here we consider $frac{(aq;q)_{n}}{(abq^{2};q)_{n}}$ as a q-analogue o
f Catalan numbers $C_{n}=frac1{n+1}binom{2n}{n}$, which is known as the moments of the little q-Jacobi polynomials. We also give several proofs of this q-analogue, in which we use lattice paths, the orthogonal polynomials, or the basic hypergeometric series. We also consider a q-analogue of Schroder Hankel determinants, and give a new proof of Moztkin Hankel determinants using an addition formula for ${}_2F_{1}$.
We derive an equation that is analogous to a well-known symmetric function identity: $sum_{i=0}^n(-1)^ie_ih_{n-i}=0$. Here the elementary symmetric function $e_i$ is the Frobenius characteristic of the representation of $mathcal{S}_i$ on the top homo
logy of the subset lattice $B_i$, whereas our identity involves the representation of $mathcal{S}_ntimes mathcal{S}_n$ on the Segre product of $B_n$ with itself. We then obtain a q-analogue of a polynomial identity given by Carlitz, Scoville and Vaughan through examining the Segre product of the subspace lattice $B_n(q)$ with itself. We recognize the connection between the Euler characteristic of the Segre product of $B_n(q)$ with itself and the representation on the Segre product of $B_n$ with itself by recovering our polynomial identity from specializing the identity on the representation of $mathcal{S}_itimes mathcal{S}_i$.
Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few unforced moves as possible. This leads to a parameter known as the zero forcing number which can be used t
o give an upper bound for the maximum nullity of a matrix associated with the graph. We introduce a new variation on the zero forcing game which can be used to give an upper bound for the maximum nullity of a matrix associated with a graph that has $q$ negative eigenvalues. This gives some limits to the number of positive eigenvalues that such a graph can have and so can be used to form lower bounds for the inertia set of a graph.
We answer a question posed by Michael Aissen in 1979 about the $q$-analogue of a classical theorem of George Polya (1922) on the algebraicity of (generalized) diagonals of bivariate rational power series. In particular, we prove that the answer to Ai
ssens question, in which he considers $q$ as a variable, is negative in general. Moreover, we show that the answer is positive if and only if $q$ is a root of unity.
Given a graph $G$, one may ask: What sets of eigenvalues are possible over all weighted adjacency matrices of $G$? (The weight of an edge is positive or negative, while the diagonal entries can be any real numbers.) This is known as the Inverse Eigen
value Problem for graphs (IEP-$G$). A mild relaxation of this question considers the multiplicity list instead of the exact eigenvalues themselves. That is, given a graph $G$ on $n$ vertices and an ordered partition $mathbf{m}= (m_1, ldots, m_ell)$ of $n$, is there a weighted adjacency matrix where the $i$-th distinct eigenvalue has multiplicity $m_i$? This is known as the ordered multiplicity IEP-$G$. Recent work solved the ordered multiplicity IEP-$G$ for all graphs on 6 vertices. In this work, we develop zero forcing methods for the ordered multiplicity IEP-$G$ in a multitude of different contexts. Namely, we utilize zero forcing parameters on powers of graphs to achieve bounds on consecutive multiplicities. We are able to provide general bounds on sums of multiplicities of eigenvalues for graphs. This includes new bounds on the the sums of multiplicities of consecutive eigenvalues as well as more specific bounds for trees. Using these results, we verify the previous results above regarding the IEP-$G$ on six vertices. In addition, applying our techniques to skew-symmetric matrices, we are able to determine all possible ordered multiplicity lists for skew-symmetric matrices for connected graphs on five vertices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
