The following pages link to Neil J. Calkin (Q927732):
Displaying 50 items.
- Elliptic curves, modular forms, and sums of Hurwitz class numbers (Q927735) (← links)
- Finite field elements of high order arising from modular curves (Q1009164) (← links)
- A curious binomial identity (Q1331998) (← links)
- Counting generalized sum-free sets (Q1379641) (← links)
- On the structure of a random sum-free set of positive integers (Q1584387) (← links)
- Averaging sequences, deranged mappings, and a problem of Lampert and Slater (Q1584653) (← links)
- Cancellation in cyclic consecutive systems (Q1612290) (← links)
- (Q1856348) (redirect page) (← links)
- Improved bounds for the number of forests and acyclic orientations in the square lattice (Q1856350) (← links)
- Counting sets of integers, no \(k\) of which sum to another (Q1912293) (← links)
- Minimum weight and dimension formulas for some geometric codes (Q1963165) (← links)
- Recounting the Rationals (Q2757471) (← links)
- Herbert S. Wilf (1931–2012) (Q2813103) (← links)
- (Q2855594) (← links)
- Discrete Bernoulli convolutions: An algorithmic approach toward bound improvement (Q3003570) (← links)
- (Q3015599) (← links)
- Euler-Boole Summation Revisited (Q3107062) (← links)
- (Q3377505) (← links)
- (Q3378218) (← links)
- (Q3415019) (← links)
- (Q3429476) (← links)
- (Q3429492) (← links)
- Computing the integer partition function (Q3433775) (← links)
- Probabilistic analysis of a parallel algorithm for finding maximal independent sets (Q3489456) (← links)
- On the Number of Sum-Free Sets (Q3491644) (← links)
- (Q3581885) (← links)
- (Q3581911) (← links)
- (Q3615973) (← links)
- (Q3629018) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- Factors of sums of powers of binomial coefficients (Q4236026) (← links)
- On Subgraph Sizes in Random Graphs (Q4291207) (← links)
- Dependent Sets of Constant Weight Binary Vectors (Q4354588) (← links)
- New Ramsey Bounds from Cyclic Graphs of Prime Order (Q4377444) (← links)
- Almost Odd Random Sum-Free Sets (Q4383734) (← links)
- The Number of Independent Sets in a Grid Graph (Q4388978) (← links)
- (Q4430889) (← links)
- What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments (Q4576109) (← links)
- Continued Logarithms and Associated Continued Fractions (Q4595625) (← links)
- Conditions on Periodicity for Sum-Free Sets (Q4717344) (← links)
- (Q4718181) (← links)
- On a class of aperiodic sum-free sets (Q4885202) (← links)
- (Q4894600) (← links)
- Reviews (Q5006000) (← links)
- Log transformations: What not to expect when you’re expecting (Q5079877) (← links)
- A Fractal Eigenvector (Q5082412) (← links)
- What Newton Might Have Known: Experimental Mathematics in the Classroom (Q5163940) (← links)
- Stochastic flow diagrams (Q5168377) (← links)
- The topology of macro financial flows: An application of stochastic flow diagrams (Q5168378) (← links)
- (Q5292368) (← links)
