
Online Journal of Analytic Combinatorics
ISSN 1931-3365 (online)
The Online Journal of Analytic Combinatorics (OJAC) is a peer-reviewed electronic journal previously hosted by the University of Rochester and now published by Combinatorial Press. OJAC features research articles that span a broad spectrum of topics, including analysis, number theory, and combinatorics, with a focus on the convergence and interplay between these disciplines. The journal particularly welcomes submissions that incorporate one or more of the following elements: combinatorial results derived using analytic methods, analytic results achieved through combinatorial approaches, or a synthesis of combinatorics and analysis in either the methodologies or their applications
Information Menu
- Research article
- https://doi.org/10.61091/ojac-305
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 3, 2008
- Pages: - (Paper #5)
- Published: 29/01/2008
We study the generating functions for pattern-restricted
- Research article
- https://doi.org/10.61091/ojac-304
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 3, 2008
- Pages: 1-8 (Paper #4)
- Published: 29/01/2008
We extend an argument of Felix Behrend to show that fairly dense subsets of the integers exist which contain no solution to certain systems of linear equations.
- Research article
- https://doi.org/10.61091/ojac-303
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 3, 2008
- Pages: 1-6 (Paper #3)
- Published: 29/01/2008
- Research article
- https://doi.org/10.61091/ojac-302
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 3, 2008
- Pages: 1-14 (Paper #2)
- Published: 29/01/2008
- Research article
- https://doi.org/10.61091/ojac-301
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 3, 2008
- Pages: 1-11 (Paper #1)
- Published: 29/01/2008
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes. We also describe some of the history of these problems, dating to Polya’s Ph.D. thesis, and we discuss several applications of these formulas.
- Research article
- https://doi.org/10.61091/ojac-206
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 2, 2007
- Pages: 1-10 (paper #6)
- Published: 13/03/2007
Let
must contain three points
- Research article
- https://doi.org/10.61091/ojac-205
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 2, 2007
- Pages: 1-7 (paper #5)
- Published: 13/03/2007
In 1972, Bender and Knuth established a bijection between certain infinite matrices of non-negative integers and plane partitions and in [2] a bijection between Bender-Knuth matrices and n-color partitions was shown. Here we use this later bijection and translate the recently found n-color partition theoretic interpretations of four mock theta functions of S. Ramanujan in [1] to new combinatorial interpretations of the same mock theta functions involving Bender-Knuth matrices.
- Research article
- https://doi.org/10.61091/ojac-204
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 2, 2007
- Pages: 1-17 (paper #4)
- Published: 13/03/2007
We present analytical properties of a sequence of integers related to the evaluation of a rational integral. We also discuss an algorithm for the evaluation of the 2-adic valuation of these integers that has a combinatorial interpretation.
- Research article
- https://doi.org/10.61091/ojac-203
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 2, 2007
- Pages: 1-4 (paper #3)
- Published: 13/03/2007
It is proposed that finding the recursion relation and generating function for the (colored) Motzkin numbers of higher rank introduced recently is an interesting problem.
- Research article
- https://doi.org/10.61091/ojac-202
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 2, 2007
- Pages: Pages: 1-21 (Paper #2)
- Published: 13/03/2007
Let