E. Lerner

activity

20072021

most citedThe Zipf law for random texts with unequal probabilities of occurrence of letters and the Pascal pyramid

7 citations · 25 across the 12 of their papers we have counts for

collaborators

12 papers

math.CO2021

Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences

E. Yu. Lerner, R. E. Lerner

Given $n$ men, $n$ women, and $n$ dogs, each man has an incomplete preference list of women, each woman does an incomplete preference list of dogs, and each dog does an incomplete…

cs.CL2016

Verifying Heaps' law using Google Books Ngram data

Vladimir V. Bochkarev, Eduard Yu. Lerner, Anna V. Shevlyakova

This article is devoted to the verification of the empirical Heaps law in European languages using Google Books Ngram corpus data. The connection between word distribution frequenc…

math.CO2016★ 1 cited

The $α$ -representation for the characteristic function of a matroid

Eduard Yu. Lerner

Let $M = (E, B)$ be an $F_{q}$ -linear matroid; denote by $B$ the family of its bases, $s (M; α) = \sum_{B \in B} \prod_{e \in B} α_{e}$ , where ${α_e\in \math…

math.CO2016

Flow polynomials as Feynman amplitudes and their $α$ -representation

Eduard Yu. Lerner, Andrey P. Kuptsov, Sofya A. Mukhamedjanova

Let $G$ be a connected graph; denote by $τ (G)$ the set of its spanning trees. Let $F_{q}$ be a finite field, $s (α, G) = \sum_{T \in τ (G)} \prod_{e \in E (T)} α_{e}$ , where ${α_e\in \…

math.PR2016★ 1 cited

The exact power law and Pascal pyramid

Vladimir V. Bochkarev, Eduard Yu. Lerner

Let $ω_{0}, ω_{1}, \dots, ω_{n}$ be a full set of outcomes (letters, symbols) and let positive $p_{i}$ , $i = 0, \dots, n$ , be their probabilities ( $\sum_{i = 0}^{n} p_{i} = 1$ ). Let us treat $ω_{0}$ as…

cs.IT2012★ 6 cited

Zipf and non-Zipf Laws for Homogeneous Markov Chain