Neil J. Calkin

From MaRDI portal
Person:927732

Available identifiers

zbMath Open calkin.neil-jWikidataQ28944095 ScholiaQ28944095MaRDI QIDQ927732

List of research outcomes





PublicationDate of PublicationType
A fractal eigenvector2022-06-16Paper
Log transformations: What not to expect when you’re expecting2022-05-30Paper
What Newton might have known: experimental mathematics in the classroom2021-11-09Paper
Reviews2021-08-12Paper
What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments2018-07-12Paper
Continued logarithms and associated continued fractions2017-12-05Paper
Herbert S. Wilf (1931--2012)2016-06-15Paper
Stochastic flow diagrams2014-07-04Paper
The topology of macro financial flows: an application of stochastic flow diagrams2014-07-04Paper
https://portal.mardi4nfdi.de/entity/Q54054992014-04-02Paper
Taking the convoluted out of Bernoulli convolutions: a discrete approach2013-10-25Paper
Euler-Boole summation revisited2012-01-01Paper
Computing strategies for graphical Nim2011-07-13Paper
Discrete Bernoulli convolutions: an algorithmic approach toward bound improvement2011-05-27Paper
On the domination of kings2010-09-02Paper
Efficient cross comparison graphs2010-09-02Paper
Divisibility properties of the 5-regular and 12-regular partition functions2009-05-26Paper
Finite field elements of high order arising from modular curves2009-03-31Paper
https://portal.mardi4nfdi.de/entity/Q36159732009-03-24Paper
Elliptic curves, modular forms, and sums of Hurwitz class numbers2008-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52923682007-06-20Paper
Computing the integer partition function2007-05-02Paper
Counting kings: as easy as \(\lambda_1,\lambda_2,\lambda_3\dots\)2007-04-02Paper
Counting kings: explicit formulas, recurrence relations, and generating functions! Oh my!2007-04-02Paper
Trivial Selmer groups and even partitions of a graph2007-01-12Paper
Linear independence in a random binary vector model2006-03-30Paper
Difference density and aperiodic sum-free sets2006-03-23Paper
https://portal.mardi4nfdi.de/entity/Q56951102005-10-11Paper
https://portal.mardi4nfdi.de/entity/Q54635342005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44308892003-10-13Paper
Improved bounds for the number of forests and acyclic orientations in the square lattice2003-05-13Paper
Cancellation in cyclic consecutive systems2002-08-22Paper
Recounting the Rationals2001-11-26Paper
Averaging sequences, deranged mappings, and a problem of Lampert and Slater2001-09-18Paper
On the structure of a random sum-free set of positive integers2000-11-02Paper
Minimum weight and dimension formulas for some geometric codes2000-01-24Paper
Factors of sums of powers of binomial coefficients1999-07-20Paper
Almost Odd Random Sum-Free Sets1999-01-06Paper
Counting generalized sum-free sets1998-11-02Paper
The Number of Independent Sets in a Grid Graph1998-05-11Paper
New Ramsey Bounds from Cyclic Graphs of Prime Order1998-02-09Paper
Dependent Sets of Constant Weight Binary Vectors1997-10-19Paper
Conditions on Periodicity for Sum-Free Sets1997-09-03Paper
On a class of aperiodic sum-free sets1997-07-20Paper
Counting sets of integers, no \(k\) of which sum to another1997-04-24Paper
https://portal.mardi4nfdi.de/entity/Q47181811996-12-01Paper
https://portal.mardi4nfdi.de/entity/Q48946001996-10-07Paper
A curious binomial identity1994-09-27Paper
On Subgraph Sizes in Random Graphs1994-08-10Paper
On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph1992-06-28Paper
On the Number of Sum-Free Sets1990-01-01Paper
Probabilistic analysis of a parallel algorithm for finding maximal independent sets1990-01-01Paper

Research outcomes over time

This page was built for person: Neil J. Calkin