Related papers: Matchgate signatures under variable permutations
This work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of solutions snapshots, what…
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…
P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…
We describe a birational map between subvarieties in the character varieties of mutative 3-manifolds. By studying the birational map, one can decide in certain circumstances whether a mutation surface is detected by an ideal point of the…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
In this paper, we present three necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are…
In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…
Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…
Irregularities in the metric tensor of a signature-changing space-time suggest that field equations on such space-times might be regarded as distributional. We review the formalism of tensor distributions on differentiable manifolds, and…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…
Let C be a finite set of $N elements and R = {R_1,R_2, ..,R_m} a family of M subsets of C. The family R verifies the consecutive ones property if there exists a permutation P of C such that each R_i in R is an interval of P. There already…
For any $n\geq 3$ and $ q\geq 3$, we prove that the {\sc Equality} function $(=_n)$ on $n$ variables over a domain of size $q$ cannot be realized by matchgates under holographic transformations. This is a consequence of our theorem on the…
We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending…
We identify and study relevant structural parameters for the problem PerfMatch of counting perfect matchings in a given input graph $G$. These generalize the well-known tractable planar case, and they include the genus of $G$, its apex…
Model checking is the process of deciding whether a system satisfies a given specification. Often, when the setting comprises multiple processes, the specifications are over sets of input and output signals that correspond to individual…