相关论文: Generating Compatibility Conditions in Mathematica…
Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often…
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…
We employ combinatorial techniques to present an explicit formula for the coefficients in front of Chern classes involving in the Hattori-Stong integrability conditions. We also give an evenness condition for the signature of stably…
We realize an explicit conformal mapping between the state and operator pictures in a class of (2+1)-dimensional non-Lorentzian field theories with SU(1,2)$\times$U(1) conformal symmetry. The state picture arises from null reducing…
We continue our study of operator algebras with contractive approximate identities (cais). In earlier papers we have introduced and studied a new notion of positivity in operator algebras, with an eye to extending certain $C^*$-algebraic…
A coherent state is defined conventionally in different ways such as a displaced vacuum state, an eigenket of annihilation operator or as an infinite dimensional Poissonian superposition of Fock states. In this work, we describe a…
It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…
One of the problems of formal verification is that it is not functionally complete due the incompleteness of specifications. An implementation meeting an incomplete specification may still have a lot of bugs. In testing, this issue is…
In most introductory courses on quantum mechanics one is taught that the Hamiltonian operator must be Hermitian in order that the energy levels be real and that the theory be unitary (probability conserving). To express the Hermiticity of a…
The problem of synthesis of gate-level descriptions of digital circuits from behavioural specifications written in higher-level programming languages (hardware compilation) has been studied for a long time yet a definitive solution has not…
The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…
For a subalgebra of a generic CCR algebra, we consider the relative entropy between a general (not necessarily pure) quasifree state and a coherent excitation thereof. We give a unified formula for this entropy in terms of single-particle…
Null shells are a useful geometric construction to study the propagation of infinitesimally thin concentrations of massless particles or impulsive waves. After recalling the necessary and sufficient conditions obtained in [28] that allow…
Measurement incompatibility underpins randomness generation in nonlocal phenomena. However, at its root, a more fundamental quantum feature is noncommuting (or coherent) measurements. This raises a central question: How can we operationally…
We study when local reduced density operators, viewed as quantum marginals, can be assembled into a global quantum state with a prescribed Markov structure. The starting point is a canonical logarithmic construction $T(\mathcal R)$, the…
The nonlinear geometry of operator spaces has recently started to be investigated. Many notions of nonlinear embeddability have been introduced so far, but, as noticed before by other authors, it was not clear whether they could be…
We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…
Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the…
Safety alignment in large language models relies on behavioral training that can be overridden when sufficiently strong in-context patterns compete with learned refusal behaviors. We introduce Involuntary In-Context Learning (IICL), an…
The linear complementarity problem (LCP) is a general set membership problem that includes quadratic cone programming as a special case. In this work we consider a homogeneous embedding of the LCP, which encodes both the optimality…