New identities involving q-Euler polynomials of higher order

In this paper we give new identities involving q-Euler polynomials of higher order.Comment: 11 page

A note on q-Bernstein polynomials

In this paper we constructed new q-extension of Bernstein polynomials. Fron those q-Berstein polynomials, we give some interesting properties and we investigate some applications related this q-Bernstein polynomials.Comment: 13 page

Quantum network architecture of tight-binding models with substitution sequences

We study a two-spin quantum Turing architecture, in which discrete local rotations \alpha_m of the Turing head spin alternate with quantum controlled NOT-operations. Substitution sequences are known to underlie aperiodic structures. We show that parameter inputs \alpha_m described by such sequences can lead here to a quantum dynamics, intermediate between the regular and the chaotic variant. Exponential parameter sensitivity characterizing chaotic quantum Turing machines turns out to be an adequate criterion for induced quantum chaos in a quantum network.Comment: Accepted for publication in J. mod. Optics [Proc. Workshop "Entanglement and Decoherence", Gargnano (Italy), Sept 1999], 3 figure

Higher-Dimensional QCD without the Strong CP Problem

QCD in a five-dimensional sliced bulk with chiral extra-quarks on the boundaries is generically free from the strong CP problem. Accidental axial symmetry is naturally present except for suppressed breaking interactions, which plays a role of the Peccei-Quinn symmetry to make the strong CP phase sufficiently small.Comment: 7 pages, late

A box-covering algorithm for fractal scaling in scale-free networks

A random sequential box-covering algorithm recently introduced to measure the fractal dimension in scale-free networks is investigated. The algorithm contains Monte Carlo sequential steps of choosing the position of the center of each box, and thereby, vertices in preassigned boxes can divide subsequent boxes into more than one pieces, but divided boxes are counted once. We find that such box-split allowance in the algorithm is a crucial ingredient necessary to obtain the fractal scaling for fractal networks; however, it is inessential for regular lattice and conventional fractal objects embedded in the Euclidean space. Next the algorithm is viewed from the cluster-growing perspective that boxes are allowed to overlap and thereby, vertices can belong to more than one box. Then, the number of distinct boxes a vertex belongs to is distributed in a heterogeneous manner for SF fractal networks, while it is of Poisson-type for the conventional fractal objects.Comment: 12 pages, 11 figures, a proceedings of the conference, "Optimization in complex networks." held in Los Alamo

The quantization of the chiral Schwinger model based on the BFT-BFV formalism II

We apply an improved version of Batalin-Fradkin-Tyutin (BFT) Hamiltonian method to the a=1 chiral Schwinger Model, which is much more nontrivial than the a>1.$one. Furthermore, through the path integral quantization, we newly resolve the problem of the non-trivial$\delta$function as well as that of the unwanted Fourier parameter$\xi$ in the measure. As a result, we explicitly obtain the fully gauge invariant partition function, which includes a new type of Wess-Zumino (WZ) term irrelevant to the gauge symmetry as well as usual WZ action.Comment: 17 pages, To be published in J. Phys.