default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBruce E. Sagan
Person information
- affiliation: Michigan State University, East Lansing, MI, United States
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j69]Mark Dukes, Bruce E. Sagan:
Difference ascent sequences. Adv. Appl. Math. 159: 102736 (2024)- [j68]Bruce E. Sagan, Joshua P. Swanson:
q-Stirling numbers in type B. Eur. J. Comb. 118: 103899 (2024) - 2022
- [j67]Rachel Domagalski
, Sergi Elizalde, Jinting Liang, Quinn Minnich, Bruce E. Sagan, Jamie Schmidt, Alexander Sietsema:
Cyclic pattern containment and avoidance. Adv. Appl. Math. 135: 102320 (2022) - [j66]Rachel Domagalski, Jinting Liang, Quinn Minnich, Bruce E. Sagan, Jamie Schmidt, Alexander Sietsema:
Pinnacle set properties. Discret. Math. 345(7): 112882 (2022) - 2021
- [j65]Thomas McConville, Bruce E. Sagan, Clifford D. Smyth:
On a rank-unimodality conjecture of Morier-Genoud and Ovsienko. Discret. Math. 344(8): 112483 (2021) - [j64]Bruce E. Sagan, Vincent Vatter:
Bijective Proofs of Proper Coloring Theorems. Am. Math. Mon. 128(6): 483-499 (2021) - 2020
- [j63]Duff Baker-Jarvis, Bruce E. Sagan:
Bijective proofs of shuffle compatibility results. Adv. Appl. Math. 113 (2020)
2010 – 2019
- 2019
- [j62]Alexander Diaz-Lopez, Pamela E. Harris, Erik Insko, Mohamed Omar, Bruce E. Sagan:
Descent polynomials. Discret. Math. 342(6): 1674-1686 (2019) - [j61]Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan:
Increasing spanning forests in graphs and simplicial complexes. Eur. J. Comb. 76: 178-198 (2019) - [i1]Rachel Domagalski, Zachary P. Neal, Bruce E. Sagan:
backbone: An R Package for Backbone Extraction of Weighted Graphs. CoRR abs/1912.12779 (2019) - 2018
- [j60]Lindsey R. Campbell, Samantha Dahlberg, Robert Dorward, Jonathan Gerhard, Thomas Grubb, Carlin Purcell, Bruce E. Sagan:
Restricted growth function patterns and statistics. Adv. Appl. Math. 100: 1-42 (2018) - [j59]M. H. Khalifeh, Bruce E. Sagan, Emad Zahedi:
Distance preserving graphs and graph products. Ars Comb. 140: 321-328 (2018) - [j58]Robert Davis, Bruce E. Sagan:
Pattern-avoiding polytopes. Eur. J. Comb. 74: 48-84 (2018) - [j57]Emily J. Olson, Bruce E. Sagan:
On the 1/3-2/3 Conjecture. Order 35(3): 581-596 (2018) - 2017
- [j56]Carolina Benedetti, Bruce E. Sagan:
Antipodes and involutions. J. Comb. Theory A 148: 275-315 (2017) - 2016
- [j55]Samantha Dahlberg, Robert Dorward, Jonathan Gerhard, Thomas Grubb, Carlin Purcell, Lindsey Reppuhn, Bruce E. Sagan:
Set partition patterns and statistics. Discret. Math. 339(1): 1-16 (2016) - [j54]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
Bijections on m-level rook placements. Eur. J. Comb. 57: 13-35 (2016) - 2015
- [j53]Joshua Hallam, Bruce E. Sagan:
Factoring the characteristic polynomial of a lattice. J. Comb. Theory A 136: 39-63 (2015) - 2014
- [j52]Xi Chen, Bruce E. Sagan:
The Fractal Nature of the Fibonomial Triangle. Integers 14: A3 (2014) - [j51]Kenneth Barrese, Nicholas A. Loehr, Jeffrey B. Remmel, Bruce E. Sagan:
m-Level rook placements. J. Comb. Theory A 124: 130-165 (2014) - 2013
- [j50]William Y. C. Chen, Alvin Y. L. Dai, Theodore Dokos, Tim Dwyer, Bruce E. Sagan:
On 021-Avoiding Ascent Sequences. Electron. J. Comb. 20(1): 76 (2013) - [j49]Szu-En Cheng, Sergi Elizalde, Anisse Kasraoui, Bruce E. Sagan:
Inversion polynomials for 321-avoiding permutations. Discret. Math. 313(22): 2552-2565 (2013) - 2012
- [j48]Theodore Dokos, Tim Dwyer, Bryan P. Johnson, Bruce E. Sagan, Kimberly Selsor:
Permutation patterns and statistics. Discret. Math. 312(18): 2760-2775 (2012) - [j47]M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter:
Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012) - [j46]Bruce E. Sagan, Carla D. Savage:
Mahonian pairs. J. Comb. Theory A 119(3): 526-545 (2012) - 2011
- [j45]Bruce E. Sagan, John Shareshian, Michelle L. Wachs:
Eulerian quasisymmetric functions and cyclic sieving. Adv. Appl. Math. 46(1-4): 536-562 (2011) - [j44]Mahir Bilen Can, Bruce E. Sagan:
Partitions, Rooks, and Symmetric Functions in Noncommuting Variables. Electron. J. Comb. 18(2) (2011) - 2010
- [j43]Peter R. W. McNamara, Bruce E. Sagan:
Infinite log-concavity: Developments and conjectures. Adv. Appl. Math. 44(1): 1-15 (2010) - [j42]Bruce E. Sagan:
Pattern Avoidance in Set Partitions. Ars Comb. 94 (2010) - [j41]Bruce E. Sagan, Carla D. Savage:
Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas Sequences. Integers 10: A52 (2010)
2000 – 2009
- 2009
- [j40]Sergey Kitaev, Jeffrey Liese, Jeffrey B. Remmel, Bruce E. Sagan:
Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order. Electron. J. Comb. 16(2) (2009) - [j39]Adam M. Goyt, Bruce E. Sagan:
Set partition statistics and q-Fibonacci numbers. Eur. J. Comb. 30(1): 230-245 (2009) - [j38]Jason I. Brown, Bruce E. Sagan:
Monomial bases for broken circuit complexes. Eur. J. Comb. 30(8): 1786-1800 (2009) - 2008
- [j37]Bruce E. Sagan:
Proper Partitions of a Polygon and k-Catalan Numbers. Ars Comb. 88 (2008) - [j36]Nicholas A. Loehr, Bruce E. Sagan, Gregory S. Warrington:
A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. Ars Comb. 89 (2008) - 2007
- [j35]Hélène Barcelo, Bruce E. Sagan, Sheila Sundaram:
Counting permutations by congruence class of major index. Adv. Appl. Math. 39(2): 269-281 (2007) - [j34]Alexander Postnikov, Bruce E. Sagan:
What power of two divides a weighted Catalan number? J. Comb. Theory A 114(5): 970-977 (2007) - 2006
- [j33]Bruce E. Sagan, Jaejin Lee:
An algorithmic sign-reversing involution for special rim-hook tableaux. J. Algorithms 59(2): 149-161 (2006) - [j32]Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter:
Maximal independent sets in graphs with at most r cycles. J. Graph Theory 53(4): 270-282 (2006) - [j31]Bruce E. Sagan, Vincent R. Vatter:
Maximal and maximum independent sets in graphs with at most r cycles. J. Graph Theory 53(4): 283-314 (2006) - [j30]Anders Björner, Bruce E. Sagan:
Rationality of the Möbius function of a composition poset. Theor. Comput. Sci. 359(1-3): 282-298 (2006) - 2005
- [j29]Rieuwert J. Blok, Bruce E. Sagan:
Topological properties of activity orders for matroid bases. J. Comb. Theory B 94(1): 101-116 (2005) - 2004
- [j28]Martin Hildebrand, Bruce E. Sagan, Vincent R. Vatter:
Bounding quantities related to the packing density of 1(ℓ+1)ℓ⋯2. Adv. Appl. Math. 33(3): 633-653 (2004) - 2003
- [j27]Miklós Bóna, Bruce E. Sagan:
Two injective proofs of a conjecture of Simion. J. Comb. Theory A 102(1): 212-216 (2003) - 2002
- [j26]Miklós Bóna, Bruce E. Sagan, Vincent R. Vatter:
Pattern Frequency Sequences and Internal Zeros. Adv. Appl. Math. 28(3-4): 395-420 (2002) - 2001
- [j25]Bruce E. Sagan, John S. Caughman IV:
The Multiplicities of a Dual-thin Q-polynomial Association Scheme. Electron. J. Comb. 8(1) (2001) - 2000
- [j24]David D. Gebhard, Bruce E. Sagan:
Sinks in Acyclic Orientations of Graphs. J. Comb. Theory B 80(1): 130-146 (2000) - [j23]Shu-Chung Liu, Bruce E. Sagan:
Left-Modular Elements of Lattices. J. Comb. Theory A 91(1-2): 369-385 (2000)
1990 – 1999
- 1999
- [r1]Jay Yellen, Edward W. Packel, Robert G. Rieper, George E. Andrews, Alan C. Tucker, Edward A. Bender, Bruce E. Sagan:
Counting Methods. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j22]Bruce E. Sagan:
Unimodality and the Reflection Principle. Ars Comb. 48 (1998) - 1996
- [j21]Ira M. Gessel, Bruce E. Sagan:
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions. Electron. J. Comb. 3(2) (1996) - 1995
- [j20]Serge Dulucq, Bruce E. Sagan:
La correspondance de Robinson-Schensted pour les tableaux oscillants gauches. Discret. Math. 139(1-3): 129-142 (1995) - [j19]Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan:
A relative of the Thue-Morse sequence. Discret. Math. 139(1-3): 455-461 (1995) - [j18]Curtis D. Bennett, Bruce E. Sagan:
A Generalization of Semimodular Supersolvable Lattices. J. Comb. Theory A 72(2): 209-231 (1995) - [j17]Ira M. Gessel, Bruce E. Sagan, Yeong-Nan Yeh:
Enumeration of trees by inversions. J. Graph Theory 19(4): 435-459 (1995) - 1994
- [j16]Bruce E. Sagan, Yeong-Nan Yeh, Günter M. Ziegler:
Maximizing Möbius functions on subsets of Boolean algebras. Discret. Math. 126(1-3): 293-311 (1994) - 1993
- [j15]Bruce E. Sagan:
Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions. Theor. Comput. Sci. 117(1&2): 273-287 (1993) - 1992
- [j14]Bruce E. Sagan:
Inductive proofs of q-log concavity. Discret. Math. 99(1-3): 289-306 (1992) - 1991
- [b1]Bruce E. Sagan:
The symmetric group - representations, combinatorial algorithms, and symmetric functions. Wadsworth & Brooks / Cole mathematics series, Wadsworth 1991, ISBN 978-0-534-15540-7, pp. I-XV, 1-197 - [j13]Bruce E. Sagan:
A maj Statistic for Set Partitions. Eur. J. Comb. 12(1): 69-79 (1991) - [j12]Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan:
The Twisted N-Cube with Application to Multiprocessing. IEEE Trans. Computers 40(1): 88-93 (1991) - 1990
- [j11]Bruce E. Sagan, Richard P. Stanley:
Robinson-schensted algorithms for skew tableaux. J. Comb. Theory A 55(2): 161-193 (1990)
1980 – 1989
- 1988
- [j10]Bruce E. Sagan:
Inductive and injective proofs of log concavity results. Discret. Math. 68(2-3): 281-292 (1988) - [j9]Bruce E. Sagan:
A Note on Independent Sets in Trees. SIAM J. Discret. Math. 1(1): 105-108 (1988) - [c1]Abdol-Hossein Esfahanian, Lionel M. Ni, Bruce E. Sagan:
On Enhancing Hypercube Multiprocessors. ICPP (1) 1988: 86-89 - 1987
- [j8]Bruce E. Sagan:
Shifted tableaux, schur Q-functions, and a conjecture of R. Stanley. J. Comb. Theory A 45(1): 62-103 (1987) - 1986
- [j7]Andreas Blass, Bruce E. Sagan:
Bijective proofs of two broken circuit theorems. J. Graph Theory 10(1): 15-21 (1986) - 1983
- [j6]Bruce E. Sagan:
A note on Abel polynomials and rooted labeled forests. Discret. Math. 44(3): 293-298 (1983) - 1982
- [j5]Bruce E. Sagan:
Enumeration of Partitions with Hooklengths. Eur. J. Comb. 3(1): 85-94 (1982) - 1981
- [j4]S. A. Joni, Gian-Carlo Rota, Bruce E. Sagan:
From sets to functions: Three elementary examples. Discret. Math. 37(2-3): 193-202 (1981) - 1980
- [j3]Gian-Carlo Rota, Bruce E. Sagan:
Congruences Derived from Group Action. Eur. J. Comb. 1(1): 67-76 (1980) - [j2]Bruce E. Sagan:
On Selecting a Random Shifted Young Tableau. J. Algorithms 1(3): 213-234 (1980)
1970 – 1979
- 1979
- [j1]Bruce E. Sagan:
An Analog of Schensted's Algorithm for Shifted Young Tableaux. J. Comb. Theory A 27(1): 10-18 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
