Results 21 to 30 of about 3,173 (190)

Recursions and divisibility properties for combinatorial Macdonald polynomials [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Combinatorics
Nicholas A. Loehr, Elizabeth Niese
doaj   +1 more source

The cluster and dual canonical bases of Z[x(11), ..., x(33)] are equal [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2010
Combinatorics
Brendon Rhoades
doaj   +1 more source

Random Horn formulas and propagation connectivity for directed hypergraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
Combinatorics
Robert H. Sloan   +2 more
doaj   +1 more source

Coloring and Guarding Arrangements [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
Combinatorics
Prosenjit Bose   +6 more
doaj   +1 more source

Counting descents, rises, and levels, with prescribed first element, in words [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
Combinatorics
Sergey Kitaev   +2 more
doaj   +1 more source

Polynomial-time normalizers [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ...
Eugene M. Luks, Takunari Miyazaki
doaj   +1 more source

Analytic combinatorics for a certain well-ordered class of iterated exponential terms [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
The aim of this paper is threefold: firstly, to explain a certain segment of ordinals in terms which are familiar to the analytic combinatorics community, secondly to state a great many of associated problems on resulting count functions and thirdly, to ...
Andreas Weiermann
doaj   +1 more source

Well quasi-order in combinatorics : embeddings and homomorphisms [PDF]

open access: yes, 2015
The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik   +5 more
core   +1 more source

On the sensitivity of cyclically-invariant Boolean functions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ...
Sourav Chakraborty
doaj   +1 more source

On the metric dimension of Grassmann graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and ...
Robert F. Bailey, Karen Meagher
doaj   +1 more source

Home - About - Disclaimer - Privacy