Related papers: On the equivalence of two quantifier elimination t…
The aim of this short Note is to show that the Schr\"odinger and Heisenberg pictures of quantum mechanics are not equivalent unless one uses a quantization rule clearly stated by Born and Jordan in their famous 1925 paper. This rule is…
We investigate equivalences between the categories of perfects complexes of the quotients of two smooth projective schemes by the action of a finite group. As a result we give a necessary and sufficient condition for an equivalence between…
We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…
In this paper we show that the known models for $(\infty, 1)$-categories can all be extended to equivariant versions for any discrete group $G$. We show that in two of the models we can also consider actions of any simplicial group $G$.
The Bonnaf\'e-Rouquier equivalence can be seen as a modular analogue of Lusztig's Jordan decomposition for groups of Lie type. In this paper, we show that this equivalence can be lifted to include automorphisms of the finite group of Lie…
There are several ways to define program equivalence for functional programs with algebraic effects. We consider two complementing ways to specify behavioural equivalence. One way is to specify a set of axiomatic equations, and allow proof…
This paper investigates equivalence of square multivariate polynomial matrices with the determinant being some power of a univariate irreducible polynomial. We first generalized a global-local theorem of Vaserstein. Then we proved these…
We consider a binary statistical hypothesis testing problem, where $n$ independent and identically distributed random variables $Z^n$ are either distributed according to the null hypothesis $P$ or the alternate hypothesis $Q$, and only $P$…
We consider ontological models of a quantum system, assuming that not all probability distributions over the space $\Lambda$ of ontic states are preparable, only those belonging to a certain set C. We assume further that every POVM with a…
Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are…
Under appropriate spectral assumptions we prove two existence results for positive solutions of Lichnerowicz-type equations on complete manifolds. We also give a priori bounds and a comparison result that immediately yields uniqueness for…
With the wide range of quantum programming languages on offer now, efficient program verification and type checking for these languages presents a challenge -- especially when classical debugging techniques may affect the states in a…
We show that two related measures of k-coherence, called the standard and generalized robustness of k-coherence, are equal to each other when restricted to pure states. As a direct application of the result, we establish an equivalence…
We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…
In this paper, we prove that the Fechner and Stevens laws are equivalent (coincide up to isomorphism). Therefore, the problem does not exist.
The separability problem for word languages of a class $\mathcal{C}$ by languages of a class $\mathcal{S}$ asks, for two given languages $I$ and $E$ from $\mathcal{C}$, whether there exists a language $S$ from $\mathcal{S}$ that includes…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a…
We prove the existence of pairs of models of the same cardinality lambda which are very equivalent according to EF games, but not isomorphic. We continue the paper math.LO/0404222, but we don't rely on it.
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…