Towards a spin foam model description of black hole entropy

We propose a way to describe the origin of black hole entropy in the spin foam models of quantum gravity. This stimulates a new way to study the relation of spin foam models and loop quantum gravity.Comment: 5 pages, 1 figur

Transformations of coordinates and Hamiltonian formalism in deformed Special Relativity

We investigate the transformation laws of coordinates in generalizations of special relativity with two observer-independent scales. The request of covariance leads to simple formulas if one assumes noncanonical Poisson brackets, corresponding to noncommuting spacetime coordinates.Comment: 11 pages, plain LaTe

Internal structure of Skyrme black hole

We consider the internal structure of the Skyrme black hole under a static and spherically symmetric ansatz. $@u8(Be concentrate on solutions with the node number one and with the "winding" number zero, where there exist two solutions for each horizon radius; one solution is stable and the other is unstable against linear perturbation. We find that a generic solution exhibits an oscillating behavior near the sigularity, as similar to a solution in the Einstein-Yang-Mills (EYM) system, independently to stability of the solution. Comparing it with that in the EYM system, this oscillation becomes mild because of the mass term of the Skyrme field. We also find Schwarzschild-like exceptional solutions where no oscillating behavior is seen. Contrary to the EYM system where there is one such solution branch if the node number is fixed, there are two branches corresponding to the stable and the unstable ones.Comment: 5 pages, 4 figures, some contents adde

Particle velocity in noncommutative space-time

We investigate a particle velocity in the $\kappa$-Minkowski space-time, which is one of the realization of a noncommutative space-time. We emphasize that arrival time analyses by high-energy $\gamma$-rays or neutrinos, which have been considered as powerful tools to restrict the violation of Lorentz invariance, are not effective to detect space-time noncommutativity. In contrast with these examples, we point out a possibility that {\it low-energy massive particles} play an important role to detect it.Comment: 16 pages, corrected some mistake

Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework

Most of the known lower bounds for binary Boolean circuits with unrestricted depth are proved by the gate elimination method. The most efficient known algorithms for the #SAT problem on binary Boolean circuits use similar case analyses to the ones in gate elimination. Chen and Kabanets recently showed that the known case analyses can also be used to prove average case circuit lower bounds, that is, lower bounds on the size of approximations of an explicit function. In this paper, we provide a general framework for proving worst/average case lower bounds for circuits and upper bounds for #SAT that is built on ideas of Chen and Kabanets. A proof in such a framework goes as follows. One starts by fixing three parameters: a class of circuits, a circuit complexity measure, and a set of allowed substitutions. The main ingredient of a proof goes as follows: by going through a number of cases, one shows that for any circuit from the given class, one can find an allowed substitution such that the given measure of the circuit reduces by a sufficient amount. This case analysis immediately implies an upper bound for #SAT. To~obtain worst/average case circuit complexity lower bounds one needs to present an explicit construction of a function that is a disperser/extractor for the class of sources defined by the set of substitutions under consideration. We show that many known proofs (of circuit size lower bounds and upper bounds for #SAT) fall into this framework. Using this framework, we prove the following new bounds: average case lower bounds of 3.24n and 2.59n for circuits over U_2 and B_2, respectively (though the lower bound for the basis B_2 is given for a quadratic disperser whose explicit construction is not currently known), and faster than 2^n #SAT-algorithms for circuits over U_2 and B_2 of size at most 3.24n and 2.99n, respectively. Here by B_2 we mean the set of all bivariate Boolean functions, and by U_2 the set of all bivariate Boolean functions except for parity and its complement