scholarly journals Tutte polynomials of generalized parallel connections

2004 ◽  
Vol 32 (1-2) ◽  
pp. 31-43 ◽  
Author(s):  
Joseph Bonin ◽  
Anna de Mier
2021 ◽  
Vol 181 ◽  
pp. 105414
Author(s):  
Rodica Dinu ◽  
Christopher Eur ◽  
Tim Seynnaeve
Keyword(s):  

2020 ◽  
Vol 29 (03) ◽  
pp. 2050004
Author(s):  
Hery Randriamaro

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly computed the Tutte polynomials of the hyperplane arrangements associated to the classical Weyl groups. Those associated to the exceptional Weyl groups were computed by De Concini and Procesi one year later. This paper has two objectives: On the one side, we extend the Tutte polynomial computing to the complex hyperplane arrangements. On the other side, we introduce a wider class of hyperplane arrangements which is that of the symmetric hyperplane arrangements. Computing the Tutte polynomial of a symmetric hyperplane arrangement permits us to deduce the Tutte polynomials of some hyperplane arrangements, particularly of those associated to the imprimitive reflection groups.


2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Kuei-Hsiang Chao ◽  
Bo-Jyun Liao ◽  
Chin-Pao Hung

This study employed a cerebellar model articulation controller (CMAC) neural network to conduct fault diagnoses on photovoltaic power generation systems. We composed a module array using 9 series and 2 parallel connections of SHARP NT-R5E3E 175 W photovoltaic modules. In addition, we used data that were outputted under various fault conditions as the training samples for the CMAC and used this model to conduct the module array fault diagnosis after completing the training. The results of the training process and simulations indicate that the method proposed in this study requires fewer number of training times compared to other methods. In addition to significantly increasing the accuracy rate of the fault diagnosis, this model features a short training duration because the training process only tunes the weights of the exited memory addresses. Therefore, the fault diagnosis is rapid, and the detection tolerance of the diagnosis system is enhanced.


2002 ◽  
Vol 248 (1-3) ◽  
pp. 279-282 ◽  
Author(s):  
Lorenzo Traldi
Keyword(s):  

2021 ◽  
Vol 411 ◽  
pp. 126496
Author(s):  
Tianlong Ma ◽  
Xian’an Jin ◽  
Fuji Zhang
Keyword(s):  

2017 ◽  
Vol 5 (1) ◽  
pp. 28-32
Author(s):  
Abdulgani Sahin

Abstract The Tutte polynomials for signed graphs were introduced by Kauffman. In 2012, Fath-Tabar, Gholam-Rezaeı and Ashrafı presented a formula for computing Tutte polynomial of a benzenoid chain. From this point on, we have also calculated the Tutte polynomials of signed graphs of benzenoid chains in this study.


2002 ◽  
Vol 118 (1-2) ◽  
pp. 65-83 ◽  
Author(s):  
Michael J. Falk ◽  
Nicholas J. Proudfoot
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document