Results 21 to 30 of about 15,581 (265)
图的Aα-特征多项式系数的一个注记(A note on the coefficients of the Aα-characteristic polynomial of a graph)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a graph on n vertices, and let A( G ) and D ( G ) denote the adjacency matrix and the degree matrix of G, respectively. Define Aα ( G )= αD ( G )+( 1 - α ) A( G ) for any real α ∈ [ 0,1 ].
LIUShunyi,(柳顺义) +1 more
doaj +1 more source
Journal of Mathematics, 2020 The goal of this paper is to derive some new variants of Simpson’s inequality using the class of n-polynomial convex functions of higher order. To obtain the main results of the paper, we first derive a new generalized fractional integral identity ...
Yu-Ming Chu +3 more
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
Determinants as Combinatorial Summation Formulas over an Algebra with a Unique $n$-ary Operation
Известия Иркутского государственного университета: Серия "Математика", 2018 Since the late 1980s the author has published a number of results on matrix functions, which were obtained using the generating functions, mixed discriminants (mixed volumes in $\mathbb R^n$), and the well-known polarization theorem (the most general ...
G.P. Egorychev
doaj +1 more source
Minimisation of Multiplicity Tree Automata [PDF]
Logical Methods in Computer Science, 2017 We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic.
Stefan Kiefer +2 more
doaj +1 more source
Identities for the Generalized Fibonacci Polynomial
Integers, 2017 See the abstract in the attached pdf.
Rigoberto Flórez +2 more
openaire +5 more sources
Some Polynomial Sequence Relations
Mathematics, 2019 We give some polynomial sequence relations that are generalizations of the Sury-type identities. We provide two proofs, one based on an elementary identity and the other using the method of generating functions.
Chan-Liang Chung
doaj +1 more source
Applications of q-difference equation and homogeneous q-shift operator rΦs(Dxy) in q-polynomials
Partial Differential Equations in Applied Mathematics, 2023 In this paper, the generalized homogeneous q-shift operator is constructed. The q-difference equation is then utilized to construct numerous polynomial q-identities, such as the generating function and its extension, Rogers’ formula and its extension ...
Samaher A. Abdul-Ghani, Husam L. Saad
doaj +1 more source
On the Complexity of Equivalence and Minimisation for Q-weighted Automata [PDF]
Logical Methods in Computer Science, 2013 This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers.
Stefan Kiefer +4 more
doaj +1 more source
Polynomial identities for partitions
European Journal of Combinatorics, 1992 Set \(P_ 1(q)=1-q\) and \(P_ k(q)=\sum_{d\mid k}\mu(k/d)\) for \(k>1\). For every integer \(m>1\) define \[ P^ +_{k,m}(q)=P_ k(q)(P_ k(q)+k)(P_ k(q)+2k)\cdots(P_ k(q)+(m-1)k), \] \[ P^ -_{k,m}(q)=P_ k(q)(P_ k(q)-k)(P_ k(q)-2k)\cdots(P_ k(q)-(m-1)k); \] and set \(P^ +_{k,0}(q)=P^ -_{k,0}(q)=1\).
openaire +1 more source