Results 51 to 60 of about 10,069,733 (332)
A quadratic Poisson Gel'fand-Kirillov problem in prime characteristic [PDF]
, 2015 The quadratic Poisson Gel’fand-Kirillov problem asks whether the field of fractions of a Poisson algebra is Poisson birationally equivalent to a Poisson affine space, i.e. to a polyno-mial algebra K[X1,..., Xn] with Poisson bracket defined by {Xi, Xj} =
Lecoutre, Cesar +3 more
core +1 more source
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2020 Complex eigenvalue analysis has generally been applied to squeal improvement of automotive brake systems in recent years. Discrimination of the occurrence of unstable vibration by modal coupling has become common in brake design.
Hayuru INOUE, Takayoshi KAMADA
doaj +1 more source
Gridding discretization-based multiple stability switching delay search algorithm: The movement of a human being on a controlled swaying bow. [PDF]
PLoS ONE, 2017 Delay represents a significant phenomenon in the dynamics of many human-related systems-including biological ones. It has i.a. a decisive impact on system stability, and the study of this influence is often mathematically demanding. This paper presents a
Libor Pekař +2 more
doaj +1 more source
图的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
New polynomial-based molecular descriptors with low degeneracy. [PDF]
PLoS ONE, 2010 In this paper, we introduce a novel graph polynomial called the 'information polynomial' of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set.
Matthias Dehmer +2 more
doaj +1 more source
Characteristic Polynomial and Eigenproblem of Triangular Matrix over Interval Min-Plus Algebra
JTAM (Jurnal Teori dan Aplikasi Matematika)A min-plus algebra is a linear algebra over the semiring R_ε', equipped with the operations “"⊕'=min" ” and “⊗=+”. In min-plus algebra, there is the concept of characteristic polynomial obtained from permanent of matrix.
Anita Dwi Rahmawati +2 more
doaj +1 more source
ON ANTIADJACENCY MATRIX OF A DIGRAPH WITH DIRECTED DIGON(S)
Barekeng, 2022 The antiadjacency matrix is one representation matrix of a digraph. In this paper, we find the determinant and the characteristic polynomial of the antiadjacency matrix of a digraph with directed digon(s).
Muhammad Irfan Arsyad Prayitno +1 more
doaj +1 more source
Efficient computation of the characteristic polynomial of a threshold graph [PDF]
Theoretical Computer Science, 2015 An efficient algorithm is presented to compute the characteristic polynomial of a threshold graph. Threshold graphs were introduced by Chvatal and Hammer, as well as by Henderson and Zalcstein in 1977.
Martin Fürer
semanticscholar +1 more source
Generalised characteristic polynomials
Journal of Symbolic Computation, 1989 This paper is devoted to the extension of the classical elimination by resultant between two polynomials in one variable to the case of n polynomials in m variables with the coefficients in a field K. The key tool of the author's construction is the introduction of the generalized characteristic polynomial of the polynomials \(f_ 1,...,f_ n\).
openaire +1 more source
On the characteristic polynomial of sl(2,F)
Linear Algebra and its Applications, 2019 We prove Hu-Zhang's conjecture stated in [5] that the characteristic polynomial of a finite dimensional irreducible representation of sl ( 2 , F ) can be explicitly expressed as a product of some irreducible polynomials.
Zhiqi Chen, Xueqing Chen, Mingda Ding
semanticscholar +1 more source