rational generating function
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

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.


2015 ◽  
Vol 80 (2) ◽  
pp. 433-449 ◽  
Author(s):  
KEVIN WOODS

AbstractPresburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be represented by rational generating functions; a geometric characterization of such sets is also given. In addition, ifp= (p1, . . . ,pn) are a subset of the free variables in a Presburger formula, we can define a counting functiong(p) to be the number of solutions to the formula, for a givenp. We show that every counting function obtained in this way may be represented as, equivalently, either a piecewise quasi-polynomial or a rational generating function. Finally, we translate known computational complexity results into this setting and discuss open directions.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Velleda Baldoni ◽  
Nicole Berline ◽  
Brandon Dutra ◽  
Matthias Köppe ◽  
Michele Vergne ◽  
...  

International audience For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2 x_2+ \ldots+ \alpha_Nx_N+ \alpha_{N+1}x_{N+1}=t$, where the right-hand side $t$ is a varying nonnegative integer. It is well-known that $E(\alpha)(t)$ is a quasipolynomial function of $t$ of degree $N$. In combinatorial number theory this function is known as the $\textit{denumerant}$. Our main result is a new algorithm that, for every fixed number $k$, computes in polynomial time the highest $k+1$ coefficients of the quasi-polynomial $E(\alpha)(t)$ as step polynomials of $t$. Our algorithm is a consequence of a nice poset structure on the poles of the associated rational generating function for $E(\alpha)(t)$ and the geometric reinterpretation of some rational generating functions in terms of lattice points in polyhedral cones. Experiments using a $\texttt{MAPLE}$ implementation will be posted separately. Considérons une liste $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ de $N+1$ entiers positifs. Le dénumérant $E(\alpha)(t)$ est lafonction qui compte le nombre de solutions en entiers positifs ou nuls de l’équation $\sum^{N+1}_{i=1}x_i\alpha_i=t$, où $t$ varie dans les entiers positifs ou nuls. Il est bien connu que cette fonction est une fonction quasi-polynomiale de $t$, de degré $N$. Nous donnons un nouvel algorithme qui calcule, pour chaque entier fixé $k$ (mais $N$ n’est pas fixé, les $k+1$ plus hauts coefficients du quasi-polynôme $E(\alpha)(t)$ en termes de fonctions en dents de scie. Notre algorithme utilise la structure d’ensemble partiellement ordonné des pôles de la fonction génératrice de $E(\alpha)(t)$. Les $k+1$ plus hauts coefficients se calculent à l’aide de fonctions génératrices de points entiers dans des cônes polyèdraux de dimension inférieure ou égale à $k$.


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

Sign in / Sign up

Export Citation Format

Share Document