scholarly journals A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function

2001 ◽  
Vol 26 (2) ◽  
pp. 129-153 ◽  
Author(s):  
E. Barcucci ◽  
A. Del Lungo ◽  
A. Frosini ◽  
S. Rinaldi
10.37236/1957 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
M. D. Atkinson ◽  
M. M. Murphy ◽  
N. Ruškuc

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.


2001 ◽  
Vol 108 (7) ◽  
pp. 670
Author(s):  
Leonard Smiley ◽  
David Callan ◽  
David M. Wells ◽  
Said Amghibech

1998 ◽  
Vol 105 (10) ◽  
pp. 956
Author(s):  
Richard P. Stanley ◽  
Christophe Reutenauer ◽  
Robin J. Chapman

2019 ◽  
Vol 12 (3) ◽  
pp. 1069-1081
Author(s):  
Roberto Bagsarsa Corcino ◽  
Cristina Bordaje Corcino ◽  
Gladys Jane Rama

In this paper, some properties for Tauber's generalized Stirling and Lah numbers are obtained including other forms of recurrence relations, orthogonality and inverse relations, rational generating function and explicit formual in symmetric function form. Moreover, a new explicit formula is derived, which is analogous to the Qi formula.


2008 ◽  
Vol 45 ◽  
pp. 161-176 ◽  
Author(s):  
Eduardo D. Sontag

This paper discusses a theoretical method for the “reverse engineering” of networks based solely on steady-state (and quasi-steady-state) data.


2004 ◽  
Vol 62 (12) ◽  
pp. 1057-1063
Author(s):  
A. V. Agranovskiy ◽  
R. E. Agafonov ◽  
R. A. Khadi

Sign in / Sign up

Export Citation Format

Share Document