Q-deformed fermionic Lipkin model at finite temperature

The interplay between temperature and q-deformation in the phase transition properties of many-body systems is studied in the particular framework of the collective q-deformed fermionic Lipkin model. It is shown that in phase transitions occuring in many-fermion systems described by su(2)q-like models are strongly influenced by the q-deformation.

Hamiltonian reduction and the construction of q-deformed extensions of the Virasoro algebra

In this paper we employ the construction of the Dirac bracket for the remaining current of sl(2) q deformed Kac-Moody algebra when constraints similar to those connecting the sl(2)-Wess-Zumino-Witten model and the Liouville theory are imposed to show that it satisfies the q-Virasoro algebra proposed by Frenkel and Reshetikhin The crucial assumption considered in our calculation is the existence of a classical Poisson bracket algebra induced in a consistent manner by the correspondence principle, mapping the quantum generators into commuting objects of classical nature preserving their algebra.

Unitary Operator Bases and Q-deformed Algebras

Starting from the Schwinger unitary operator bases formalism constructed out of a finite dimensional state space, the well-known q-deformed commutation relation is shown to emerge in a natural way, when the deformation parameter is a root of unity.

Deformed Gaussian orthogonal ensemble and the statistical fluctuations in the spectra of the quartic oscillator

The nearest-neighbor spacing distributions proposed by four models, namely, the Berry-Robnik, Caurier-Grammaticos-Ramani, Lenz-Haake, and the deformed Gaussian orthogonal ensemble, as well as the ansatz by Brody, are applied to the transition between chaos and order that occurs in the isotropic quartic oscillator. The advantages and disadvantages of these five descriptions are discussed. In addition, the results of a simple extension of the expression for the Dyson-Mehta statistic Δ3 are compared with those of a more popular one, usually associated with the Berry-Robnik formalism. ©1999 The American Physical Society.

Mapping deformed hyperbolic potentials into nondeformed ones

In this work we introduce a mapping between the so-called deformed hyperbolic potentials, which are presenting a continuous interest in the last few years, and the corresponding nondeformed ones. As a consequence, we conclude that these deformed potentials do not pertain to a new class of exactly solvable potentials, but to the same one of the corresponding nondeformed ones. Notwithstanding, we can reinterpret this type of deformation as a kind of symmetry of the nondeformed potentials. © 2005 Elsevier B.V. All rights reserved.

Role of transitional levels in Np237 (γ,f): Perspectives for studying highly deformed systems

The transition levels at the top of the two Np237 fission barriers were obtained for the first time by means of the so-called semimicroscopic combined method, which we have developed and implemented. To overcome the difficulties in dealing with large nuclear deformations, we used our developed BARRIER code, which calculates single-particle spectra in a deformed Woods-Saxon potential using a coordinate system based on Cassini ovaloids as nuclear shape parametrization. The results enabled us to describe the experimentally observed near-barrier photofission cross-section structures for Np237, as well as a subbarrier shelf, the latter being consistently interpreted in terms of the accumulation of levels at the top of the inner and outer double fission barrier of Np237. © 2006 The American Physical Society.

Tendências econômicas e sociais na América Latina e no Caribe em gráficos = Economic and social trends in Latin America and the Caribbean in graphs = Tendencias económicas y sociales en América Latina y el Caribe en gráficos

Incluye Bibliografía

A Markov random field model for combining optimum-path forest classifiers using decision graphs and game strategy approach

The research on multiple classifiers systems includes the creation of an ensemble of classifiers and the proper combination of the decisions. In order to combine the decisions given by classifiers, methods related to fixed rules and decision templates are often used. Therefore, the influence and relationship between classifier decisions are often not considered in the combination schemes. In this paper we propose a framework to combine classifiers using a decision graph under a random field model and a game strategy approach to obtain the final decision. The results of combining Optimum-Path Forest (OPF) classifiers using the proposed model are reported, obtaining good performance in experiments using simulated and real data sets. The results encourage the combination of OPF ensembles and the framework to design multiple classifier systems. © 2011 Springer-Verlag.

Unsupervised manifold learning using Reciprocal kNN Graphs in image re-ranking and rank aggregation tasks

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Multikink solutions and deformed defects

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Flattening of the resonance spectrum of hadrons from κ-deformed Poincaré algebra

Recently Lukierski et al. [1] defined a κ-deformed Poincaré algebra which is characterized by having the energy-momentum and angular momentum sub-algebras not deformed. Further Biedenharn et al. [2] showed that on gauging the κ-deformed electron with the electromagnetic field, one can set a limit on the allowed value of the deformation parameter ∈ ≡ 1/κ < 1 fm. We show that one gets Regge like angular excitations, J, of the mesons, non-strange and strange baryons, with a value of ∈ ∼ 0.082 fm and predict a flattening with J of the corresponding trajectories. The Regge fit improves on including deformation, particularly for the baryon spectrum.

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of k-colourings of the edge set of G with no monochromatic matching of size l. Consider the function c(k,l) : N --> N given by c(k,l)(n) = max {c(k,l)(G): vertical bar V(G)vertical bar = n}, the maximum of c(k,l)(G) over all graphs G on n vertices. In this paper, we determine c(k,l)(n) and the corresponding extremal graphs for all large n and all fixed values of k and l.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.