Related papers: Superselection in the presence of constraints
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
A detailed analysis of conditions on 2-body interaction potential, which ensure stability, superstability or strong superstability of statistical systems is given. There has been given the connection between conditions of superstability…
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they…
We investigate refined algebraic quantisation within a family of classically equivalent constrained Hamiltonian systems that are related to each other by rescaling a momentum-type constraint. The quantum constraint is implemented by a…
Exact procedures that follow Dirac's constraint quantization of gauge theories are usually technically involved and often difficult to implement in practice. We overview an "effective" scheme for obtaining the leading order semiclassical…
One-dimensional nonrelativistic systems are studied when time-independent potential interactions are involved. Their supersymmetries are determined and their closed subsets generating kinematical invariance Lie superalgebras are pointed…
We consider a huge quantum system that is subject to the charge superselection rule, which requires that any pure state must be an eigenstate of the total charge. We regard some parts of the system as "subsystems," and the rest as an…
We study a class of filters -- discrete finite-state transition systems employed as incremental stream transducers -- that have application to robotics: e.g., to model combinatorial estimators and also as concise encodings of feedback…
In this article, we prove that Dirac brackets for Hamiltonian and non-Hamiltonian constrained systems can be derived recursively. We then study the applicability of that formulation in analysis of some interesting physical models.…
Quantum mechanics allows coherent superposition between different states of matter. This quality is responsible for major non-classical phenomena that occur in quantum systems. Beyond states, coherent superpositions are also possible…
We analyze the canonical treatment of classical constrained mechanical systems formulated with a discrete time. We prove that under very general conditions, it is possible to introduce nonsingular canonical transformations that preserve the…
Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…
We consider a weakly coupled singularly perturbed variational elliptic system in a bounded smooth domain with Dirichlet boundary conditions. We show that, in the competitive regime, the number of fully nontrivial solutions with nonnegative…
We investigate entanglement properties of a recently introduced class of macroscopic quantum superpositions in two-mode mixed states. One of the tools we use in order to infer the entanglement in this non-Gaussian class of states is the…
Biologists and physicists have a rich tradition of modeling living systems with simple models composed of a few interacting components. Despite the remarkable success of this approach, it remains unclear how to use such finely tuned models…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability,…
In the study of ad hoc sensor networks, clustering plays an important role in energy conservation therefore analyzing the mechanics of such topology can be helpful to make logistic decisions .Using the theory of complex network the…
We analyze a macroscopic model with a maximal density constraint which describes short range repulsion in biological systems. This system aims at modeling finite-size particles which cannot overlap and repel each other when they are too…