Related papers: A Note on Occur-Check

The main ideas behind nuclear supersymmetry are presented, starting from the basic concepts of symmetry and the methods of group theory in physics. We propose new, more stringent experimental tests that probe the supersymmetry…

The current analysis of atmospheric neutrinos by the Super-Kamiokande Collaboration is based only on fully-contained one-ring events and partially contained events. We show that the up-down ratio of fully-contained, inclusive, multi-ring…

We observe that the classical Cartesian product construction for the intersection of (languages of) nondeterministic finite automata (NFA) is non-optimal in the worst case, if the automata have many transitions. For a fixed alphabet, the…

We develop a model for point processes on the real line, where the intensity can be locally unbounded without inducing an explosion. In contrast to an orderly point process, for which the probability of observing more than one event over a…

Here, we accept the results of quantum experiments at face value and we make no apology for the failure of classical physics. Just as Wheeler has called particle detection an "act of creation", we suggest that, in some circumstances, not…

Universal quantifiers occur frequently in proof obligations produced by program verifiers, for instance, to axiomatize uninterpreted functions and to express properties of arrays. SMT-based verifiers typically reason about them via…

Solitude verification is arguably one of the simplest fundamental problems in distributed computing, where the goal is to verify that there is a unique contender in a network. This paper devises a quantum algorithm that exactly solves the…

The multinomial model is one of the simplest statistical models. When constraints are placed on the possible values for the probabilities, however, it becomes much more difficult to deal with. Model checking and checking for prior-data…

A great variety of static analyses that compute safety properties of single-thread programs have now been developed. This paper presents a systematic method to extend a class of such static analyses, so that they handle programs with…

The paper shows that matching without replacement on propensity scores produces estimators that generally are inconsistent for the average treatment effect of the treated. To achieve consistency, practitioners must either assume that no…

We consider a general method for the approximation of the distribution of a process conditioned to not hit a given set. Existing methods are based on particle system that are failable, in the sense that, in many situations , they are not…

The analysis of the sample of charged current quasi elastic events collected by the MiniBooNE Collaboration suggests that the scheme successfully employed to describe electron-nucleus scattering fails to explain neutrino-nucleus cross…

The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…

As quantum computers and simulators begin to produce results that cannot be verified classically, it becomes imperative to develop a variety of tools to detect and diagnose experimental errors on these devices. While state or process…

We prove a strong concentration result about the natural collision estimator, which counts the number of collisions that occur within an iid sample. This estimator is at the heart of algorithms used for uniformity testing and entropy…

Unitarity is a fundamental property of any theory required to ensure we work in a theoretically consistent framework. In comparison with the quark sector, experimental tests of unitarity for the 3x3 neutrino mixing matrix are considerably…

With the exception of superselection rules, there are no known explicit violations of the Principle of quantum Superposition. However, quantum measurement and the emergence of classicality seem to imply that the Principle of Superposition…

We give an algorithm for the class of second order unification problems in which second order variables have at most one occurrence.

Atomicity is a ubiquitous assumption in distributed computing, under which actions are indivisible and appear sequential. In classical computing, this assumption has several theoretical and practical guarantees. In quantum computing,…

We investigate a detector scheme designed to measure the arrival of a particle at $x=0$ during a finite time interval. The detector consists of a two state system which undergoes a transition from one state to the other when the particle…