Parcourir par
Collections
Sources
Geodesic
Parcourir par
Collections
Sources
The electronic journal of combinatorics
Tome 18 (2011)
Précédent
Suivant
Sommaire du
Fascicule no. 1
On the modes of polynomials derived from nondecreasing sequences
Donna Q. J. Dou
;
Arthur L. B. Yang
Subplanes of order 3 in Hughes planes
Cafer Caliskan
;
G. Eric Moorhouse
Counting points of slope varieties over finite fields
Thomas Enkosky
Convex-ear decompositions and the flag \(h\)-vector
Jay Schweig
Generating functions attached to some infinite matrices
Paul Monsky
The number of positions starting a square in binary words
Tero Harju
;
Tomi Kärki
;
Dirk Nowotka
A bijection between atomic partitions and unsplitable partitions
William Y. C. Chen
;
Teresa X. S. Li
;
David G. L. Wang
Which chessboards have a closed knight's tour within the rectangular prism?
Joe DeMaio
;
Bindia Mathew
Cyclic sieving phenomenon in non-crossing connected graphs
Alan Guo
An entropy proof of the Kahn-Lovász theorem
Jonathan Cutler
;
A. J. Radcliffe
Graphs with four boundary vertices
Tobias Müller
;
Attila Pór
;
Jean-Sébastien Sereni
A new bound on the domination number of graphs with minimum degree two
Michael A. Henning
;
Ingo Schiermeyer
;
Anders Yeo
Asymptotic enumeration of labelled graphs by genus
Edward A. Bender
;
Zhicheng Gao
Counting connected set partitions of graphs
Frank Simon
;
Peter Tittmann
;
Martin Trinks
Note on highly connected monochromatic subgraphs in 2-colored complete graphs
Shinya Fujita
;
Colton Magnant
Weighted spanning trees on some self-similar graphs
Daniele D'Angeli
;
Alfredo Donno
Colorful paths in vertex coloring of graphs
Saieed Akbari
;
Vahid Liaghat
;
Afshin Nikzad
Promotion and evacuation on standard Young tableaux of rectangle and staircase shape
Steven Pon
;
Qiang Wang
On a generalization of Meyniel's conjecture on the Cops and Robbers game
Noga Alon
;
Abbas Mehrabian
On a conjecture concerning the Petersen graph
Donald Nelson
;
Michael D. Plummer
;
Neil Robertson
;
Xiaoya Zha
Digraphs are 2-weight choosable
Mahdad Khatirinejad
;
Reza Naserasr
;
Mike Newman
;
Ben Seamone
;
Brett Stevens
Combinatorics of the three-parameter PASEP partition function
Matthieu Josuat-Vergès
Periodic graphs
Chris Godsil
On multicolor Ramsey number of paths versus cycles
Gholam Reza Omidi
;
Ghaffar Raeisi
Pattern avoidance in partial permutations
Anders Claesson
;
Vít Jelínek
;
Eva Jelínková
;
Sergey Kitaev
More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures
Sebastian M. Cioabă
;
Michael Tait
Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
Yi Zhao
A combinatorial formula for orthogonal idempotents in the 0-Hecke algebra of the symmetric group.
Tom Denton
A generalization of some Huang-Johnson semifields
N. L. Johnson
;
Giuseppe Marino
;
Olga Polverino
;
Rocco Trombetti
The number of \(F\)-matchings in almost every tree is a zero residue
Noga Alon
;
Simi Haber
;
Michael Krivelevich
A quasisymmetric function generalization of the chromatic symmetric function
Brandon Humpert
GBRDs with block size three over 2-groups, semi-dihedral groups and nilpotent groups
R. Julian R. Abel
;
Diana Combe
;
Adrian M. Nelson
;
William D. Palmer
The inverse problem associated to the Davenport constant for \(C_2 \oplus C_2 \oplus C_{2n}\), and applications to the arithmetical characterization of class groups
Wolfgang A. Schmid
On optimal linear codes over \(\mathbb F_8\)
Rie Kanazawa
;
Tatsuya Maruta
Improved upper bounds for the Laplacian spectral radius of a graph
Tianfei Wang
;
Jin Yang
;
Bin Li
Sharp threshold functions for random intersection graphs via a coupling method
Katarzyna Rybarczyk
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
Tanya Khovanova
;
Joel Brewster Lewis
Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
Cheng Yeaw Ku
;
Kok Bin Wong
Independence complexes and edge covering complexes via Alexander duality
Kazuhiro Kawamura
On generalized Dyck paths
Josef Rukavicka
Counting \(k\)-marked Durfee symbols
Kağan Kurşungöz
The disjoint \(m\)-flower intersection problem for Latin squares
James G. Lefevre
;
Thomas A. McCourt
Hyperbolicity and chordality of a graph
Yaokun Wu
;
Chengpeng Zhang
Composition matrices, \((2+2)\)-free posets and their specializations
Mark Dukes
;
Vít Jelínek
;
Martina Kubitzke
Hurwitz equivalence in dihedral groups.
Emily Berger
A multipartite version of the Turan problem - density conditions and eigenvalues
Zoltán Lóránt Nagy
Lattice path proofs of extended Bressoud-Wei and Koike skew Schur function identities
A. M. Hamel
;
R. C. King
Loose Hamilton cycles in random uniform hypergraphs
Andrzej Dudek
;
Alan Frieze
The complexity of obtaining a distance-balanced graph
Sergio Cabello
;
Primož Lukšič
Distinguishing maps
Thomas W. Tucker
The bipartite Ramsey numbers
Zhang Rui
;
Sun Yongqi
Graph products and new solutions to Oberwolfach problems
Gloria Rinaldi
;
Tommaso Traetta
Partitioning 3-colored complete graphs into three monochromatic cycles
András Gyárfás
;
Miklós Ruszinkó
;
Gábor N. Sárközy
;
Endre Szemerédi
Generalized Bell polynomials and the combinatorics of Poisson central moments
Nicolas Privault
The Fibonacci dimension of a graph
Sergio Cabello
;
David Eppstein
;
Sandi Klavžar
On a conjecture of Frankl and Füredi
Ameera Chowdhury
Enumeration of pin-permutations
Frédérique Bassino
;
Mathilde Bouvel
;
Dominique Rossin
Ramanujan type congruences for a partition function
Haijian Zhao
;
Zheyuan Zhong
Sets of integers that do not contain long arithmetic progressions
Kevin O'Bryant
Hybrid proofs of the \(q\)-binomial theorem and other identities
Dennis Eichhorn
;
James McLaughlin
;
Andrew V. Sills
Self-dual planar hypergraphs and exact bond percolation thresholds
John C. Wierman
;
Robert M. Ziff
Perfect matchings in claw-free cubic graphs
Sang-il Oum
Hamiltonicity of \(k\)-traceable graphs
Frank Bullock
;
Peter Dankelmann
;
Marietjie Frick
;
Michael A. Henning
;
Ortrud R. Oellermann
;
Susan van Aardt
Lower bounds on van der Waerden numbers: randomized- and deterministic-constructive
William Gasarch
;
Bernhard Haeupler
Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
Uwe Schauz
Sweeping the cd-index and the toric \(h\)-vector
Carl W. Lee
Further hopping with toads and frogs
Thotsaporn "Aek" Thanatipanonda
On the automorphism group of integral circulant graphs
Milan Bašić
;
Aleksandar Ilić
Orthogonal arrays with parameters OA and 3-dimensional projective geometries
Kazuaki Ishii
Counting triangulations of planar point sets
Micha Sharir
;
Adam Sheffer
Nonexistence of graphs with cyclic defect
Mirka Miller
On the Chvàtal-Erdős triangle game
József Balogh
;
Wojciech Samotij
Unimodality problems of multinomial coefficients and symmetric functions
Xun-Tuan Su
;
Yi Wang
;
Yeong-Nan Yeh
General results on the enumeration of strings in Dyck paths
K. Manes
;
A. Sapounakis
;
I. Tasoulas
;
P. Tsikouras
Strongly cancellative and recovering sets on lattices
Hoda Bidkhori
;
ShinnYih Huang
Product and puzzle formulae for \(GL_n\) Belkale-Kumar coefficients
Allen Knutson
;
Kevin Purbhoo
On a new family of generalized Stirling and Bell numbers
Toufik Mansour
;
Matthias Schork
;
Mark Shattuck
A \(q\)-analogue of some binomial coefficient identities of Y. Sun
Victor J. W. Guo
;
Dan-Mei Yang
Unimodal rays in the regular and generalized Pascal pyramids
Hacène Belbachir
;
László Szalay
Complete and almost complete minors in double-critical 8-chromatic graphs
Anders Sune Pedersen
The tau constant of a metrized graph and its behavior under graph operations
Zubeyir Cinkir
Alspach's problem: The case of Hamilton cycles and 5-cycles
Heather Jordon
Two statistics linking Dyck paths and non-crossing partitions
Haijian Zhao
;
Zheyuan Zhong
A survey of binary covering arrays
Jim Lawrence
;
Raghu N. Kacker
;
Yu Lei
;
D. Richard Kuhn
;
Michael Forbes
On cubic planar hypohamiltonian and hypotraceable graphs
Makoto Araya
;
Gábor Wiener
Rainbow paths with prescribed ends
Meysam Alishahi
;
Ali Taherkhani
;
Carsten Thomassen
A census of vertices by generations in regular tessellations of the plane
Alice Paul
;
Nicholas Pippenger
Growth of graph powers
A. Pokrovskiy
Integral quartic Cayley graphs on Abelian groups
A. Abdollahi
;
E. Vatandoost
The Ramsey number
Luis Boza
A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points
Weiwen Gu
Exterior pairs and up step statistics on Dyck paths
Sen-Peng Eu
;
Tung-Shan Fu
Extensions of toric varieties
Mesut Şahin
Integral Cayley graphs defined by greatest common divisors
Walter Klotz
;
Torsten Sander
Minimal weight in union-closed families
Victor Falgas-Ravry
On variants of Conway and Conolly's meta-Fibonacci recursions
Abraham Isgur
;
Mustazee Rahman
Two characterizations of hypercubes
Juhani Nieminen
;
Matti Peltola
;
Pasi Ruotsalainen
Counting the number of elements in the mutation classes of \(A_n\)-quivers
Janine Bastian
;
Thomas Prellberg
;
Martin Rubey
;
Christian Stump
Embedding a forest in a graph
Mark K. Goldberg
;
Malik Magdon-Ismail
Vertex-transitive \(q\)-complementary uniform hypergraphs
Shonda Gosselin
The weighted hook length formula. III: Shifted tableaux
Matjaž Konvalinka
Quantum field theory over \(\mathbb F_q\)
Oliver Schnetz
Commuting involution graphs for 3-dimensional unitary groups
Alistaire Everett
Chung-Feller property in view of generating functions
Shu-Chung Liu
;
Yi Wang
;
Yeong-Nan Yeh
Explicit Cayley covers of Kautz digraphs
Josep M. Brunat
Characterizations of transversal and fundamental transversal matroids
Joseph E. Bonin
;
Joseph P. S. Kung
;
Anna de Mier
Reduced decompositions of matchings
Lun Lv
;
Sabrina X. M. Pang
On \((\delta, \chi)\)-bounded families of graphs
András Gyárfás
;
Manouchehr Zaker
Monomer-dimer tatami tilings of rectangular regions
Alejandro Erickson
;
Frank Ruskey
;
Jennifer Woodcock
;
Mark Schurch
On vertex, edge, and vertex-edge random graphs
Elizabeth Beer
;
James Allen Fill
;
Svante Janson
;
Edward R. Scheinerman
Permutation tableaux and the dashed permutation pattern 32-1
William Y.C. Chen
;
Lewis H. Liu
Total weight choosability of graphs
Jakub Przybyło
;
Mariusz Woźniak
An extension of matroid rank submodularity and the \(Z\)-Rayleigh property
Arun P. Mani
The wildcard set's size in the density Hales-Jewett theorem
Randall McCutcheon
Stability analysis for \(k\)-wise intersecting families
Vikram Kamat
Adaptive identification in Torii in the King lattice
Yael Ben-Haim
;
Sylvain Gravier
;
Antoine Lobstein
;
Julien Moncel
On the size of dissociated bases
Vsevolod F. Lev
;
Raphael Yuster
Independence complexes of stable Kneser graphs
Benjamin Braun
Rotary polygons in configurations
Marko Boben
;
Štefko Miklavič
;
Primož Potočnik
Blocking Wythoff Nim
Urban Larsson
Equitable hypergraph orientations
Yair Caro
;
Douglas West
;
Raphael Yuster
Acyclic sets in \(k\)-majority tournaments
Kevin G. Milans
;
Daniel H. Schreiber
;
Douglas B. West
The quantifier semigroup for bipartite graphs
Leonard J. Schulman
A note on the critical group of a line graph
David Perkinson
;
Nick Salter
;
Tianyuan Xu
Critical exponents of words over 3 letters
Elise Vaslet
Minimum weight \(H\)-decompositions of graphs: the bipartite case
Teresa Sousa
Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
László Lovász
Partition statistics for cubic partition pairs
Byungchan Kim
Identities derived from noncrossing partitions of type \(B\)
William Y. C. Chen
;
Andrew Y. Z. Wang
;
Alina F. Y. Zhao
Double-dimer pairings and skew Young diagrams
Richard W. Kenyon
;
David B. Wilson
Enumeration of Varlet and Comer hypergroups.
H. Aghabozorgi
;
M. Jafarpour
;
B. Davvaz
Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs
Heidi Gebauer
On the number of subsequences with a given sum in a finite abelian group
Gerard Jennhwa Chang
;
Sheng-Hua Chen
;
Yongke Qu
;
Guoqing Wang
;
Haiyan Zhang
Further applications of a power series method for pattern avoidance
Narad Rampersad
Relating different cycle spaces of the same infinite graph
R. Bruce Richter
;
Brendan Rooney
On-line Ramsey theory for bounded degree graphs
Jane Butterfield
;
Tracy Grauman
;
William B. Kinnersley
;
Kevin G. Milans
;
Christopher Stocker
;
Douglas B. West
On the area discrepancy of triangulations of squares and trapezoids
Bernd Schulze
Counting bordered partial words by critical positions
Emily Allen
;
F. Blanchet-Sadri
;
Cameron Byrum
;
Mihai Cucuringu
;
Robert Mercaş
Uniqueness of graph square roots of girth six
Anna Adamaszek
;
Michał Adamaszek
Mr. Paint and Mrs. Correct go fractional
Grzegorz Gutowski
Computing the domination number of grid graphs
Samu Alanko
;
Simon Crevals
;
Anton Isopoussu
;
Patric Östergård
;
Ville Pettersson
A note on naturally embedded ternary trees
Markus Kuba
Counting words by number of occurrences of some patterns
Zhicheng Gao
;
Andrew MacFie
;
Daniel Panario
Winning strong games through fast strategies for weak games
Asaf Ferber
;
Dan Hefetz
A strengthening of Brooks' Theorem for line graphs
Landon Rabern
The Möbius function of the consecutive pattern poset
Antonio Bernini
;
Luca Ferrari
;
Einar Steingrímsson
Exponential triples
Alessandro Sisto
Toughness of \(K_{a,t}\)-minor-free graphs
Guantao Chen
;
Yoshimi Egawa
;
Ken-ichi Kawarabayashi
;
Bojan Mohar
;
Katsuhiro Ota
Long path lemma concerning connectivity and independence number
Shinya Fujita
;
Alexander Halperin
;
Colton Magnant
Independence number and disjoint theta graphs
Shinya Fujita
;
Colton Magnant
Chromatic roots of a ring of four cliques
F. M. Dong
;
Gordon Royle
;
Dave Wagner
Chromatic statistics for triangulations and Fuß-Catalan complexes
R. Bacher
;
C. Krattenthaler
The \(t\)-pebbling number is eventually linear in \(t\)
Michael Hoffmann
;
Jiří Matoušek
;
Yoshio Okamoto
;
Philipp Zumstein
On some Ramsey numbers for quadrilaterals
Janusz Dybizbański
;
Tomasz Dzido
On Han's hook length formulas for trees
William Y.C. Chen
;
Oliver X.Q. Gao
;
Peter L. Guo
Characteristic polynomials of skew-adjacency matrices of oriented graphs
Yaoping Hou
;
Tiangang Lei
A note on the speed of hereditary graph properties
Vadim V. Lozin
;
Colin Mayhill
;
Victor Zamaraev
\(q,t\)-Catalan numbers and generators for the radical ideal defining the diagonal locus of \((\mathbb C^2)^n\)
Kyungyong Lee
;
Li Li
A note on obstructions to clustered planarity
Jamie Sneddon
;
Paul Bonnington
On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
Jacob A. White
List-distinguishing colorings of graphs
Michael Ferrara
;
Breeann Flesch
;
Ellen Gethner
Rainbow matchings in properly edge colored graphs
Guanghui Wang
On the path-avoidance vertex-coloring game
Torsten Mütze
;
Reto Spöhel
Isoperimetric numbers of regular graphs of high degree with applications to arithmetic Riemann surfaces
Dominic Lanphier
;
Jason Rosenhouse
Quantum walks on regular graphs and eigenvalues
Chris Godsil
;
Krystal Guo
A recurrence for bounds on dominating sets in \(k\)-majority tournaments
Dror Fidler
Vertex subsets with minimal width and dual width in \(Q\)-polynomial distance-regular graphs
Hajime Tanaka
No dense subgraphs appear in the triangle-free graph process
Stefanie Gerke
;
Tamás Makai
Extremal problems for independent set enumeration
Jonathan Cutler
;
A. J. Radcliffe
Linear recurrence relations for sums of products of two terms
Yan-Ping Mu
The pentagram integrals on inscribed polygons
Richard Evan Schwartz
;
Serge Tabachnikov
A differential approach for bounding the index of graphs under perturbations
C. Dalfó
;
M. A. Fiol
;
E. Garriga
Trees with an on-line degree Ramsey number of four
David Rolnick
The complete \(\mathbf{cd}\)-index of dihedral and universal Coxeter groups
Saúl A. Blanco
Omittable planes
Branko Grünbaum
;
Jonathan Lenchner
Quantum \(A_r\,Q\)-system solutions as q-multinomial series
Philippe Di Francesco
A short approach to Catalan numbers modulo \(2^r\)
Guoce Xin
;
Jing-Feng Xu
Classical sequences revisited with permutations avoiding dotted pattern
Jean-Luc Baril
Cyclic and dihedral 1-factorizations of multipartite graphs
Mathieu Bogaerts
;
Giuseppe Mazzuoccolo
Graphs with equal independence and annihilation numbers
C. E. Larson
;
R. Pepper
Domino shuffling on Novak half-hexagons and Aztec half-diamonds
Eric Nordenstam
;
Benjamin Young
Applications of the Kelmans transformation: extremality of the threshold graphs
Péter Csikvári
The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth
Ke Li
;
Ligong Wang
;
Guopeng Zhao
Some results for the periodicity and perfect state transfer
Jiang Zhou
;
Changjiang Bu
;
Jihong Shen
The odd and even intersection properties
Victor Scharaschkin
Arbitrary orientations of Hamilton cycles in oriented graphs
Luke Kelly
Eulerian-Catalan numbers
Hoda Bidkhori
;
Seth Sullivant
Labeled trees, functions, and an algebraic identity
Stephan Wagner
An inductive construction for Hamilton cycles in Kneser graphs
J. Robert Johnson
A construction for biembeddings of Latin squares
M. J. Grannell
;
M. Knor
Spherical Venn diagrams with involutory isometries
Frank Ruskey
;
Mark Weston
The guessing number of undirected graphs
Demetres Christofides
;
Klas Markström
Connected, bounded degree, triangle avoidance games
Nishali Mehta
;
Ákos Seress
The maximum independent sets of de Bruijn graphs of diameter 3
Dustin A. Cartwright
;
María Angélica Cueto
;
Enrique A. Tobis
Strengthened Brooks' theorem for digraphs of girth at least three
Ararat Harutyunyan
;
Bojan Mohar
Finite groups of derangements on the \(n\)-Cube II
Larry Cusick
;
Oscar Vega
Posets from admissible Coxeter sequences.
Matthew Macauley
;
Henning S. Mortveit
Automorphism group of the derangement graph
Yun-Ping Deng
;
Xiao-Dong Zhang
How many faces can the polycubes of lattice tilings by translation of \(\mathbb R^3\) have?
I. Gambini
;
L. Vuillon
Symmetric distribution of crossings and nestings in permutations of type \(B\)
Adel Hamdi
On the Orchard crossing number of the complete bipartite graphs
Elie Feder
;
David Garber
A new upper bound on the global defensive alliance number in trees
Xue-gang Chen
;
Wai Chee Shiu
Hamiltonian cycles in the square of a graph
Jan Ekstein
Burnside-Brauer theorem for table algebras.
J. Bagherian
;
A. Rahnamai Barghi
On \((C_n;k)\) stable graphs
Sylwia Cichacz
;
Agnieszka Görlich
;
Magorzata Zwonek
;
Andrzej Żak
Limit theorems for the number of parts in a random weighted partition
Ljuben Mutafchiev
A restricted version of Wythoff's game
Wen An Liu
;
Haifeng Li
;
Bei Li
Chordal and sequentially Cohen-Macaulay clutters
Russ Woodroofe
Nonrepetitive sequences on arithmetic progressions
Jarosław Grytczuk
;
Jakub Kozik
;
Marcin Witkowski
On the hyperbolicity constant of line graphs
Walter Carballosa
;
José M. Rodríguez
;
José M. Sigarreta
;
María Villeta
Binomial edge ideals with quadratic Gröbner bases
Marilena Crupi
;
Giancarlo Rinaldo
Genus distributions of 4-regular outerplanar graphs
Mehvish I. Poshni
;
Imran F. Khan
;
Jonathan L. Gross
Distinct triangle areas in a planar point set over finite fields
Le Anh Vinh
Minimum light numbers in the \(\sigma \)-game and lit-only \(\sigma \)-game on unicyclic and grid graphs
John Goldwasser
;
Xinmao Wang
;
Yaokun Wu
On the spectra of general random graphs
Fan Chung
;
Mary Radcliffe
Dot product representations of planar graphs
Ross J. Kang
;
László Lovász
;
Tobias Müller
;
Edward R. Scheinerman
On a conjecture of G. Malle and G. Navarro on nilpotent blocks.
Jean-Baptiste Gramain
A note on path factors of (3,4)-biregular bipartite graphs
Carl Johan Casselgren
Asymptotic behaviour of the number of Eulerian circuits
Mikhail Isaev
An Erdős-Ko-Rado theorem for multisets
Karen Meagher
;
Alison Purdy
Equitable partitions to spanning trees in a graph
Zsolt Fekete
;
Jácint Szabó
Sort-invariant non-messing-up
Bridget Eileen Tenner
On points drawn from a circle
Vincent Vatter
;
Steve Waton
Rotor-router aggregation on the comb
Wilfried Huss
;
Ecaterina Sava
Invariant relations and Aschbacher classes of finite linear groups.
Jing Xu
;
Michael Giudici
;
Cai Heng Li
;
Cheryl E. Praeger
Pattern avoidance in ascent sequences
Paul Duncan
;
Einar Steingrímsson
A Ramsey theorem for indecomposable matchings
James P. Fairbanks
Average values of some Z-parameters in a random set partition
Anisse Kasraoui
On the unitary Cayley signed graphs
Deepa Sinha
;
Pravin Garg
Genetic algorithms applied to problems of forbidden configurations
R. P. Anstee
;
Miguel Raggi
A construction of cospectral graphs for the normalized Laplacian
Steve Butler
;
Jason Grout
Disproof of the list Hadwiger conjecture
János Barát
;
Gwenaël Joret
;
David R. Wood
Pentavalent symmetric graphs of order 12\(p\)
Song-Tao Guo
;
Jin-Xin Zhou
;
Yan-Quan Feng
A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
Catherine Greenhill
Part-products of 1-free integer compositions
Caroline Shapcott
Convergence rates for generalized descents
John Pike
Intersecting families in a subset of Boolean lattices
Jun Wang
;
Huajun Zhang
Sommaire du
Fascicule no. 2
The Zeilberger Festschrift volume
Arithmetic properties of plane partitions
Tewodros Amdeberhan
;
Victor H. Moll
On Kadell's two conjectures for the \(q\)-Dyson product
Yue Zhou
Partitions, rooks, and symmetric functions in noncommuting variables
Mahir Bilen Can
;
Bruce E. Sagan
The degree of a \(q\)-holonomic sequence is a quadratic quasi-polynomial
Stavros Garoufalidis
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
Petter Brändén
;
Anders Claesson
Concave compositions
George E. Andrews
The \((t,q)\)-analogs of secant and tangent numbers
Dominique Foata
;
Guo-Niu Han
Linear recurrences and asymptotic behavior of exponential sums of symmetric Boolean functions
Francis N. Castro
;
Luis A. Medina
Using homological duality in consecutive pattern avoidance
Anton Khoroshkin
;
Boris Shapiro
On Rowland's sequence
Fernando Chamizo
;
Dulcinea Raboso
;
Serafín Ruiz-Cabello
On Zeilberger's constant term for Andrew's TSSCPP theorem
Guoce Xin
The combinatorialization of linear recurrences
Arthur T. Benjamin
;
Halcyon Derks
;
Jennifer J. Quinn
In praise of an elementary identity of Euler
Gaurav Bhatnagar
Combinatorial and automated proofs of certain identities
Justin Brereton
;
Amelia Farid
;
Maryam Karnib
;
Gary Marple
;
Alex Quenon
;
Akalu Tefera
Polynomial generalizations of two-variable Ramanujan type identities
James McLaughlin
;
Andrew V. Sills
Two remarks on skew tableaux
Richard P. Stanley
The Abel-Zeilberger algorithm
William Y.C. Chen
;
Qing-Hu Hou
;
Hai-Tao Jin
Continued fractions related to \((t,q)\)-tangents and variants
Helmut Prodinger
Aperiodic subtraction games
Aviezri S. Fraenkel
Enumeration of standard Young tableaux of certain truncated shapes
Ron M. Adin
;
Ronald C. King
;
Yuval Roichman
A short proof for the number of permutations containing pattern 321 exactly once
Alexander Burstein
Christoffel words and the Calkin-Wilf tree
Alessandro De Luca
;
Christophe Reutenauer
The distribution of run lengths in integer compositions
Herbert S. Wilf
Alternating sign matrices and polynomiography
Bahman Kalantari
Minimal overlapping patterns in colored permutations
Adrian Duane
;
Jeffrey Remmel
Monotone triangles and 312 pattern avoidance
Arvind Ayyer
;
Robert Cori
;
Dominique Gouyou-Beauchamps
Toward a combinatorial proof of the Jacobian conjecture!
Dan Singer
Pattern avoidance by even permutations
Andrew Baxter
;
Aaron D. Jaggard
Fixed points and excedances in restricted permutations
Sergi Elizalde
On the zeros of plane partition polynomials
Robert P. Boyer
;
Daniel T. Parry
The number of intervals in the \(m\)-Tamari lattices
Mireille Bousquet-Mélou
;
Éric Fusy
;
Louis-François Préville-Ratelle
Reducibility and solvability of some classes of Kryuchkov binary tree pairs
Maria Madonia
;
Giuseppe Scollo
The double Riordan group
Dennis E. Davenport
;
Louis W. Shapiro
;
Leon C. Woodson
Pattern-avoiding set partitions and Catalan numbers
Toufik Mansour
;
Mark Shattuck
Bivariate identities for values of the Hurwitz zeta function and supercongruences
Kh. Hessami Pilehrood
;
T. Hessami Pilehrood
Andrews conjecture on a \(_4\phi_3\) summation and its extensions
Yan-Ping Mu
A method for determining the mod-\(2^k\) behaviour of recursive sequences, with applications to subgroup counting
M. Kauers
;
C. Krattenthaler
;
T. W. Müller