Related papers: Subsignatures of systems
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…
The aim of this paper is to study the full $K-$moment problem for measures supported on some particular non-linear subsets $K$ of an infinite dimensional vector space. We focus on the case of random measures, that is $K$ is a subset of all…
After reviewing the interplay between frames and lower semi-frames, we introduce the notion of lower semi-frame controlled by a densely defined operator $A$ or, for short, a \emph{weak lower $A$-semi-frame} and we study its properties. In…
We use the variety of one-parameter subgroups to define a numerical invariant for a representation of an infinitesimal group scheme. For an indecomposable module M of complexity 1, this number is related to the period of M.
Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…
The notions of $k$-separability and $k$-producibility are useful and expressive tools for the characterization of entanglement in multipartite quantum systems, when a more detailed analysis would be infeasible or simply needless. In this…
Once critical substations are compromised, attack agents can coordinate among their peers to plot for maximizing disruption using local control devices. For defenders, it is critical to enumerate and identify all digital relays to determine…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
A subfactor is an inclusion $N \subset M$ of von Neumann algebras with trivial centers. The simplest example comes from the fixed points of a group action $M^G \subset M$, and subfactors can be thought of as fixed points of more general…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
Given positive linear functional l on a vector lattice L of real functions, and a vector subspace M of L, we construct a vector subspace P(M) of M in such a way that 1) l is nullcontinuous on P(M), and 2) if l is nullcontinuous on M then…
Confident prediction is highly relevant in machine learning; for example, in applications such as medical diagnoses, wrong prediction can be fatal. For classification, there already exist procedures that allow to not classify data when the…
The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When…
Self-similarity is the property of a system being similar to a part of itself. We posit that a special class of behaviourally self-similar systems exhibits a degree of resilience to adversarial behaviour. We formalise the notions of system,…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
We consider a weakly supervised learning scenario where the supervision signal is generated by a transition function $\sigma$ of labels associated with multiple input instances. We formulate this problem as \emph{multi-instance Partial…
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…
Detecting and resolving violations of temporal constraints in real-time systems is both, time-consuming and resource-intensive, particularly in complex software environments. Measurement-based approaches are widely used during development,…
We analyse a specific instance of the general approach of reasoning based on forgetting by Lang and Marquis. More precisely, we discuss an approach for reasoning with inconsistent information using maximal consistent subsignatures, where a…