|
Search the dblp DataBase
Nicholas A. Loehr:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Lenwood S. Heath, Nicholas A. Loehr
New Algorithms for Generating Conway Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:429-437 [Conf]
- Nicholas A. Loehr, Jeffrey B. Remmel
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
- James Haglund, Nicholas A. Loehr
A conjectured combinatorial formula for the Hilbert series for diagonal harmonics. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:298, n:1-3, pp:189-204 [Journal]
- Nicholas A. Loehr
Note on André's reflection principle. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:280, n:1-3, pp:233-236 [Journal]
- James Haglund, Nicholas A. Loehr, Jeffrey B. Remmel
Statistics on wreath products, perfect matchings, and signed words. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:6, pp:835-868 [Journal]
- Nicholas A. Loehr
Permutation statistics and the q, t-Catalan sequence. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2005, v:26, n:1, pp:83-93 [Journal]
- Mahir Can, Nicholas A. Loehr
A proof of the q, t-square conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1419-1434 [Journal]
- Lenwood S. Heath, Nicholas A. Loehr
New algorithms for generating Conway polynomials over finite fields. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2004, v:38, n:2, pp:1003-1024 [Journal]
A human proof for a generalization of Shalosh B. Ekhad's 10n Lattice Paths Theorem. [Citation Graph (, )][DBLP]
The Major Index Specialization of the q, t-Catalan. [Citation Graph (, )][DBLP]
Conjectured Statistics for the Higher q, t-Catalan Sequences. [Citation Graph (, )][DBLP]
From quasisymmetric expansions to Schur expansions via a modified inverse Kostka matrix. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|