The distributions of sliding block patterns in finite samples and the inclusion-exclusion principles for partially ordered sets

11/29/2018
by   Hayato Takahashi, et al.
0

In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating function form on partially ordered sets, and show a simpler expression of generating functions of the number of pattern occurrences in finite samples. We show higher moments of the sliding block patterns and power of tests based on sliding block patterns.

READ FULL TEXT

page 1

page 2

research
10/15/2022

Encoding subshifts through sliding block codes

We prove a generalization of Krieger's embedding theorem, in the spirit ...
research
05/11/2021

The explicit formula of the distributions of the nonoverlapping words and its applications to statistical tests for random numbers

Bassino et al. 2010 and Regnier et al. 1998 showed the generating functi...
research
04/18/2023

Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

We present Sliding Block Hashing (Slick), a simple hash table data struc...
research
09/06/2021

Computational Complexity of Jumping Block Puzzles

In combinatorial reconfiguration, the reconfiguration problems on a vert...
research
07/29/2019

Partially Ordered Automata and Piecewise Testability

Universality is the question whether a system recognizes all words over ...
research
12/15/2020

A new perspective of paramodulation complexity by solving massive 8 puzzles

A sliding puzzle is a combination puzzle where a player slide pieces alo...
research
03/08/2021

Sliding Window Persistence of Quasiperiodic Functions

A function is called quasiperiodic if its fundamental frequencies are li...

Please sign up or login with your details

Forgot password? Click here to reset