Skip header Section
Skip Bibliometrics Section
Enumerative combinatoricsJune 1986
- Author:
- R P Stanley
Abstract
No abstract available.
Cited By
- Chouraqui F An Approach to the Herzog-Schönheim Conjecture Using Automata Developments in Language Theory, (55-68)
- Hibi T, Higashitani A, Tsuchiya A and Yoshida K (2019). Ehrhart Polynomials with Negative Coefficients, Graphs and Combinatorics, 35:1, (363-371), Online publication date: 1-Jan-2019.
- Heinrich I and Tittmann P (2018). Neighborhood and Domination Polynomials of Graphs, Graphs and Combinatorics, 34:6, (1203-1216), Online publication date: 1-Nov-2018.
- Jiménez-Pastor A and Pillwein V Algorithmic Arithmetics with DD-Finite Functions Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, (231-237)
- Caselli F and Marietti M (2017). Special matchings in Coxeter groups, European Journal of Combinatorics, 61:C, (151-166), Online publication date: 1-Mar-2017.
- (2017). On prefix normal words and prefix normal forms, Theoretical Computer Science, 659:C, (1-13), Online publication date: 10-Jan-2017.
- Hansson M (2016). The Bruhat order on conjugation-invariant sets of involutions in the symmetric group, Journal of Algebraic Combinatorics: An International Journal, 44:4, (849-862), Online publication date: 1-Dec-2016.
- Tsuchiya A (2016). The ź -vectors of reflexive polytopes and of the dual polytopes, Discrete Mathematics, 339:10, (2450-2456), Online publication date: 6-Oct-2016.
- Björklund A, Husfeldt T, Kaski P, Koivisto M, Nederlof J and Parviainen P (2015). Fast Zeta Transforms for Lattices with Few Irreducibles, ACM Transactions on Algorithms, 12:1, (1-19), Online publication date: 8-Feb-2016.
- Bruhn H and Schaudt O (2015). The Journey of the Union-Closed Sets Conjecture, Graphs and Combinatorics, 31:6, (2043-2074), Online publication date: 1-Nov-2015.
- Tarau P On a uniform representation of combinators, arithmetic, lambda terms and types Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, (244-255)
- Tarau P Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices Proceedings of the International Conference on Intelligent Computer Mathematics - Volume 9150, (118-133)
- Bruns W and Söger C (2015). The computation of generalized Ehrhart series in Normaliz, Journal of Symbolic Computation, 68:P2, (75-86), Online publication date: 1-May-2015.
- Tarau P Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, (31-42)
- Wood J (2014). Relative one-weight linear codes, Designs, Codes and Cryptography, 72:2, (331-344), Online publication date: 1-Aug-2014.
- Kauers M Bounds for D-finite closure properties Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, (288-295)
- Clauss P Counting solutions to linear and nonlinear constraints through Ehrhart polynomials ACM International Conference on Supercomputing 25th Anniversary Volume, (237-244)
- Ayyer A, Klee S and Schilling A (2014). Combinatorial Markov chains on linear extensions, Journal of Algebraic Combinatorics: An International Journal, 39:4, (853-881), Online publication date: 1-Jun-2014.
- Zhang H, Yang D and Yao H (2014). Decomposition theorem on matchable distributive lattices, Discrete Applied Mathematics, 166:C, (239-248), Online publication date: 31-Mar-2014.
- Tarau P Computing with Catalan Families Proceedings of the 8th International Conference on Language and Automata Theory and Applications - Volume 8370, (565-575)
- Beck M, Bliem T, Braun B and Savage C (2013). Lattice point generating functions and symmetric cones, Journal of Algebraic Combinatorics: An International Journal, 38:3, (543-566), Online publication date: 1-Nov-2013.
- FéRay V and Goulden I (2013). A multivariate hook formula for labelled trees, Journal of Combinatorial Theory Series A, 120:4, (944-959), Online publication date: 1-May-2013.
- Anderson L and Delucchi E (2012). Foundations for a Theory of Complex Matroids, Discrete & Computational Geometry, 48:4, (807-846), Online publication date: 1-Dec-2012.
- Pivoteau C, Salvy B and Soria M (2012). Algorithms for combinatorial structures, Journal of Combinatorial Theory Series A, 119:8, (1711-1773), Online publication date: 1-Nov-2012.
- Gravin N, Lasserre J, Pasechnik D and Robins S (2012). The Inverse Moment Problem for Convex Polytopes, Discrete & Computational Geometry, 48:3, (596-621), Online publication date: 1-Oct-2012.
- Björklund A, Koivisto M, Husfeldt T, Nederlof J, Kaski P and Parviainen P Fast zeta transforms for lattices with few irreducibles Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1436-1444)
- Bilotta S, Merlini D, Pergola E and Pinzani R (2012). Pattern 1 j+10 j Avoiding Binary Words, Fundamenta Informaticae, 117:1-4, (35-55), Online publication date: 1-Jan-2012.
- Howard B and Mcallister T (2011). Degree bounds for type-A weight rings and Gelfand---Tsetlin semigroups, Journal of Algebraic Combinatorics: An International Journal, 34:2, (237-249), Online publication date: 1-Sep-2011.
- Ruskey F and Woodcock J The rand and block distances of pairs of set partitions Proceedings of the 22nd international conference on Combinatorial Algorithms, (287-299)
- Gnedin A (2011). Coherent random permutations with biased record statistics, Discrete Mathematics, 311:1, (80-91), Online publication date: 1-Jan-2011.
- Higashitani A (2010). Shifted symmetric δ-vectors of convex polytopes, Discrete Mathematics, 310:21, (2925-2934), Online publication date: 1-Nov-2010.
- Kuba M and Panholzer A (2010). A combinatorial approach to the analysis of bucket recursive trees, Theoretical Computer Science, 411:34-36, (3255-3273), Online publication date: 1-Jul-2010.
- Chakrabarty D, Könemann J and Pritchard D Hypergraphic LP relaxations for steiner trees Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization, (383-396)
- Dalvi N, Schnaitter K and Suciu D Computing query probability with incidence algebras Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (203-214)
- Kløve T, Lin T, Tsai S and Tzeng W (2010). Permutation arrays under the Chebyshev distance, IEEE Transactions on Information Theory, 56:6, (2611-2617), Online publication date: 1-Jun-2010.
- Duong P and Huong T (2010). On the stability of Sand Piles Model, Theoretical Computer Science, 411:3, (594-601), Online publication date: 1-Jan-2010.
- Clark E and Ehrenborg R (2010). Explicit expressions for the extremal excedance set statistics, European Journal of Combinatorics, 31:1, (270-279), Online publication date: 1-Jan-2010.
- Lebanon G, Scannapieco M, Fouad M and Bertino E (2009). Beyond k-Anonymity, Transactions on Data Privacy, 2:3, (153-183), Online publication date: 1-Dec-2009.
- Kummini M (2009). Regularity, depth and arithmetic rank of bipartite edge ideals, Journal of Algebraic Combinatorics: An International Journal, 30:4, (429-445), Online publication date: 1-Dec-2009.
- Foissy L (2009). The infinitesimal hopf algebra and the poset of planar forests, Journal of Algebraic Combinatorics: An International Journal, 30:3, (277-309), Online publication date: 1-Nov-2009.
- Štrumbelj E, Kononenko I and Robnik Šikonja M (2009). Explaining instance classifications with interactions of subsets of feature values, Data & Knowledge Engineering, 68:10, (886-904), Online publication date: 1-Oct-2009.
- Harrow A and Low R Efficient Quantum Tensor Product Expanders and k-Designs Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, (548-561)
- Etzion T and Silberstein N (2009). Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, IEEE Transactions on Information Theory, 55:7, (2909-2919), Online publication date: 1-Jul-2009.
- Bóna M and Flynn R (2009). The average number of block interchanges needed to sort a permutation and a recent result of Stanley, Information Processing Letters, 109:16, (927-931), Online publication date: 1-Jul-2009.
- De Carli F, Frosini A, Rinaldi S and Sorbi A (2009). Lattices of local two-dimensional languages, Theoretical Computer Science, 410:27-29, (2701-2713), Online publication date: 1-Jun-2009.
- Gu N and Prodinger H (2009). Bijections for 2-plane trees and ternary trees, European Journal of Combinatorics, 30:4, (969-985), Online publication date: 1-May-2009.
- Min S and Park S (2009). The maximal-inversion statistic and pattern-avoiding permutations, Discrete Mathematics, 309:9, (2649-2657), Online publication date: 1-May-2009.
- Czédli G (2009). On averaging Frankl's conjecture for large union-closed-sets, Journal of Combinatorial Theory Series A, 116:3, (724-729), Online publication date: 1-Apr-2009.
- Quaintance J (2009). Word representations of m×n×p proper arrays, Discrete Mathematics, 309:6, (1199-1212), Online publication date: 1-Apr-2009.
- Willenbring R (2009). RNA secondary structure, permutations, and statistics, Discrete Applied Mathematics, 157:7, (1607-1614), Online publication date: 1-Apr-2009.
- Chebikin D, Ehrenborg R, Pylyavskyy P and Readdy M (2009). Cyclotomic factors of the descent set polynomial, Journal of Combinatorial Theory Series A, 116:2, (247-264), Online publication date: 1-Feb-2009.
- Maia M and Méndez M (2008). On the arithmetic product of combinatorial species, Discrete Mathematics, 308:23, (5407-5427), Online publication date: 1-Dec-2008.
- Agnarsson G (2008). Note, Discrete Mathematics, 308:22, (5284-5288), Online publication date: 1-Nov-2008.
- Bertiger A, Mceliece R and Sweatlock S The Combinatorics of Differentiation Proceedings of the 5th international conference on Sequences and Their Applications, (142-152)
- Panek L, Firer M, Kim H and Hyun J (2008). Groups of linear isometries on poset structures, Discrete Mathematics, 308:18, (4116-4123), Online publication date: 1-Sep-2008.
- Jang C, Kim H, Oh D and Rho Y (2008). The poset structures admitting the extended binary Golay code to be a perfect code, Discrete Mathematics, 308:18, (4057-4068), Online publication date: 1-Sep-2008.
- Hyun J and Kim H (2008). Maximum distance separable poset codes, Designs, Codes and Cryptography, 48:3, (247-261), Online publication date: 1-Sep-2008.
- Bernasconi N, Panagiotou K and Steger A On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, (303-316)
- Franzblau D and Xenakis G (2008). An algorithm for the difference between set covers, Discrete Applied Mathematics, 156:10, (1623-1632), Online publication date: 1-May-2008.
- Tomescu I (2008). Threshold properties of some periodic factors of words over a finite alphabet, Journal of Automata, Languages and Combinatorics, 13:2, (145-156), Online publication date: 1-Apr-2008.
- Deng E and Mansour T (2008). Three Hoppy path problems and ternary paths, Discrete Applied Mathematics, 156:5, (770-779), Online publication date: 1-Mar-2008.
- Yang S (2008). Some identities involving the binomial sequences, Discrete Mathematics, 308:1, (51-58), Online publication date: 1-Jan-2008.
- Certo J, Lau N and Reis L A generic multi-robot coordination strategic layer Proceedings of the 1st international conference on Robot communication and coordination, (1-7)
- Yang S and You H (2007). On a connection between the Pascal, Stirling and Vandermonde matrices, Discrete Applied Mathematics, 155:15, (2025-2030), Online publication date: 20-Sep-2007.
- Akella P (2007). Structure of n-uninorms, Fuzzy Sets and Systems, 158:15, (1631-1651), Online publication date: 1-Aug-2007.
- Lisoněk P (2007). Combinatorial families enumerated by quasi-polynomials, Journal of Combinatorial Theory Series A, 114:4, (619-630), Online publication date: 1-May-2007.
- Kook W (2007). Edge-rooted forests and the α-invariant of cone graphs, Discrete Applied Mathematics, 155:8, (1071-1075), Online publication date: 1-Apr-2007.
- Brenti F, Caselli F and Marietti M (2007). Special matchings and permutations in Bruhat orders, Advances in Applied Mathematics, 38:2, (210-226), Online publication date: 1-Feb-2007.
- Hutson K and Lewis T (2007). The Expected Length of a Minimal Spanning Tree of a Cylinder Graph, Combinatorics, Probability and Computing, 16:1, (63-83), Online publication date: 1-Jan-2007.
- Chen W (2006). Cost distribution of the Chang-Roberts leader election algorithm and related problems, Theoretical Computer Science, 369:1, (442-447), Online publication date: 15-Dec-2006.
- Mao Y and Lebanon G Isotonic conditional random fields and local sentiment flow Proceedings of the 20th International Conference on Neural Information Processing Systems, (961-968)
- Janson S (2006). Left and Right Pathlengths in Random Binary Trees, Algorithmica, 46:3-4, (419-429), Online publication date: 1-Nov-2006.
- Picantin M (2006). Finite transducers for divisibility monoids, Theoretical Computer Science, 362:1, (207-221), Online publication date: 11-Oct-2006.
- Nam D, Seo S and Kim S (2006). An efficient top-down search algorithm for learning Boolean networks of gene expression, Machine Language, 65:1, (229-245), Online publication date: 1-Oct-2006.
- Bousquet-Mélou M and Jehanne A (2006). Polynomial equations with one catalytic variable, algebraic series and map enumeration, Journal of Combinatorial Theory Series B, 96:5, (623-672), Online publication date: 1-Sep-2006.
- Björner A and Sagan B (2006). Rationality of the Möbius function of a composition poset, Theoretical Computer Science, 359:1, (282-298), Online publication date: 14-Aug-2006.
- Garg V (2006). Algorithmic combinatorics based on slicing posets, Theoretical Computer Science, 359:1, (200-213), Online publication date: 14-Aug-2006.
- Long S, Pieprzyk J, Wang H and Wong D (2006). Generalised Cumulative Arrays in Secret Sharing, Designs, Codes and Cryptography, 40:2, (191-209), Online publication date: 1-Aug-2006.
- Lipman J and Stout Q A performance analysis of local synchronization Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, (254-260)
- Donnelly R, Lewis S and Pervine R (2006). Solitary and edge-minimal bases for representations of the simple lie algebra G2, Discrete Mathematics, 306:13, (1285-1300), Online publication date: 1-Jul-2006.
- Sharir M and Welzl E Random triangulations of planar point sets Proceedings of the twenty-second annual symposium on Computational geometry, (273-281)
- Dantsin E, Hirsch E and Wolpert A Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms Proceedings of the 6th Italian conference on Algorithms and Complexity, (60-68)
- Tomescu I (2006). A characterization of the words occurring as factors in a minimum number of words, Theoretical Computer Science, 352:1, (329-331), Online publication date: 7-Mar-2006.
- Liskovets V (2006). Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, 154:3, (537-551), Online publication date: 1-Mar-2006.
- Sharir M and Welzl E On the number of crossing-free matchings, (cycles, and partitions) Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (860-869)
- Aguiar M and Sottile F (2005). Cocommutative Hopf Algebras of Permutations and Trees, Journal of Algebraic Combinatorics: An International Journal, 22:4, (451-470), Online publication date: 1-Dec-2005.
- Martínez C and Molinero X (2005). Efficient iteration in admissible combinatorial classes, Theoretical Computer Science, 346:2, (388-417), Online publication date: 28-Nov-2005.
- Sulanke R (2005). Three dimensional Narayana and Schröder numbers, Theoretical Computer Science, 346:2, (455-468), Online publication date: 28-Nov-2005.
- Herzog J and Hibi T (2005). Distributive Lattices, Bipartite Graphs and Alexander Duality, Journal of Algebraic Combinatorics: An International Journal, 22:3, (289-302), Online publication date: 1-Nov-2005.
- Chari M and Joswig M (2005). Complexes of discrete Morse functions, Discrete Mathematics, 302:1-3, (39-51), Online publication date: 1-Oct-2005.
- Meilǎ M Comparing clusterings Proceedings of the 22nd international conference on Machine learning, (577-584)
- Hetyei G (2005). Matrices of Formal Power Series Associated to Binomial Posets, Journal of Algebraic Combinatorics: An International Journal, 22:1, (65-104), Online publication date: 1-Aug-2005.
- Salvy B D-finiteness Proceedings of the 2005 international symposium on Symbolic and algebraic computation, (2-3)
- Picantin M (2005). Garside monoids vs divisibility monoids, Mathematical Structures in Computer Science, 15:2, (231-242), Online publication date: 1-Apr-2005.
- Tomescu I (2005). Asymptotic Properties of the Factors of Words Over a Finite Alphabet, Fundamenta Informaticae, 64:1-4, (463-470), Online publication date: 1-Jan-2005.
- Wang Y and Yeh Y (2005). Polynomials with real zeros and Pólya frequency sequences, Journal of Combinatorial Theory Series A, 109:1, (63-74), Online publication date: 1-Jan-2005.
- Alekseichuk A (2005). A probabilistic scheme of independent random elements distributed over a finite lattice. II. The method of lattice moments, Cybernetics and Systems Analysis, 40:6, (824-841), Online publication date: 1-Jan-2005.
- Incitti F (2004). The Bruhat Order on the Involutions of the Symmetric Group, Journal of Algebraic Combinatorics: An International Journal, 20:3, (243-261), Online publication date: 1-Nov-2004.
- Fill J and Kapur N (2004). Limiting distributions for additive functionals on Catalan trees, Theoretical Computer Science, 326:1-3, (69-102), Online publication date: 20-Oct-2004.
- Reiner V, Stanton D and White D (2004). The cyclic sieving phenomenon, Journal of Combinatorial Theory Series A, 108:1, (17-50), Online publication date: 1-Oct-2004.
- Brändén P (2004). On Operators on Polynomials Preserving Real-Rootedness and the Neggers-Stanley Conjecture, Journal of Algebraic Combinatorics: An International Journal, 20:2, (119-130), Online publication date: 1-Sep-2004.
- Skandera M (2004). Inequalities in Products of Minors of Totally Nonnegative Matrices, Journal of Algebraic Combinatorics: An International Journal, 20:2, (195-211), Online publication date: 1-Sep-2004.
- Allen E (2004). Descent Monomials, P-Partitions and Dense Garsia-Haiman Modules, Journal of Algebraic Combinatorics: An International Journal, 20:2, (173-193), Online publication date: 1-Sep-2004.
- Klazar M (2004). On the least exponential growth admitting uncountably many closed permutation classes, Theoretical Computer Science, 321:2-3, (271-281), Online publication date: 16-Aug-2004.
- Rodríguez-Carbonell E and Kapur D Automatic Generation of Polynomial Loop Invariants Proceedings of the 2004 international symposium on Symbolic and algebraic computation, (266-273)
- Kauers M Computer proofs for polynomial identities in arbitrary many variables Proceedings of the 2004 international symposium on Symbolic and algebraic computation, (199-204)
- Tomescu I (2004). Asymptotic Properties of the Factors of Words Over a Finite Alphabet, Fundamenta Informaticae, 64:1-4, (463-470), Online publication date: 1-Jul-2004.
- Thomas H (2004). The Number of Terms in the Permanent and the Determinant of a Generic Circulant Matrix, Journal of Algebraic Combinatorics: An International Journal, 20:1, (55-60), Online publication date: 1-Jul-2004.
- Putcha M (2004). Bruhat-Chevalley Order in Reductive Monoids, Journal of Algebraic Combinatorics: An International Journal, 20:1, (33-53), Online publication date: 1-Jul-2004.
- Lam T (2004). Growth diagrams, domino insertion and sign-imbalance, Journal of Combinatorial Theory Series A, 107:1, (87-115), Online publication date: 1-Jul-2004.
- Rechnitzer A and van Rensburg E (2004). Exchange relations, Dyck paths and copolymer adsorption, Discrete Applied Mathematics, 140:1-3, (49-71), Online publication date: 15-May-2004.
- Baril J and Vajnovszki V (2004). Gray code for derangements, Discrete Applied Mathematics, 140:1-3, (207-221), Online publication date: 15-May-2004.
- Wainwright M, Jaakkola T and Willsky A (2004). Tree consistency and bounds on the performance of the max-product algorithm and its generalizations, Statistics and Computing, 14:2, (143-166), Online publication date: 1-Apr-2004.
- Sin P (2004). The p-Rank of the Incidence Matrix of Intersecting Linear Subspaces, Designs, Codes and Cryptography, 31:3, (213-220), Online publication date: 1-Mar-2004.
- Champarnaud J and Duchamp G (2004). Derivatives of rational expressions and related theorems, Theoretical Computer Science, 313:1, (31-44), Online publication date: 16-Feb-2004.
- Shi W, Li Z and Alpert C Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (609-614)
- Engebretsen L, Holmerin J and Russell A (2004). Inapproximability results for equations over finite groups, Theoretical Computer Science, 312:1, (17-45), Online publication date: 26-Jan-2004.
- Ackerman E, Barequet G and Pinter R On the number of rectangular partitions Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (736-745)
- Garsia A and Wallach N (2003). Qsym over Sym is free, Journal of Combinatorial Theory Series A, 104:2, (217-263), Online publication date: 1-Nov-2003.
- Rajsbaum S (2003). ACM SIGACT News distributed computing column 12, ACM SIGACT News, 34:3, (40-61), Online publication date: 1-Sep-2003.
- Meunier L and Salvy B ESF Proceedings of the 2003 international symposium on Symbolic and algebraic computation, (199-206)
- Claesson A, Godsil C and Wagner D (2003). A permutation group determined by an ordered set, Discrete Mathematics, 269:1-3, (273-279), Online publication date: 28-Jul-2003.
- Kung J and Yan C (2003). Exact formulas for moments of sums of classical parking functions, Advances in Applied Mathematics, 31:1, (215-241), Online publication date: 1-Jul-2003.
- Biagioli R (2003). Major and descent statistics for the even-signed permutation group, Advances in Applied Mathematics, 31:1, (163-179), Online publication date: 1-Jul-2003.
- Hou Q and Mu Y (2003). Recurrent sequences and Schur functions, Advances in Applied Mathematics, 31:1, (150-162), Online publication date: 1-Jul-2003.
- Bousquet-Mélou M and Rechnitzer A (2003). The site-perimeter of bargraphs, Advances in Applied Mathematics, 31:1, (86-112), Online publication date: 1-Jul-2003.
- Fischer E (2003). The Specker--Blatter theorem does not hold for quaternary relations, Journal of Combinatorial Theory Series A, 103:1, (121-136), Online publication date: 1-Jul-2003.
- Spencer J and Yan C (2003). The halflie problem, Journal of Combinatorial Theory Series A, 103:1, (69-89), Online publication date: 1-Jul-2003.
- Hersh P (2003). Chain decomposition and the flag f-vector, Journal of Combinatorial Theory Series A, 103:1, (27-52), Online publication date: 1-Jul-2003.
- Glantz R and Pelillo M Graph polynomials, principal pivoting, and maximum independent sets Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition, (166-177)
- Donnelly R (2003). Extremal Properties of Bases for Representations of Semisimple Lie Algebras, Journal of Algebraic Combinatorics: An International Journal, 17:3, (255-282), Online publication date: 1-May-2003.
- Frumkin A, James G and Roichman Y (2003). On Trees and Characters, Journal of Algebraic Combinatorics: An International Journal, 17:3, (323-334), Online publication date: 1-May-2003.
- Nyman K (2003). The Peak Algebra of the Symmetric Group, Journal of Algebraic Combinatorics: An International Journal, 17:3, (309-322), Online publication date: 1-May-2003.
- Fulmek M (2003). Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three, Advances in Applied Mathematics, 30:4, (607-632), Online publication date: 1-May-2003.
- Chapoton F (2003). On intervals in some posets of forests, Journal of Combinatorial Theory Series A, 102:2, (367-382), Online publication date: 1-May-2003.
- Bennett C, Evani L and Grabiner D (2003). A simple definition for the universal Grassmannian order, Journal of Combinatorial Theory Series A, 102:2, (347-366), Online publication date: 1-May-2003.
- Chen W, Hou Q and Lascoux A (2003). An involution for the Gauss identity, Journal of Combinatorial Theory Series A, 102:2, (309-320), Online publication date: 1-May-2003.
- Nmeček J and Klazar M (2003). A bijection between nonnegative words and sparse abba-free partitions, Discrete Mathematics, 265:1-3, (411-416), Online publication date: 6-Apr-2003.
- Donnelly R, Lewis S and Pervine R (2003). Constructions of representations of o(2n + 1, C) that imply Molev and Reiner-Stanton lattices are strongly Sperner, Discrete Mathematics, 263:1-3, (61-79), Online publication date: 28-Feb-2003.
- Eisenkölbl T (2003). (-1)-enumeration of plane partitions with complementation symmetry, Advances in Applied Mathematics, 30:1-2, (53-95), Online publication date: 1-Feb-2003.
- Waugh D (2003). On quotients of Coxeter groups under the weak order, Advances in Applied Mathematics, 30:1-2, (369-384), Online publication date: 1-Feb-2003.
- Makowsky J and Mariño J (2003). Farrell polynomials on graphs of bounded tree width, Advances in Applied Mathematics, 30:1-2, (160-176), Online publication date: 1-Feb-2003.
- Brlek S and Reutenauer C (2003). On a valuation of rational subsets ofZ Dédié à Jean Berstel, Theoretical Computer Science, 292:1, (85-96), Online publication date: 21-Jan-2003.
- Podbrdský P (2003). A bijective proof of an identity for noncrossing graphs, Discrete Mathematics, 260:1-3, (249-253), Online publication date: 6-Jan-2003.
- Munarini E and Salvi N (2002). On the rank polynomial of the lattice of order ideals of fences and crowns, Discrete Mathematics, 259:1-3, (163-177), Online publication date: 28-Dec-2002.
- Van der Hoeven J (2002). Relax, but don't be too lazy, Journal of Symbolic Computation, 34:6, (479-542), Online publication date: 1-Dec-2002.
- Xie X, Hahnloser R and Seung H (2002). Selectively grouping neurons in recurrent networks of lateral inhibition, Neural Computation, 14:11, (2627-2646), Online publication date: 1-Nov-2002.
- Kalikow L (2002). Symmetries in trees and parking functions, Discrete Mathematics, 256:3, (719-741), Online publication date: 28-Oct-2002.
- Deutsch E and Shapiro L (2002). A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Mathematics, 256:3, (655-670), Online publication date: 28-Oct-2002.
- Deutsch E, Feretic S and Noy M (2002). Diagonally convex directed polyominoes and even trees, Discrete Mathematics, 256:3, (645-654), Online publication date: 28-Oct-2002.
- Flajolet P, Hatzis K, Nikoletseas S and Spirakis P (2002). On the robustness of interconnections in random graphs, Theoretical Computer Science, 287:2, (515-534), Online publication date: 28-Sep-2002.
- Copeland A, Schmidt F and Simion R (2002). On two determinants with interesting factorizations, Discrete Mathematics, 256:1-2, (449-458), Online publication date: 28-Sep-2002.
- Lass B (2002). Variations sur le thème E+E=XY, Advances in Applied Mathematics, 29:2, (215-242), Online publication date: 1-Aug-2002.
- Pittel B (2002). On the distribution of the number of Young tableaux for a uniformly random diagram, Advances in Applied Mathematics, 29:2, (184-214), Online publication date: 1-Aug-2002.
- Chern H, Hwang H and Tsai T (2002). An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms, Journal of Algorithms, 44:1, (177-225), Online publication date: 1-Jul-2002.
- Loday J and Ronco M (2002). Order Structure on the Algebra of Permutations and of Planar Binary Trees, Journal of Algebraic Combinatorics: An International Journal, 15:3, (253-270), Online publication date: 1-May-2002.
- Pitman J (2002). Forest Volume Decompositions and Abel-Cayley-Hurwitz Multinomial Expansions, Journal of Combinatorial Theory Series A, 98:1, (175-191), Online publication date: 1-Apr-2002.
- Bóna M (2002). Symmetry and Unimodality in t-Stack Sortable Permutations, Journal of Combinatorial Theory Series A, 98:1, (201-209), Online publication date: 1-Apr-2002.
- Ehrenborg R, Levin M and Readdy M (2002). A Probabilistic Approach to the Descent Statistic, Journal of Combinatorial Theory Series A, 98:1, (150-162), Online publication date: 1-Apr-2002.
- Kochol M (2002). Polynomials Associated with Nowhere-Zero Flows, Journal of Combinatorial Theory Series B, 84:2, (260-269), Online publication date: 1-Mar-2002.
- Varadarajan S, Ngo H and Srivastava J (2002). Error spreading, IEEE/ACM Transactions on Networking, 10:1, (139-152), Online publication date: 1-Feb-2002.
- Fomin S and Zelevinsky A (2002). The Laurent Phenomenon, Advances in Applied Mathematics, 28:2, (119-144), Online publication date: 1-Feb-2002.
- Lebanon G and Lafferty J Conditional models on the ranking poset Proceedings of the 16th International Conference on Neural Information Processing Systems, (431-438)
- Dong X (2002). Canonical Modules of Semigroup Rings and a Conjecture of Reiner, Discrete & Computational Geometry, 27:1, (85-97), Online publication date: 1-Jan-2002.
- Adin R and Roichman Y (2002). Shape Avoiding Permutations, Journal of Combinatorial Theory Series A, 97:1, (162-176), Online publication date: 1-Jan-2002.
- Pemantle R and Wilson M (2002). Asymptotics of Multivariate Sequences, Journal of Combinatorial Theory Series A, 97:1, (129-161), Online publication date: 1-Jan-2002.
- Hersh P (2002). Two Generalizations of Posets of Shuffles, Journal of Combinatorial Theory Series A, 97:1, (1-26), Online publication date: 1-Jan-2002.
- Ohsugi H and Hibi T (2001). Unimodular Triangulations and Coverings of Configurations Arising from Root Systems, Journal of Algebraic Combinatorics: An International Journal, 14:3, (199-219), Online publication date: 1-Nov-2001.
- Garg V and Skawratananond C String realizers of posets with applications to distributed computing Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (72-80)
- Kozlov D (2001). Spectral Sequences on Combinatorial Simplicial Complexes, Journal of Algebraic Combinatorics: An International Journal, 14:1, (27-48), Online publication date: 1-Jul-2001.
- Stembridge J (2001). Quasi-Minuscule Quotients and Reduced Words for Reflections, Journal of Algebraic Combinatorics: An International Journal, 13:3, (275-293), Online publication date: 1-May-2001.
- Deodhar R and Srinivasan M (2001). A Statistic on Involutions, Journal of Algebraic Combinatorics: An International Journal, 13:2, (187-198), Online publication date: 1-Mar-2001.
- Buch A (2001). On a Conjectured Formula for Quiver Varieties, Journal of Algebraic Combinatorics: An International Journal, 13:2, (151-172), Online publication date: 1-Mar-2001.
- Billera L and Liu N (2000). Noncommutative Enumeration in Graded Posets, Journal of Algebraic Combinatorics: An International Journal, 12:1, (7-24), Online publication date: 1-Jul-2000.
- Brenti F and Simion R (2000). Explicit Formulae for Some Kazhdan-Lusztig Polynomials, Journal of Algebraic Combinatorics: An International Journal, 11:3, (187-196), Online publication date: 1-May-2000.
- Lenart C (2000). Lagrange Inversion and Schur Functions, Journal of Algebraic Combinatorics: An International Journal, 11:1, (69-78), Online publication date: 1-Jan-2000.
- Brusoni V, Console L, Terenziani P and Pernici B (1999). Qualitative and Quantitative Temporal Constraints and Relational Databases, IEEE Transactions on Knowledge and Data Engineering, 11:6, (948-894), Online publication date: 1-Nov-1999.
- Athanasiadis C (1999). Extended Linial Hyperplane Arrangements for Root Systems and a Conjecture of Postnikov and Stanley, Journal of Algebraic Combinatorics: An International Journal, 10:3, (207-225), Online publication date: 1-Nov-1999.
- Chow T (1999). Descents, Quasi-Symmetric Functions, Robinson-Schensted for Posets, and the Chromatic Symmetric Function, Journal of Algebraic Combinatorics: An International Journal, 10:3, (227-240), Online publication date: 1-Nov-1999.
- Elashvili A, Jibladze M and Pataraia D (1999). Combinatorics of Necklaces and “Hermite Reciprocity”, Journal of Algebraic Combinatorics: An International Journal, 10:2, (173-188), Online publication date: 1-Sep-1999.
- Ciucu M (1999). Higher Dimensional Aztec Diamonds and a (2d + 2)-Vertex Model, Journal of Algebraic Combinatorics: An International Journal, 9:3, (281-293), Online publication date: 1-May-1999.
- Sundaram S (1999). Homotopy of Non-Modular Partitions and the Whitehouse Module, Journal of Algebraic Combinatorics: An International Journal, 9:3, (251-269), Online publication date: 1-May-1999.
- Proctor R (1999). Dynkin Diagram Classification of λ-Minuscule Bruhat Latticesand of d-Complete Posets, Journal of Algebraic Combinatorics: An International Journal, 9:1, (61-94), Online publication date: 1-Jan-1999.
- Ehrenborg R and Readdy M (1998). Coproducts and the cd-Index, Journal of Algebraic Combinatorics: An International Journal, 8:3, (273-299), Online publication date: 1-Nov-1998.
- Dulucq S and Simion R (1998). Combinatorial Statistics on Alternating Permutations, Journal of Algebraic Combinatorics: An International Journal, 8:2, (169-191), Online publication date: 1-Sep-1998.
- Brenti F (1998). Hilbert Polynomials in Combinatorics, Journal of Algebraic Combinatorics: An International Journal, 7:2, (127-156), Online publication date: 1-Mar-1998.
- Blass A and Sagan B (1998). Characteristic and Ehrhart Polynomials, Journal of Algebraic Combinatorics: An International Journal, 7:2, (115-126), Online publication date: 1-Mar-1998.
- Herscovici D (1998). Semimodular Lattices and Semibuildings, Journal of Algebraic Combinatorics: An International Journal, 7:1, (39-51), Online publication date: 1-Jan-1998.
- Herscovici D (1998). Minimal Paths between Maximal Chains in Finite Rank Semimodular Lattices, Journal of Algebraic Combinatorics: An International Journal, 7:1, (17-37), Online publication date: 1-Jan-1998.
- Fill J An interruptible algorithm for perfect sampling via Markov chains Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (688-695)
- Nica A and Speicher R (1997). A “Fourier Transform” for Multiplicative Functionson Non-Crossing Partitions, Journal of Algebraic Combinatorics: An International Journal, 6:2, (141-160), Online publication date: 1-Apr-1997.
- Terai N and Hibi T (1997). Finite Free Resolutions and 1-Skeletonsof Simplicial Complexes, Journal of Algebraic Combinatorics: An International Journal, 6:1, (89-93), Online publication date: 1-Mar-1997.
- Pocchiola M and Vegter G (1996). Topologically sweeping visibility complexes via pseudotriangulations, Discrete & Computational Geometry, 16:4, (419-453), Online publication date: 1-Apr-1996.
- Clauss P Counting solutions to linear and nonlinear constraints through Ehrhart polynomials Proceedings of the 10th international conference on Supercomputing, (278-285)
- Pocchiola M and Vegter G Computing the visibility graph via pseudo-triangulations Proceedings of the eleventh annual symposium on Computational geometry, (248-257)
- Procter R and Wilson D (1995). Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux, Discrete Mathematics, 137:1, (297-302), Online publication date: 20-Jan-1995.
- Yao A Decision tree complexity and Betti numbers Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (615-624)
- Kalkbrener M An upper bound on the number of monomials in the Sylvester resultant Proceedings of the 1993 international symposium on Symbolic and algebraic computation, (161-163)
- Barvinok A Computing the volume, counting integral points, and exponential sums Proceedings of the eighth annual symposium on Computational geometry, (161-170)
- Björner A, Lovász L and Yao A Linear decision trees Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, (170-177)
- Pruesse G and Ruskey F (1991). Generating the Linear Extensions of Certain Posets by Transpositions, SIAM Journal on Discrete Mathematics, 4:3, (413-422), Online publication date: 1-Aug-1991.
- Lovász L and Schrijver A (1991). Cones of Matrices and Set-Functions and 0–1 Optimization, SIAM Journal on Optimization, 1:2, (166-190), Online publication date: 1-May-1991.
- Ramshaw L (1989). Suitening our nomenclature, ACM SIGACT News, 20:1, (60-61), Online publication date: 1-Jan-1989.
Index Terms
- Enumerative combinatorics
Please enable JavaScript to view thecomments powered by Disqus.
Recommendations
On the combinatorics of derangements and related permutations
Highlights- Provide a bijection combinatorial proof for the facts that The number of derangements of length n equals the number of permutations of length n that have ...
AbstractA derangement is a permutation in which no entry is at its original position. The number of derangements of [ n ] is called the “derangement number” or “de Montmort number”, and is denoted by D n. The sequence { D n } enumerates, in ...
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Special Issue on StringologySuppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ$^+$ has a unique maximal factorization over W. The classic circ-UMFF is the set of ...