Search Results - "Canfield, E. Rodney"

Refine Results
  1. 1

    Asymptotic enumeration of integer matrices with large equal row and column sums by Rodney Canfield, E., McKay, Brendan D.

    Published in Combinatorica (Budapest. 1981) (01-11-2010)
    “…Let s, t, m, n be positive integers such that sm = tn . Let M ( m, s; n, t ) be the number of m × n matrices over {0, 1, 2, …} with each row summing to s and…”
    Get full text
    Journal Article
  2. 2

    The Expected Characteristic and Permanental Polynomials of the Random Gram Matrix by Martin, Jacob G., Canfield, E. Rodney

    Published in The Electronic journal of combinatorics (21-07-2014)
    “…A $t \times n$ random matrix $A$ can be formed by sampling $n$ independent random column vectors, each containing $t$ components. The random Gram matrix of…”
    Get full text
    Journal Article
  3. 3

    From recursions to asymptotics: Durfee and dilogarithmic deductions by Canfield, E. Rodney

    Published in Advances in applied mathematics (01-05-2005)
    “…We consider two dimensional arrays p ( n , k ) which count a family of partitions of n by a second parameter k, usually the number of parts. Such arrays…”
    Get full text
    Journal Article
  4. 4

    Integer partitions and the Sperner property by Canfield, E.Rodney

    Published in Theoretical computer science (14-10-2003)
    “…The objectives of this paper are three-fold. First, we would like to call attention to a very attractive problem, the question of whether or not the poset of…”
    Get full text
    Journal Article
  5. 5

    An upper bound for the size of the largest antichain in the poset of partitions of an integer by Rodney Canfield, E., Engel, Konrad

    Published in Discrete Applied Mathematics (30-07-1999)
    “…Let Pi n be the poset of partitions of an integer n, ordered by refinement. Let b( Pi n ) be the largest size of a level and d( Pi n ) be the largest size of…”
    Get full text
    Journal Article Conference Proceeding
  6. 6

    The end of pumping? by Zhang, Guo-Qiang, Canfield, E.Rodney

    Published in Theoretical computer science (15-03-1997)
    “…A new lemma is introduced for regular languages. This lemma is simpler than the pumping lemma, and yet it is equally useful. By providing an elementary proof,…”
    Get full text
    Journal Article
  7. 7
  8. 8
  9. 9

    Asymptotic enumeration of dense 0–1 matrices with specified line sums by Canfield, E. Rodney, Greenhill, Catherine, McKay, Brendan D.

    “…Let s = ( s 1 , s 2 , … , s m ) and t = ( t 1 , t 2 , … , t n ) be vectors of non-negative integers with ∑ i = 1 m s i = ∑ j = 1 n t j . Let B ( s , t ) be the…”
    Get full text
    Journal Article
  10. 10

    The Mahonian probability distribution on words is asymptotically normal by Canfield, E. Rodney, Janson, Svante, Zeilberger, Doron

    Published in Advances in applied mathematics (01-01-2011)
    “…The Mahonian statistic is the number of inversions in a permutation of a multiset with ai elements of type i, 1⩽i⩽m. The counting function for this statistic…”
    Get full text
    Journal Article
  11. 11

    Counting permutations by their alternating runs by Canfield, E. Rodney, Wilf, Herbert S.

    Published in Journal of combinatorial theory. Series A (01-02-2008)
    “…We find a formula for the number of permutations of [ n ] that have exactly s runs up and down. The formula is at once terminating, asymptotic, and exact. The…”
    Get full text
    Journal Article
  12. 12

    Uniform Convergence of an Asymptotic Approximation to Associated Stirling Numbers by Canfield, E. Rodney, Helton, J. William, Hughes, Jared A

    Published 02-09-2024
    “…Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least…”
    Get full text
    Journal Article
  13. 13

    THE MOTIF PROBLEM: GEOMETRIC REPRESENTATIONS OF SETS OF EQUIVALENCE RELATIONS by Canfield, E. Rodney, Fertig, Ron, Mauldin, R. Daniel, Moews, David

    “…A motif is a sequence of L points in ℝp satisfying certain equality conditions between specified coordinates, which are described by a motif specification. In…”
    Get full text
    Journal Article
  14. 14

    Asymptotic enumeration of correlation-immune boolean functions by Canfield, E. Rodney, Gao, Zhicheng, Greenhill, Catherine, McKay, Brendan D., Robinson, Robert W.

    Published in Cryptography and communications (01-04-2010)
    “…A boolean function of n boolean variables is correlation-immune of order  k if the function value is uncorrelated with the values of any k of the arguments…”
    Get full text
    Journal Article
  15. 15

    Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness by Bender, Edward, Canfield, Rodney, Gao, Zhicheng

    “…We define the notion of $t$-free for locally restricted compositions, which means roughly that if such a composition contains a part $c_i$ and nearby parts are…”
    Get full text
    Journal Article Conference Proceeding
  16. 16

    Random Feedback Shift Registers, and the Limit Distribution for Largest Cycle Lengths by Arratia, Richard, Canfield, E. Rodney, Hales, Alfred W

    Published 21-03-2019
    “…For a random binary noncoalescing feedback shift register of width $n$, with all $2^{2^{n-1}}$ possible feedback functions $f$ equally likely, the process of…”
    Get full text
    Journal Article
  17. 17

    The expected characteristic and permanental polynomials of the random Gram matrix by Martin, Jacob G, Canfield, E. Rodney

    Published 09-09-2013
    “…A t by n random matrix A is formed by sampling n independent random column vectors, each containing t components. The random Gram matrix of size n, G_n,…”
    Get full text
    Journal Article
  18. 18
  19. 19

    Engel's inequality for bell numbers by Canfield, E.Rodney

    Published in Journal of combinatorial theory. Series A (01-10-1995)
    “…K. Engel has conjectured that the average number of blocks in a partition of an n-set is a concave function of n. The average in question is a quotient of two…”
    Get full text
    Journal Article
  20. 20

    The Size of the Largest Antichain in the Partition Lattice by Canfield, E.Rodney

    Published in Journal of combinatorial theory. Series A (01-08-1998)
    “…Consider the posetΠnof partitions of ann-element set, ordered by refinement. The sizes of the various ranks within this poset are the Stirling numbers of the…”
    Get full text
    Journal Article