Zobrazeno 1 - 10
of 183
pro vyhledávání: '"Wu, Tingzeng"'
In this paper, we first introduce a weighted derivation on algebras over an operad $\cal P$, and prove that for the free $\cal P$-algebra, its weighted derivation is determined by the restriction on the generators. As applications, we propose the con
Externí odkaz:
http://arxiv.org/abs/2406.12871
We give an affirmative answer to the open question posed in [34]: are the operated Lie polynomial identities corresponding to new operators on associative algebras in [7] Grobner-Shirshov, respectively?
Comment: 18 pages
Comment: 18 pages
Externí odkaz:
http://arxiv.org/abs/2404.13894
Autor:
Wu, Tingzeng, Bai, Yinggang
Let $G$ be a graph, and let $A(G)$ be the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\pi(G,x)=\mathrm{per}(xI-A(G))$. The permanental sum of $G$ can be defined as the sum of absolute value of coefficients of $\pi(G,x)$.
Externí odkaz:
http://arxiv.org/abs/2311.13943
Autor:
Wu Tingzeng, Zeng Xiaolin
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 1209-1225 (2024)
Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximati
Externí odkaz:
https://doaj.org/article/9afedefa8ce2407ab7a5c6dfec0659e4
Counting maximum matchings in a graph is of great interest in statistical mechanics, solid-state chemistry, theoretical computer science, mathematics, among other disciplines. However, it is a challengeable problem to explicitly determine the number
Externí odkaz:
http://arxiv.org/abs/2306.13279
In the present paper, we propose the concepts of weighted differential ($q$-tri)dendriform algebras and give some basic properties of them. The corresponding free objects are constructed, in both the commutative and noncommutative contexts.
Comm
Comm
Externí odkaz:
http://arxiv.org/abs/2305.19609
Autor:
Wu, Tingzeng, Zhou, Tian
Let $G$ be a graph with $n$ vertices, and let $L(G)$ and $Q(G)$ be the Laplacian matrix and signless Laplacian matrix of $G$, respectively. The polynomial $\pi(L(G);x)={\rm per}(xI-L(G))$ (resp. $\pi(Q(G);x)={\rm per}(xI-Q(G))$) is called {\em Laplac
Externí odkaz:
http://arxiv.org/abs/2204.07798
Publikováno v:
In Discrete Mathematics October 2024 347(10)
Autor:
Wu, Tingzeng1 (AUTHOR) baiqhmu@163.com, Bai, Yinggang1 (AUTHOR), Xu, Shoujun2 (AUTHOR) shjxu@lzu.edu.cn
Publikováno v:
Axioms (2075-1680). May2024, Vol. 13 Issue 5, p330. 13p.
Autor:
Lü, Huazhong, Wu, Tingzeng
The connectivity of a graph is an important parameter to measure its reliability. Structure and substructure connectivity, component connectivity and $k$-restricted connectivity are well-known generalizations of the concept of connectivity, which hav
Externí odkaz:
http://arxiv.org/abs/2110.05917