Promptness does not imply superlow cuppability

2009 ◽  
Vol 74 (4) ◽  
pp. 1264-1272 ◽  
Author(s):  
David Diamondstone

AbstractA classical theorem in computability is that every promptly simple set can be cupped in the Turing degrees to some complete set by a low c.e. set. A related question due to A. Nies is whether every promptly simple set can be cupped by a superlow c.e. set, i.e. one whose Turing jump is truth-table reducible to the halting problem ∅′. A negative answer to this question is provided by giving an explicit construction of a promptly simple set that is not superlow cuppable. This problem relates to effective randomness and various lowness notions.

2014 ◽  
Vol 79 (3) ◽  
pp. 676-692 ◽  
Author(s):  
GEORGE BARMPALIAS ◽  
ROD G. DOWNEY

AbstractTheK-trivial sets form an ideal in the Turing degrees, which is generated by its computably enumerable (c.e.) members and has an exact pair below the degree of the halting problem. The question of whether it has an exact pair in the c.e. degrees was first raised in [22, Question 4.2] and later in [25, Problem 5.5.8].We give a negative answer to this question. In fact, we show the following stronger statement in the c.e. degrees. There exists aK-trivial degreedsuch that for all degreesa, bwhich are notK-trivial anda > d, b > dthere exists a degreevwhich is notK-trivial anda > v, b > v. This work sheds light to the question of the definability of theK-trivial degrees in the c.e. degrees.


2020 ◽  
Vol 80 (10) ◽  
Author(s):  
Upalaparna Banerjee ◽  
Joydeep Chakrabortty ◽  
Suraj Prakash ◽  
Shakeel Ur Rahaman

AbstractThe dynamics of the subatomic fundamental particles, represented by quantum fields, and their interactions are determined uniquely by the assigned transformation properties, i.e., the quantum numbers associated with the underlying symmetry of the model under consideration. These fields constitute a finite number of group invariant operators which are assembled to build a polynomial, known as the Lagrangian of that particular model. The order of the polynomial is determined by the mass dimension. In this paper, we have introduced an automated $${\texttt {Mathematica}}^{\tiny \textregistered }$$ Mathematica ® package, GrIP, that computes the complete set of operators that form a basis at each such order for a model containing any number of fields transforming under connected compact groups. The spacetime symmetry is restricted to the Lorentz group. The first part of the paper is dedicated to formulating the algorithm of GrIP. In this context, the detailed and explicit construction of the characters of different representations corresponding to connected compact groups and respective Haar measures have been discussed in terms of the coordinates of their respective maximal torus. In the second part, we have documented the user manual of GrIP that captures the generic features of the main program and guides to prepare the input file. We have attached a sub-program CHaar to compute characters and Haar measures for $$SU(N), SO(2N), SO(2N+1), Sp(2N)$$ S U ( N ) , S O ( 2 N ) , S O ( 2 N + 1 ) , S p ( 2 N ) . This program works very efficiently to find out the higher mass (non-supersymmetric) and canonical (supersymmetric) dimensional operators relevant to the effective field theory (EFT). We have demonstrated the working principles with two examples: the standard model (SM) and the minimal supersymmetric standard model (MSSM). We have further highlighted important features of GrIP, e.g., identification of effective operators leading to specific rare processes linked with the violation of baryon and lepton numbers, using several beyond standard model (BSM) scenarios. We have also tabulated a complete set of dimension-6 operators for each such model. Some of the operators possess rich flavour structures which are discussed in detail. This work paves the way towards BSM-EFT.


1991 ◽  
Vol 56 (1) ◽  
pp. 195-212 ◽  
Author(s):  
Seema Ahmad

