相关论文: On quantification with a finite universe
A new realist interpretation of quantum mechanics is introduced. Quantum systems are shown to have two kinds of properties: the usual ones described by values of quantum observables, which are called extrinsic, and those that can be…
We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…
In a topological space, a family of continuous mappings is called universal if its action, in at least one element of the space, is dense. If the mappings are unitary or trace-preserving completely positive, the notion of universality is…
We give examples of finite quantum permutation groups which arise from the twisting construction or as bicrossed products associated to exact factorizations in finite groups. We also give examples of finite quantum groups which are not…
Quantum cosmology may restrict the class of gauge models which unify electroweak and strong interactions. In particular, if one studies the normalizability criterion for the one-loop wave function of the universe in a de Sitter background…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
Quantum gauge theories with finite-dimensional representation spaces are constructed that can have canonical gauge field theories as singular limits. They describe nature as a recursive quantum assembly by iterating Fermi-Dirac…
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
A rigorous general definition of quantum probability is given, which is valid for elementary events and for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting…
By Fagin's Theorem, NP contains precisely those problems that can be described by formulas starting with an existential second-order quantifier, followed by only first-order quantifiers (ESO formulas). Subsequent research refined this…
We work out axioms for the duals $G\subset U_N^+$ of the finite quantum permutation groups, $F\subset S_N^+$ with $|F|<\infty$, and we discuss how the basic theory of such quantum permutation groups partly simplifies in the dual setting. We…
We introduce a notion of natural orderings of elements of finite connected quandles of order $n$. When the elements of such a quandle $Q$ are already ordered naturally, any automophism on $Q$ is a natural ordering. Although there are many…
A practical method is developed to deal with the second quantization of the many-body system containing the composite particles. In our treatment, the modes associated with composite particles are regarded approximately as independent ones…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…
We determine the finite groups whose real irreducible representations have different degrees.
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
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…
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…
If k is a commutative field and G a reductive (connected) algebraic group over k, we give bounds for the orders of the finite subgroups of G(k); these bounds depends on the type of G and on the Galois groups of the cyclotomic extensions of…