Results 41 to 50 of about 644,231 (86)
A technology for reverse-engineering a combinatorial problem from a rational generating function
, 2001 In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial interpretation of a positive sequence (f(n)) defined by a linear recurrence with integer coefficients.
Frosini A. +3 more
core +1 more source
Algorithmic complexity of protein identification: combinatorics of weighted strings [PDF]
, 2004 Cieliebak M, Erlebach T, Lipták Z, Stoye J, Welzl E. Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics.
Lipták, Zsuzsanna +14 more
core +1 more source
The conference GASCom brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from a ...
Ferrari, Luca, Brlek, Srečko
core +1 more source
A Partition Bijection Related to the Rogers-Selberg Identities and Gordon\u27s Theorem [PDF]
, 2008 We provide a bijective map from the partitions enumerated by the series side of the Rogers–Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon\u27s combinatorial generalization of the Rogers–Ramanujan identities.
Sills, Andrew
core
Bijective Proofs of Some n-Color Partition Identities
, 1989 Using a technique of Agarwal and Andrews (1987), bijective proofs of some n-color partition identities discovered recently by the author, are given.
A. K. Agarwal
core +1 more source
Application of graph combinatorics to rational identities of type A [PDF]
, 2008 This is the complete version of the submitted fpsac paper (2009).To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C.
Féray, Valentin, Boussicault, Adrien
core +2 more sources
Combinatorial Identities from the Spectral Theory of Quantum Graphs
, 2000 The purpose of this paper is to present a newly discovered link between three seemingly unrelated subjects—quantum graphs, the theory of random matrix ensembles and combinatorics.
Holger Schanz, Uzy Smilansky
core
On the combinatorics of polynomial generalizations of Rogers-Ramanujan-type identities
, 2015 In this paper following some ideas introduced by Andrews (Combinatorics and Ramanujan's “lost” notebook, London Mathametical Society Lecture Note Series, No. 103, Cambridge University Press, London, 1985, pp.
Santos, JPO
core +1 more source
Recent Advances in Polyhedral Combinatorics
, 2017 Combinatorial optimization searches for an optimal object in a finite collection; typically the collection has a concise representation while the number of objects is huge.
Zang, W
core