Related papers: Consecutive ones property testing: cut or swap
In a previous paper we have presented a CEGAR approach for the verification of parameterized systems with an arbitrary number of processes organized in an array or a ring. The technique is based on the iterative computation of parameterized…
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…
In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified through a top-down refinement process. In order to deal with the…
We propose a new nonparametric test for the supposition of independence between two continuous random variables. The test is based on the size of the longest increasing subsequence of a random permutation. We identified the independence…
Researchers faced with a sequence of candidate model specifications must often choose the best specification that does not violate a testable identification assumption. One option in this scenario is sequential specification tests:…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…
We propose an automated verification technique for hypersafety properties, which express sets of valid interrelations between multiple finite runs of a program. The key observation is that constructing a proof for a small representative set…
We consider the problem of testing whether a single coefficient is equal to zero in linear models when the dimension of covariates $p$ can be up to a constant fraction of sample size $n$. In this regime, an important topic is to propose…
In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…
Hypothesis about the parallelism of the regression lines in R multivariate simple linear models are studied in this paper. Tests on common intercept and sets of lines intersected at a fixed value, are also developed. An application in an…
Common intervals have been defined as a modelisation of gene clusters in genomes represented either as permutations or as sequences. Whereas optimal algorithms for finding common intervals in permutations exist even for an arbitrary number…
We give a distributed algorithm in the {\sf CONGEST} model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (DISC 2016), who recently initiated the study of property…
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…
In this paper we take closer look at recent developments for the chase procedure, and provide additional results. Our analysis allows us create a taxonomy of the chase variations and the properties they satisfy. Two of the most central…
This paper considers the joint distribution of elements of a random sample and an order statistic of the same sample. \ The motivation for this work stems from the important problem in reliability analysis, to estimate the number of…
In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.