Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Lavee, Nir"'
Autor:
Beniamini, Gal, Lavee, Nir
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result is an $\wid
Externí odkaz:
http://arxiv.org/abs/2407.04971
A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$ that satisf
Externí odkaz:
http://arxiv.org/abs/2306.16954
The automation of decision procedures makes certification essential. We suggest to use determinacy of turn-based two-player games with regular winning conditions in order to generate certificates for the number of states that a deterministic finite a
Externí odkaz:
http://arxiv.org/abs/2107.01566
Publikováno v:
Innovations in Systems & Software Engineering; Sep2022, Vol. 18 Issue 3, p405-416, 12p
