Related papers: Testing Quasiperiodicity
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…
Let $M$ be a real $r\times c$ matrix and let $k$ be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity $\|M-SA\|$, where $A$ can be an arbitrary $k\times c$ matrix, and $S$ runs over all…
A method is introduced for the verification of nonclassicality in terms of moments of nonclassicality quasiprobability distributions. The latter are easily obtained from experimental data and will be denoted as nonclassicality moments.…
Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study…
When individuals in a population can be classified in classes or categories, the coverage of a sample, $C$, is defined as the probability that a randomly selected individual from the population belongs to a class represented in the sample.…
Subspace codes were introduced by K\"otter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component…
This paper addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t. It is an extensively studied problem in computer science, mainly due to its direct applications to…
Cloaking using complementary media was suggested by Lai et al. in [8]. The study of this problem faces two difficulties. Firstly, this problem is unstable since the equations describing the phenomenon have sign changing coefficients, hence…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We study property testing in the subcube conditional model introduced by Bhattacharyya and Chakraborty (2017). We obtain the first equivalence test for $n$-dimensional distributions that is quasi-linear in $n$, improving the previously…
We revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---through the prism of this elementary result---how to solve…
Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since Q may…
A generalization of quantum broadcasting protocol is presented. Here the goal is to copy an unknown input state into two subsystems which partially overlap. We show that the possibility of implementing these protocols strongly depends upon…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
A cycle cover of a bridgeless graph $G$ is a collection of simple cycles in $G$ such that each edge $e$ appears on at least one cycle. The common objective in cycle cover computation is to minimize the total lengths of all cycles. Motivated…
A novel matrix approximation problem is considered herein: observations based on a few fully sampled columns and quasi-polynomial structural side information are exploited. The framework is motivated by quantum chemistry problems wherein…
This paper introduces a new similarity measure, the covering similarity, that we formally define for evaluating the similarity between a symbolic sequence and a set of symbolic sequences. A pair-wise similarity can also be directly derived…
The quasiprobability representation of quantum states addresses two main concerns, the identification of nonclassical features and the decomposition of the density operator. While the former aspect is a main focus of current research, the…
Cloaking using a volumetric structure composed of stacked two-dimensional transmission-line networks is verified with measurements. The measurements are done in a waveguide, in which an array of metallic cylinders is inserted causing a…
We consider coherent sublinear expectations on a measurable space, without assuming the existence of a dominating probability measure. By considering a decomposition of the space in terms of the supports of the measures representing our…