Skip to main content

13 Result(s)

within Jeffrey B. Remmel Remove this filter Mathematics Remove this filter

and

  1. No Access

    Article

    A Proof of the Delta Conjecture When \(\varvec{q=0}\)

    In Haglund et al. (Trans. Amer. Math. Soc. 370(6):4029–4057, 2018), Haglund, Remmel and Wilson introduce a conjecture which gives a combinatorial prediction for the result of applying a certain operator to an ele...

    Adriano Garsia, Jim Haglund, Jeffrey B. Remmel, Meesue Yoo in Annals of Combinatorics (2019)

  2. No Access

    Chapter

    p-Rook Numbers and Cycle Counting in \(C_p \wr S_n\)

    Cycle-counting rook numbers were introduced by Chung and Graham [J. Combin. Theory Ser. B 65 (1995), 273–290]. Cycle-counting q-rook numbers were introduced by Ehrenborg, Haglund, and Readdy [unpublished] and cyc...

    James Haglund, Jeffrey B. Remmel, Meesue Yoo in Lattice Path Combinatorics and Applications (2019)

  3. No Access

    Chapter

    Paired Patterns in Lattice Paths

    Let \(\mathscr {L}_n\) L n ...

    Ran Pan, Jeffrey B. Remmel in Lattice Path Combinatorics and Applications (2019)

  4. No Access

    Article

    Generating Functions for Alternating Descents and Alternating Major Index

    In 2008, Chebikin introduced the alternating descent set, AltDes(σ), of a permutation σ = σ 1 ··· σ n in the symmetric group S ...

    Jeffrey B. Remmel in Annals of Combinatorics (2012)

  5. Article

    Open Access

    A computational and combinatorial exposé of plethystic calculus

    In recent years, plethystic calculus has emerged as a powerful technical tool for studying symmetric polynomials. In particular, some striking recent advances in the theory of Macdonald polynomials have relied...

    Nicholas A. Loehr, Jeffrey B. Remmel in Journal of Algebraic Combinatorics (2011)

    Download PDF (785 KB)

  6. Article

    Open Access

    A p, q-Analogue of the Generalized Derangement Numbers

    In this paper, we study the numbers D n,k which are defined as the number of permutations σ of the symmetric group S ...

    Karen S. Briggs, Jeffrey B. Remmel in Annals of Combinatorics (2009)

    Download PDF (408 KB)

  7. No Access

    Article

    Space complexity of Abelian groups

    We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE pres...

    Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel… in Archive for Mathematical Logic (2009)

  8. No Access

    Article

    Algorithmic randomness of continuous functions

    We investigate notions of randomness in the space \({{\mathcal C}(2^{\mathbb N})}\) of continuous functions on ...

    George Barmpalias, Paul Brodhead, Douglas Cenzer… in Archive for Mathematical Logic (2008)

  9. No Access

    Article

    Large-Scale Regularities of Lattice Embeddings of Posets

    Let N denote the set of natural numbers and let P =(N k , ≼) be a countably infinite poset on the k-dimensional lattice N k . Given x ∈ N ...

    Jeffrey B. Remmel, S. Gill Williamson in Order (1999)

  10. Article

    Applications of the Frobenius Formulas for the Characters of the Symmetric Group and the Hecke Algebras of Type A

    We give a simple combinatorial proof of Ram's rule for computing the characters of the Hecke Algebra. We also establish a relationship between the characters of the Hecke algebra and the Kronecker product of t...

    Arun Ram, Jeffrey B. Remmel in Journal of Algebraic Combinatorics (1997)

    Download PDF (232 KB)

  11. No Access

    Chapter and Conference Paper

    On logical constraints in logic programming

    We introduce a new form of logic programming with constraints. The constraints that we consider are not restricted to statements on real numbers as in CLP(R), see Jaffar and Lassez [10]. Instead our constraints a...

    V. Wiktor Marek, Anil Nerode… in Logic Programming and Nonmonotonic Reasoni… (1995)

  12. No Access

    Article

    Combinatorial algorithms for the expansion of various products of schur functions

    Jeffrey B. Remmel in Acta Applicandae Mathematica (1990)

  13. No Access

    Chapter

    Combinatorial Algorithms for the Expansion of Various Products of Schur Functions

    The main purpose of these lectures is first to briefly survey the fundamental connection between the representation theory of the symmetric group S n and the theory of symm...

    Jeffrey B. Remmel in Topics in Computational Algebra (1990)