David Callan

According to our database1, David Callan authored at least 54 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters.
Electron. J. Comb., 2023

2021
Statistics on Bargraphs of Catalan Words.
J. Autom. Lang. Comb., 2021

Permutations avoiding 4321 and 3241 have an algebraic generating function.
Discret. Math. Theor. Comput. Sci., 2021

2017
Revitalized Automatic Proofs: Demonstrations.
Integers, 2017

Wilf classification of triples of 4-letter patterns II.
Discret. Math. Theor. Comput. Sci., 2017

Wilf classification of triples of 4-letter patterns I.
Discret. Math. Theor. Comput. Sci., 2017

2015
Some Combinatorial Arrays Related to the Lotka-Volterra System.
Electron. J. Comb., 2015

2013
Valuations and Combinatorics of Truncated Exponential Sums.
Integers, 2013

2012
Flexagons Lead to a Catalan Number Identity.
Am. Math. Mon., 2012

The run transform.
Discret. Math., 2012

2010
Klazar trees and perfect matchings.
Eur. J. Comb., 2010

2009
Oddly Triangulated Polygons: 11298 [2007, 547].
Am. Math. Mon., 2009

Uniformly Distributed Valleys: 11312 [2007, 744].
Am. Math. Mon., 2009

Divisibility of a Central Binomial Sum: 11292&11307 [2007, 451&640].
Am. Math. Mon., 2009

Pattern avoidance in "flattened" partitions.
Discret. Math., 2009

2008
Problem 11362.
Am. Math. Mon., 2008

A Determinant of Stirling Cycle Numbers Counts Unlabeled Acyclic Single-Source Automata.
Discret. Math. Theor. Comput. Sci., 2008

Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials.
Electron. J. Comb., 2008

2007
Problem 11312.
Am. Math. Mon., 2007

Problem 11307.
Am. Math. Mon., 2007

Problem 11292.
Am. Math. Mon., 2007

A Bijection on Dyck Paths and its Cycle Structure.
Electron. J. Comb., 2007

2006
The Maximum Associativeness of Division: 11091.
,
et al.
Am. Math. Mon., 2006

A Lattice Path Equality: 11106.
Am. Math. Mon., 2006

2005
Dyck Paths Skipping Every Fourth Point: 11013.
Am. Math. Mon., 2005

2004
Counting a Set of Rooted Trees: 10952.
Am. Math. Mon., 2004

Problem 11106.
Am. Math. Mon., 2004

Problem 11091.
Am. Math. Mon., 2004

A Uniformly Distributed Statistic on a Class of Lattice Paths.
Electron. J. Comb., 2004

2003
Another Description of the Central Delannoy Numbers: 10894.
Am. Math. Mon., 2003

Another Binomial Coefficient Identity: 10878.
Am. Math. Mon., 2003

A Permanent Fixture: 10925.
Am. Math. Mon., 2003

Problem 11013.
Am. Math. Mon., 2003

2002
A Recursively Defined Sequence of Functions: 10785.
Am. Math. Mon., 2002

Problem 10952.
Am. Math. Mon., 2002

Problem 10925.
Am. Math. Mon., 2002

A Property of the Binary Sum of a Family of Sets: 10865.
Am. Math. Mon., 2002

2001
A Rational Generating Function for Relative Divisors: 10750.
Am. Math. Mon., 2001

A Generalization of Hall's Theorem: 10701.
Am. Math. Mon., 2001

Another Path to Generalized Catalan Numbers: 10751.
Am. Math. Mon., 2001

2000
Interrupted Partitions: 10629.
Am. Math. Mon., 2000

A Sum of Chebyshev Inequalities: 10687.
Am. Math. Mon., 2000

A Property of Some Normal Matrices: 10645.
Am. Math. Mon., 2000

Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon., 2000

When a Multiple of π/2 is Close to an Integer: 10640.
Am. Math. Mon., 2000

Permutation Parameters with the Same Distribution: 10634.
Am. Math. Mon., 2000

Another Type of Lattice Path: 10658.
Am. Math. Mon., 2000

An Identity Involving Derangements: 10643.
Am. Math. Mon., 2000

Analysis of a French Inheritance Law: 10652.
Am. Math. Mon., 2000

The Value of Primitive Words: 10636.
Am. Math. Mon., 2000

Periodic Points and Forests: 10666.
Am. Math. Mon., 2000

A Recurrence Generating Multiples of Primes: 10655.
Am. Math. Mon., 2000

Rogers-Ramanujan Partitions: 10627.
Am. Math. Mon., 2000

Partitions and Pentagonal Numbers: 10628.
Am. Math. Mon., 2000


  Loading...