On hyperbolicity of SU(2)-equivariant, punctured disc bundles over the complex affine quadric

Given a holomorphic line bundle over the complex affine quadric $Q^2$, we investigate its Stein, SU(2)-equivariant disc bundles. Up to equivariant biholomorphism, these are all contained in a maximal one, say $\Omega_{max}$. By removing the zero section to $\Omega_{max}$ one obtains the unique Stein, SU(2)-equivariant, punctured disc bundle over $Q^2$ which contains entire curves. All other such punctured disc bundles are shown to be Kobayashi hyperbolic.Comment: 15 pages, v2: minor changes, to appear in Transformation Group

An Algorithmic Test for Diagonalizability of Finite-Dimensional PT-Invariant Systems

A non-Hermitean operator does not necessarily have a complete set of eigenstates, contrary to a Hermitean one. An algorithm is presented which allows one to decide whether the eigenstates of a given PT-invariant operator on a finite-dimensional space are complete or not. In other words, the algorithm checks whether a given PT-symmetric matrix is diagonalizable. The procedure neither requires to calculate any single eigenvalue nor any numerical approximation.Comment: 13 pages, 1 figur

Statistical characterization of the forces on spheres in an upflow of air

The dynamics of a sphere fluidized in a nearly-levitating upflow of air were previously found to be identical to those of a Brownian particle in a two-dimensional harmonic trap, consistent with a Langevin equation [Ojha {\it et al.}, Nature {\bf 427}, 521 (2004)]. The random forcing, the drag, and the trapping potential represent different aspects of the interaction of the sphere with the air flow. In this paper we vary the experimental conditions for a single sphere, and report on how the force terms in the Langevin equation scale with air flow speed, sphere radius, sphere density, and system size. We also report on the effective interaction potential between two spheres in an upflow of air.Comment: 7 pages, experimen

How to Test for Diagonalizability: The Discretized PT-Invariant Square-Well Potential

Given a non-hermitean matrix M, the structure of its minimal polynomial encodes whether M is diagonalizable or not. This note will explain how to determine the minimal polynomial of a matrix without going through its characteristic polynomial. The approach is applied to a quantum mechanical particle moving in a square well under the influence of a piece-wise constant PT-symmetric potential. Upon discretizing the configuration space, the system is decribed by a matrix of dimension three. It turns out not to be diagonalizable for a critical strength of the interaction, also indicated by the transition of two real into a pair of complex energy eigenvalues. The systems develops a three-fold degenerate eigenvalue, and two of the three eigenfunctions disappear at this exceptional point, giving a difference between the algebraic and geometric multiplicity of the eigenvalue equal to two.Comment: 5 page

Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating reachability probabilities. Based on the existing works that stretch across different communities (formal verification, control theory, etc.), we offer a unifying account. In particular, we emphasize the role of order-theoretic fixed points---a classic topic in computer science---in the analysis of probabilistic programs. This leads us to two new martingale-based techniques, too. We give rigorous proofs for their soundness and completeness. We also make an experimental comparison using our implementation of template-based synthesis algorithms for those martingales

Probabilistic Timed Automata with Clock-Dependent Probabilities

Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent probabilistic timed automata. On the other hand, we show that the maximum and minimum probability of reaching a certain location in clock-dependent probabilistic timed automata can be approximated using a region-graph-based approach.Comment: Full version of a paper published at RP 201

A New Simulation Metric to Determine Safe Environments and Controllers for Systems with Unknown Dynamics

We consider the problem of extracting safe environments and controllers for reach-avoid objectives for systems with known state and control spaces, but unknown dynamics. In a given environment, a common approach is to synthesize a controller from an abstraction or a model of the system (potentially learned from data). However, in many situations, the relationship between the dynamics of the model and the \textit{actual system} is not known; and hence it is difficult to provide safety guarantees for the system. In such cases, the Standard Simulation Metric (SSM), defined as the worst-case norm distance between the model and the system output trajectories, can be used to modify a reach-avoid specification for the system into a more stringent specification for the abstraction. Nevertheless, the obtained distance, and hence the modified specification, can be quite conservative. This limits the set of environments for which a safe controller can be obtained. We propose SPEC, a specification-centric simulation metric, which overcomes these limitations by computing the distance using only the trajectories that violate the specification for the system. We show that modifying a reach-avoid specification with SPEC allows us to synthesize a safe controller for a larger set of environments compared to SSM. We also propose a probabilistic method to compute SPEC for a general class of systems. Case studies using simulators for quadrotors and autonomous cars illustrate the advantages of the proposed metric for determining safe environment sets and controllers.Comment: 22nd ACM International Conference on Hybrid Systems: Computation and Control (2019

Effects of invisible particle emission on global inclusive variables at hadron colliders

We examine the effects of invisible particle emission in conjunction with QCD initial state radiation (ISR) on quantities designed to probe the mass scale of new physics at hadron colliders, which involve longitudinal as well as transverse final-state momenta. This is an extension of our previous treatment, arXiv:0903.2013, of the effects of ISR on global inclusive variables. We present resummed results on the visible invariant mass distribution and compare them to parton-level Monte Carlo results for top quark and gluino pair-production at the LHC. There is good agreement as long as the visible pseudorapidity interval is large enough (eta ~ 3). The effect of invisible particle emission is small in the case of top pair production but substantial for gluino pair production. This is due mainly to the larger mass of the intermediate particles in gluino decay (squarks rather than W-bosons). We also show Monte Carlo modelling of the effects of hadronization and the underlying event. The effect of the underlying event is large but may be approximately universal.Comment: 22 pages, expanded sections and other minor modifications. Version published in JHE

Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution

A birth-death process is a continuous-time Markov chain that counts the number of particles in a system over time. In the general process with $n$ current particles, a new particle is born with instantaneous rate $\lambda_n$ and a particle dies with instantaneous rate $\mu_n$. Currently no robust and efficient method exists to evaluate the finite-time transition probabilities in a general birth-death process with arbitrary birth and death rates. In this paper, we first revisit the theory of continued fractions to obtain expressions for the Laplace transforms of these transition probabilities and make explicit an important derivation connecting transition probabilities and continued fractions. We then develop an efficient algorithm for computing these probabilities that analyzes the error associated with approximations in the method. We demonstrate that this error-controlled method agrees with known solutions and outperforms previous approaches to computing these probabilities. Finally, we apply our novel method to several important problems in ecology, evolution, and genetics