Cyclic Foam Topological Field Theories

This paper proposes an axiomatic for Cyclic Foam Topological Field theories. That is Topological Field theories, corresponding to String theories, where particles are arbitrary graphs. World surfaces in this case are two-manifolds with one-dimensional singularities. We proved that Cyclic Foam Topological Field theories one-to-one correspond to graph-Cardy-Frobenius algebras, that are families $(A,B_\star,\phi)$, where $A=\{A^s|s\in S\}$ are families of commutative associative Frobenius algebras, $B_\star = \bigoplus_{\sigma\in\Sigma} B_\sigma$ is an graduated by graphes, associative algebras of Frobenius type and $\phi=\{\phi_\sigma^s: A^s\to (B_\sigma)|s\in S,\sigma\in \Sigma\}$ is a family of special representations. There are constructed examples of Cyclic Foam Topological Field theories and its graph-Cardy-Frobenius algebrasComment: 14 page

Els canvis de l'olfacte en l'embaràs

És cert el que es diu sobre el canvi de les olors en la dona embarassada

Classical correlations of defects in lattices with geometrical frustration in the motion of a particle

We map certain highly correlated electron systems on lattices with geometrical frustration in the motion of added particles or holes to the spatial defect-defect correlations of dimer models in different geometries. These models are studied analytically and numerically. We consider different coverings for four different lattices: square, honeycomb, triangular, and diamond. In the case of hard-core dimer covering, we verify the existed results for the square and triangular lattice and obtain new ones for the honeycomb and the diamond lattices while in the case of loop covering we obtain new numerical results for all the lattices and use the existing analytical Liouville field theory for the case of square lattice.The results show power-law correlations for the square and honeycomb lattice, while exponential decay with distance is found for the triangular and exponential decay with the inverse distance on the diamond lattice. We relate this fact with the lack of bipartiteness of the triangular lattice and in the latter case with the three-dimensionality of the diamond. The connection of our findings to the problem of fractionalized charge in such lattices is pointed out.Comment: 6 pages, 6 figures, 1 tabl

Correlators of hadron currents: the model and the ALEPH data on tau-decay

The model with the meson spectrum, consisting of zero-width equidistant resonances, is considered with connection to current correlators in coordinate space. The comparison of the explicit expressions for the correlators, obtained in this model, with the experimental data of ALEPH collaboration on tau-decay is made and good agreement is found.Comment: LaTeX, 8 pages, 3 figure

Thermodynamics of the 3-flavor NJL model : chiral symmetry breaking and color superconductivity

Employing an extended three flavor version of the NJL model we discuss in detail the phase diagram of quark matter. The presence of quark as well as of diquark condensates gives raise to a rich structure of the phase diagram. We study in detail the chiral phase transition and the color superconductivity as well as color flavor locking as a function of the temperature and chemical potentials of the system.Comment: 27 pages, 7 figure

Counting Complex Disordered States by Efficient Pattern Matching: Chromatic Polynomials and Potts Partition Functions

Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in mathematical graph theory, and in computer science. Counting problems, however, are among the hardest problems to access computationally. Here, we suggest a novel method to access a benchmark counting problem, finding chromatic polynomials of graphs. We develop a vertex-oriented symbolic pattern matching algorithm that exploits the equivalence between the chromatic polynomial and the zero-temperature partition function of the Potts antiferromagnet on the same graph. Implementing this bottom-up algorithm using appropriate computer algebra, the new method outperforms standard top-down methods by several orders of magnitude, already for moderately sized graphs. As a first application, we compute chromatic polynomials of samples of the simple cubic lattice, for the first time computationally accessing three-dimensional lattices of physical relevance. The method offers straightforward generalizations to several other counting problems.Comment: 7 pages, 4 figure