
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-1509
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-12 (Paper #9)
- Published: 31/12/2020
We introduce a polygonal cylinder
- Research article
- https://doi.org/10.61091/ojac-1508
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-10 (Paper #8)
- Published: 31/12/2020
In this paper we find recurrence relations for the asymptotic probability a vertex is
- Research article
- https://doi.org/10.61091/ojac-1507
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-34 (Paper #7)
- Published: 31/12/2020
Binomial coefficients of the form
- Research article
- https://doi.org/10.61091/ojac-1506
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-42 (Paper #6)
- Published: 31/12/2020
In this paper, we analyze the stochastic properties of some large size (area) polyominoes’ perimeter such that the directed column-convex polyomino, the columnconvex polyomino, the directed diagonally-convex polyomino, the staircase (or parallelogram) polyomino, the escalier polyomino, the wall (orbargraph) polyomino. All polyominoes considered here are made of contiguous, not-empty columns, without holes, such that each column must be adjacent to some cell of the previous column. We compute the asymptotic (for large size n) Gaussian distribution of the perimeter, including the corresponding Markov property of the chain of columns, and the convergence to classical Brownian motions of the perimeter seen as a trajectory according to the successive columns. All polyominoes of size n are considered as equiprobable.
- Research article
- https://doi.org/10.61091/ojac-1505
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-10 (Paper #5)
- Published: 31/12/2020
Convolution conditions are discussed for the
- Research article
- https://doi.org/10.61091/ojac-1504
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-27 (Paper #4)
- Published: 31/12/2020
we discuss a framework for constructing large subsets of
- Research article
- https://doi.org/10.61091/ojac-1503
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-10 (Paper #3)
- Published: 31/12/2020
Let
- Research article
- https://doi.org/10.61091/ojac-1502
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-18 (Paper #2)
- Published: 31/12/2020
In this paper, we study a class of sequences of polynomials linked to the sequence of Bell polynomials. Some sequences of this class have applications on the theory of hyperbolic differential equations and other sequences generalize Laguerre polynomials and associated Lah polynomials. We discuss, for these polynomials, their explicit expressions, relations to the successive derivatives of a given function, real zeros and recurrence relations. Some known results are significantly simplified.
- Research article
- https://doi.org/10.61091/ojac-1501
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 15, 2020
- Pages: 1-10 (Paper #1)
- Published: 31/12/2020
We show that if
- Research article
- https://doi.org/10.61091/ojac-1410
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 14, 2019
- Pages: 1-20 (Paper #10)
- Published: 31/12/2019
This paper gives some new results on mutually orthogonal graph squares (MOGS). These generalize mutually orthogonal Latin squares in an interesting way. As such, the topic is quite nice and should have broad appeal. MOGS have strong connections to core fields of finite algebra, cryptography, finite geometry, and design of experiments. We are concerned with the Kronecker product of mutually orthogonal graph squares to get new results of the mutually orthogonal certain graphs squares.