Nir Lavee

activity

20212025

most citedCertifying DFA Bounds for Recognition and Separation

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Time to Cycle

Nir Lavee, Nati Linial

Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_{n}$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\bi…

math.CO2023

How Balanced Can Permutations Be?

Gal Beniamini, Nir Lavee, Nati Linial

A permutation $π \in S_{n}$ is $k$ -balanced if every permutation of order $k$ occurs in $π$ equally often, through order-isomorphism. In this paper, we explicitly construct $…