Lachlan [5] has shown that it is not possible to embed the diamond lattice in the r.e. Turing degrees while preserving least and greatest elements; that is, there do not exist incomparable r.e. Turing degrees a and b such that a ∧ b = 0 and a ∨ b = 0′. Cooper [3] has compared the r.e. Turing degrees to the enumeration degrees below 0e′ and has asked if the two structures are elementarily equivalent.In this paper we show that such an embedding is possible in the Σ2enumeration degrees, which implies a negative answer to Cooper's question.Theorem. There are low enumeration degreesaandbsuch thata ∧ b = 0eanda ∨ b = 0e′.Lower case italic letters denote elements of ω while upper case italic letters denote subsets of ω. D, E and F are reserved for finite sets, and K for ′. If D = {x0, x1, …, xn} then the canonical index of D is , and the canonical index of is ∅. Dx denotes the set with canonical index x. {Wi}i∈ω is any fixed standard listing of the r.e. sets, and <·, ·> is any fixed recursive bijection from ω × ω to ω.Intuitively, A is enumeration reducible to B if there is an effective algorithm for producing an enumeration of A from any enumeration of B. There is a natural one-to-one correspondence between all such algorithms and the r.e. sets.


1997 ◽  
Vol 62 (4) ◽  
pp. 1215-1240 ◽  
Author(s):  
Rodney G. Downey ◽  
Steffen Lempp

AbstractWe prove that a (recursively) enumerable degree is contiguous iff it is locally distributive. This settles a twenty-year old question going back to Ladner and Sasso. We also prove that strong contiguity and contiguity coincide, settling a question of the first author, and prove that no m-topped degree is contiguous, settling a question of the first author and Carl Jockusch [11]. Finally, we prove some results concerning local distributivity and relativized weak truth table reducibility.


1963 ◽  
Vol 56 (6) ◽  
pp. 437-442
Author(s):  
Wendell M. Williams

A number of articles in both The Arithmetic Teacher and The Mathematics Teacher have developed and applied different rules for special cases of divisibility. However, the entire divisibility spectrum can be viewed from one simple set of rules which the average ninth grade pupil can understand and apply.


1966 ◽  
Vol 31 (1) ◽  
pp. 70-85 ◽  
Author(s):  
Paul R. Young

In [2], Fischer has shown the existence of a bounded-truth-table degree of unsolvability which contains a collection of many-one degrees which has, under many-one reducibility, the order type, ω, of the positive integers. In [1; pg. 124], Dekker and Myhill give a construction which shows that the many-one degree of any simple set contains a collection of one-one degrees of simple sets which has, under one-one reducibility, the order type (ω + ω*) ·ω. A basic result of recursive function theory (due to Myhill) is that the creative sets form a many-one degree which consists of a single one-one degree (i.e. a single recursive isomorphism type).It is well known that the recursive sets form three many-one degrees. Two of these, the degrees of the empty set and of the set of all integers, consist of single one-one degrees.


2006 ◽  
Vol 03 (02) ◽  
pp. 269-283 ◽  
Author(s):  
KAZUYUKI FUJII ◽  
KUNIO FUNAHASHI ◽  
TAKAYUKI KOBAYASHI

In the paper (math–ph/0504049) Jarlskog gave an interesting simple parametrization to unitary matrices, which was essentially the canonical coordinate of the second kind in the Lie group theory (math–ph/0505047). In this paper we apply the method to a quantum computation based on multilevel system (qudit theory). Namely, by considering that the parametrization gives a complete set of modules in qudit theory, we construct the generalized Pauli matrices, which play a central role in the theory and also make a comment on the exchange gate of two–qudit systems. Moreover, we give an explicit construction to the generalized Walsh–Hadamard matrix in the case of n = 3, 4, and 5. For the case of n = 5, its calculation is relatively complicated. In general, a calculation to construct it tends to become more and more complicated as n becomes large. To perform a quantum computation the generalized Walsh–Hadamard matrix must be constructed in a quick and clean manner. From our construction it may be possible to say that a qudit theory with n ≥ 5 is not realistic. This paper is an introduction toward Quantum Engineering.


Sign in / Sign up

Export Citation Format

Share Document