Bruce E. Sagan

Affiliations:
  • Michigan State University, East Lansing, MI, United States


According to our database1, Bruce E. Sagan authored at least 71 papers between 1979 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Pinnacle set properties.
Discret. Math., 2022

Cyclic pattern containment and avoidance.
Adv. Appl. Math., 2022

2021
Bijective Proofs of Proper Coloring Theorems.
Am. Math. Mon., 2021

On a rank-unimodality conjecture of Morier-Genoud and Ovsienko.
Discret. Math., 2021

2020
Bijective proofs of shuffle compatibility results.
Adv. Appl. Math., 2020

2019
Increasing spanning forests in graphs and simplicial complexes.
Eur. J. Comb., 2019

Descent polynomials.
Discret. Math., 2019

backbone: An R Package for Backbone Extraction of Weighted Graphs.
CoRR, 2019

2018
On the 1/3-2/3 Conjecture.
Order, 2018

Pattern-avoiding polytopes.
Eur. J. Comb., 2018

Distance preserving graphs and graph products.
Ars Comb., 2018

Restricted growth function patterns and statistics.
Adv. Appl. Math., 2018

2017
Antipodes and involutions.
J. Comb. Theory, Ser. A, 2017

2016
Bijections on m-level rook placements.
Eur. J. Comb., 2016

Set partition patterns and statistics.
Discret. Math., 2016

2015
Factoring the characteristic polynomial of a lattice.
J. Comb. Theory, Ser. A, 2015

2014
m-Level rook placements.
J. Comb. Theory, Ser. A, 2014

The Fractal Nature of the Fibonomial Triangle.
Integers, 2014

2013
Inversion polynomials for 321-avoiding permutations.
Discret. Math., 2013

On 021-Avoiding Ascent Sequences.
Electron. J. Comb., 2013

2012
Mahonian pairs.
J. Comb. Theory, Ser. A, 2012

Counting s(3+1)-avoiding permutations.
Eur. J. Comb., 2012

Permutation patterns and statistics.
Discret. Math., 2012

2011
Partitions, Rooks, and Symmetric Functions in Noncommuting Variables.
Electron. J. Comb., 2011

Eulerian quasisymmetric functions and cyclic sieving.
Adv. Appl. Math., 2011

2010
Combinatorial Interpretations of Binomial Coefficient Analogues Related to Lucas Sequences.
Integers, 2010

Pattern Avoidance in Set Partitions.
Ars Comb., 2010

Infinite log-concavity: Developments and conjectures.
Adv. Appl. Math., 2010

2009
Set partition statistics and q-Fibonacci numbers.
Eur. J. Comb., 2009

Monomial bases for broken circuit complexes.
Eur. J. Comb., 2009

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order.
Electron. J. Comb., 2009

2008
Proper Partitions of a Polygon and k-Catalan Numbers.
Ars Comb., 2008

A human proof for a generalization of Shalosh B. Ekhad's 10<sup>n</sup> Lattice Paths Theorem.
Ars Comb., 2008

2007
What power of two divides a weighted Catalan number?
J. Comb. Theory, Ser. A, 2007

Counting permutations by congruence class of major index.
Adv. Appl. Math., 2007

2006
Rationality of the Möbius function of a composition poset.
Theor. Comput. Sci., 2006

Maximal independent sets in graphs with at most <i>r</i> cycles.
J. Graph Theory, 2006

Maximal and maximum independent sets in graphs with at most <i>r</i> cycles.
J. Graph Theory, 2006

An algorithmic sign-reversing involution for special rim-hook tableaux.
J. Algorithms, 2006

2005
Topological properties of activity orders for matroid bases.
J. Comb. Theory, Ser. B, 2005

2004
Bounding quantities related to the packing density of 1(ℓ+1)ℓ⋯2.
Adv. Appl. Math., 2004

2003
Two injective proofs of a conjecture of Simion.
J. Comb. Theory, Ser. A, 2003

2002
Pattern Frequency Sequences and Internal Zeros.
Adv. Appl. Math., 2002

2001
The Multiplicities of a Dual-thin Q-polynomial Association Scheme.
Electron. J. Comb., 2001

2000
Left-Modular Elements of Lattices.
J. Comb. Theory, Ser. A, 2000

Sinks in Acyclic Orientations of Graphs.
J. Comb. Theory, Ser. B, 2000

1999
Counting Methods.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1998
Unimodality and the Reflection Principle.
Ars Comb., 1998

1996
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
Electron. J. Comb., 1996

1995
Enumeration of trees by inversions.
J. Graph Theory, 1995

A Generalization of Semimodular Supersolvable Lattices.
J. Comb. Theory, Ser. A, 1995

La correspondance de Robinson-Schensted pour les tableaux oscillants gauches.
Discret. Math., 1995

A relative of the Thue-Morse sequence.
Discret. Math., 1995

1994
Maximizing Möbius functions on subsets of Boolean algebras.
Discret. Math., 1994

1993
Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions.
Theor. Comput. Sci., 1993

1992
Inductive proofs of q-log concavity.
Discret. Math., 1992

1991
The Twisted N-Cube with Application to Multiprocessing.
IEEE Trans. Computers, 1991

A maj Statistic for Set Partitions.
Eur. J. Comb., 1991

The symmetric group - representations, combinatorial algorithms, and symmetric functions.
Wadsworth & Brooks / Cole mathematics series, Wadsworth, ISBN: 978-0-534-15540-7, 1991

1990
Robinson-schensted algorithms for skew tableaux.
J. Comb. Theory, Ser. A, 1990

1988
A Note on Independent Sets in Trees.
SIAM J. Discret. Math., 1988

Inductive and injective proofs of log concavity results.
Discret. Math., 1988

On Enhancing Hypercube Multiprocessors.
Proceedings of the International Conference on Parallel Processing, 1988

1987
Shifted tableaux, schur <i>Q</i>-functions, and a conjecture of R. Stanley.
J. Comb. Theory, Ser. A, 1987

1986
Bijective proofs of two broken circuit theorems.
J. Graph Theory, 1986

1983
A note on Abel polynomials and rooted labeled forests.
Discret. Math., 1983

1982
Enumeration of Partitions with Hooklengths.
Eur. J. Comb., 1982

1981
From sets to functions: Three elementary examples.
Discret. Math., 1981

1980
On Selecting a Random Shifted Young Tableau.
J. Algorithms, 1980

Congruences Derived from Group Action.
Eur. J. Comb., 1980

1979
An Analog of Schensted's Algorithm for Shifted Young Tableaux.
J. Comb. Theory, Ser. A, 1979


  Loading...