Related papers: Quantifier-free induction for lists
We define and study a relative free entropy quantity, analogous in its properties to Voiculescu's relative free entropy Chi^*(...:B). Our definition uses matricial microstates, unlike his definition, which involves non-commutative Hilbert…
Lock-free data objects offer several advantages over their blocking counterparts, such as being immune to deadlocks and convoying and, more importantly, being highly concurrent. But they share a common disadvantage in that the operations…
Whitney's broken circuit theorem gives a graphical example to reduce the number of the terms in the sum of the inclusion-exclusion formula by a predicted cancellation. So far, the known cancellations for the formula strongly depend on the…
We prove that, for any positive integer $m$, a segment may be partitioned into $m$ possibly degenerate or empty segments with equal values of a continuous function $f$ of a segment, assuming that $f$ may take positive and negative values,…
The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation…
This paper studies left invertibility of discrete-time linear I/O quantized linear systems of dimension 1. Quantized outputs are generated according to a given partition of the state-space, while inputs are sequences on a finite alphabet.…
The principles behind the computation of protein-ligand binding free energies by Monte Carlo integration are described in detail. The simulation provides gas-phase binding free energies that can be converted to aqueous energies by solvation…
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of determining if the acceptance probability function of a…
We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…
Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…
Arrays are commonly used in a variety of software to store and process data in loops. Automatically proving safety properties of such programs that manipulate arrays is challenging. We present a novel verification technique, called…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
We present the first verified implementation of a decision procedure for the quantifier-free theory of partial and linear orders. We formalise the procedure in Isabelle/HOL and provide a specification that is made executable using…
In this article we introduce powerful tools and techniques from invariant theory to free analysis. This enables us to study free maps with involution. These maps are free noncommutative analogs of real analytic functions of several…
Fine-tuning pretrained language models (LMs) without making any architectural changes has become a norm for learning various language downstream tasks. However, for non-language downstream tasks, a common practice is to employ task-specific…
In this paper, we introduce the concept of graded m-nil clean ring to extend the existing notion of graded nil-clean ring introduced in [10]. We explore fundamental properties of these rings, emphasizing the interplay between the identity…
We describe an embarrassingly parallel, anytime Monte Carlo method for likelihood-free models. The algorithm starts with the view that the stochasticity of the pseudo-samples generated by the simulator can be controlled externally by a…
For many machine learning tasks, the input data lie on a low-dimensional manifold embedded in a high dimensional space and, because of this high-dimensional structure, most algorithms are inefficient. The typical solution is to reduce the…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
Given a closed oriented surface $\Sigma$ of genus at least two, the Goldman trace map defines a function from the vector space generated by the free homotopy classes of oriented closed curves to the Poisson algebra of regular functions on…