A. Ozdemir

activity

20232025

321

-avoiding permutations

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2025

The $k$ -Plancherel measure and a Finite Markov Chain

Svante Linusson, Alperen Özdemir

Let $P_{k} (n)$ denote the set of partitions of $n$ whose largest part is bounded by $k,$ which are in well-known bijection with $(k + 1)$ -cores $C_{k}$ . We study a gr…

math.PR2024

A logical limit law for the sequential model of preferential attachment graphs

Alperen Özdemir

For a sequence of random graphs, the limit law we refer to is the existence of a limiting probability of any graph property that can be expressed in terms of predicate logic. A zer…

math.PR2023★ 2 cited

First-order convergence for $321$ -avoiding permutations

Alperen Özdemir

We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $φ$ , the proportion of objects satisfying $φ$ converges to a lim…

The k-Plancherel measure and a Finite Markov Chain

A logical limit law for the sequential model of preferential attachment graphs

First-order convergence for 321-avoiding permutations

The $k$ -Plancherel measure and a Finite Markov Chain

First-order convergence for $321$ -avoiding permutations