Radiation of a relativistic electron with non-equilibrium own Coulomb field

The condition and specific features of the non-dipole regime of radiation is discussed in the context of the results of the recent CERN experiment NA63 on measurement of the radiation power spectrum of 149 GeV electrons in thin tantalum targets. The first observation of a logarithmic dependence of radiation yield on the target thickness that was done there is the conclusive evidence of the effect of radiation suppression in a thin layer of matter, which was predicted many years ago, and which is the direct manifestation of the radiation of a relativistic electron with non-equilibrium own Coulomb field. The special features of the angular distribution of the radiation and its polarization in a thin target at non-dipole regime are proposed for a new experimental study

Influence of the confinement geometry on surface superconductivity

The nucleation field for surface superconductivity, $H_{c3}$, depends on the geometrical shape of the mesoscopic superconducting sample and is substantially enhanced with decreasing sample size. As an example we studied circular, square, triangular and wedge shaped disks. For the wedge the nucleation field diverges as $H_{c3}/H_{c2}=\sqrt{3}/\alpha$ with decreasing angle ($\alpha$) of the wedge, where $H_{c2}$ is the bulk upper critical field.Comment: 4 pages, 3 figures. Accepted for publication in Phys. Rev.

The solution of the quantum A1A_1 T-system for arbitrary boundary

We solve the quantum version of the $A_1$ $T$-system by use of quantum networks. The system is interpreted as a particular set of mutations of a suitable (infinite-rank) quantum cluster algebra, and Laurent positivity follows from our solution. As an application we re-derive the corresponding quantum network solution to the quantum $A_1$ $Q$-system and generalize it to the fully non-commutative case. We give the relation between the quantum $T$-system and the quantum lattice Liouville equation, which is the quantized $Y$-system.Comment: 24 pages, 18 figure

An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure

The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3. This improves the previous time bounds of O^*(1.251^n) by Iwama and Nakashima and O^*(1.260^n) by Eppstein. Our algorithm is a simple branch-and-search algorithm. The only branch rule is designed on a cut-circuit structure of a graph induced by unprocessed edges. To improve a time bound by a simple analysis on measure and conquer, we introduce an amortization scheme over the cut-circuit structure by defining the measure of an instance to be the sum of not only weights of vertices but also weights of connected components of the induced graph.Comment: 24 pages and 4 figure

Pseudoscalar and vector mesons as q\bar{q} bound states

Two-body bound states such as mesons are described by solutions of the Bethe-Salpeter equation. We discuss recent results for the pseudoscalar and vector meson masses and leptonic decay constants, ranging from pions up to c\bar{c} bound states. Our results are in good agreement with data. Essential in these calculation is a momentum-dependent quark mass function, which evolves from a constituent-quark mass in the infrared region to a current-quark mass in the perturbative region. In addition to the mass spectrum, we review the electromagnetic form factors of the light mesons. Electromagnetic current conservation is manifest and the influence of intermediate vector mesons is incorporated self-consistently. The results for the pion form factor are in excellent agreement with experiment.Comment: 8 pages, 6 .eps figures, contribution to the proceedings of the first meeting of the APS Topical Group on Hadron Physics, Fermilab, Oct. 200

Including a phase in the Bethe equations of the Hubbard model

We compute the Bethe equations of generalized Hubbard models, and study their thermodynamical limit. We argue how they can be connected to the ones found in the context of AdS/CFT correspondence, in particular with the so-called dressing phase problem. We also show how the models can be interpreted, in condensed matter physics, as integrable multi-leg Hubbard models.Comment: 30 page

On Directed Feedback Vertex Set parameterized by treewidth

We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time $2^{o(t\log t)}\cdot n^{\mathcal{O}(1)}$ on general directed graphs, where $t$ is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time $2^{\mathcal{O}(t\log t)}\cdot n^{\mathcal{O}(1)}$. On the other hand, we show that if the input digraph is planar, then the running time can be improved to $2^{\mathcal{O}(t)}\cdot n^{\mathcal{O}(1)}$.Comment: 20

Categorification of skew-symmetrizable cluster algebras

We propose a new framework for categorifying skew-symmetrizable cluster algebras. Starting from an exact stably 2-Calabi-Yau category C endowed with the action of a finite group G, we construct a G-equivariant mutation on the set of maximal rigid G-invariant objects of C. Using an appropriate cluster character, we can then attach to these data an explicit skew-symmetrizable cluster algebra. As an application we prove the linear independence of the cluster monomials in this setting. Finally, we illustrate our construction with examples associated with partial flag varieties and unipotent subgroups of Kac-Moody groups, generalizing to the non simply-laced case several results of Gei\ss-Leclerc-Schr\"oer.Comment: 64 page

Fast branching algorithm for Cluster Vertex Deletion

In the family of clustering problems, we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Hueffner et al. [Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex Deletion, where the allowed modification is vertex deletion, and presented an elegant O(2^k * k^9 + n * m)-time fixed-parameter algorithm, parameterized by the solution size. In our work, we pick up this line of research and present an O(1.9102^k * (n + m))-time branching algorithm