Phonons in magnon superfluid and symmetry breaking field

Recent experiments [1],[2] which measured the spectrum of the Goldstone collective mode of coherently precessing state in 3He-B are discussed using the presentation of the coherent spin precession in terms of the Bose-Einstein condensation of magnons. The mass in the spectrum of the Goldstone boson -- phonon in the superfluid magnon liquid -- is induced by the symmetry breaking field, which is played by the RF magnetic fieldComment: 2 pages, JETP Letters style, no figures, version accepted in JETP Letter

On the Optimality of Pseudo-polynomial Algorithms for Integer Programming

In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \times n$ matrix $A$ and an $m$-vector $b=(b_1,\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP) is an important step in numerous algorithms and it is important to obtain an understanding of the precise complexity of this problem as a function of natural parameters of the input. The classic pseudo-polynomial time algorithm of Papadimitriou [J. ACM 1981] for instances of (IP) with a constant number of constraints was only recently improved upon by Eisenbrand and Weismantel [SODA 2018] and Jansen and Rohwedder [ArXiv 2018]. We continue this line of work and show that under the Exponential Time Hypothesis (ETH), the algorithm of Jansen and Rohwedder is nearly optimal. We also show that when the matrix $A$ is assumed to be non-negative, a component of Papadimitriou's original algorithm is already nearly optimal under ETH. This motivates us to pick up the line of research initiated by Cunningham and Geelen [IPCO 2007] who studied the complexity of solving (IP) with non-negative matrices in which the number of constraints may be unbounded, but the branch-width of the column-matroid corresponding to the constraint matrix is a constant. We prove a lower bound on the complexity of solving (IP) for such instances and obtain optimal results with respect to a closely related parameter, path-width. Specifically, we prove matching upper and lower bounds for (IP) when the path-width of the corresponding column-matroid is a constant.Comment: 29 pages, To appear in ESA 201

Andreev scattering in nanoscopic junctions at high magnetic fields

We report on the measurement of multiple Andreev resonances at atomic size point contacts between two superconducting nanostructures of Pb under magnetic fields higher than the bulk critical field, where superconductivity is restricted to a mesoscopic region near the contact. The small number of conduction channels in this type of contacts permits a quantitative comparison with theory through the whole field range. We discuss in detail the physical properties of our structure, in which the normal bulk electrodes induce a proximity effect into the mesoscopic superconducting part.Comment: 4 page

Applications of BGP-reflection functors: isomorphisms of cluster algebras

Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It is an isomorphism between two cluster algebras associated to the matrix $A$ (see section 4 for precise meaning). When $A$ is of finite type, these isomorphisms behave nicely, they are compatible with the BGP-reflection functors of cluster categories defined in [Z1, Z2] if we identify the indecomposable objects in the categories with cluster variables of the corresponding cluster algebras, and they are also compatible with the "truncated simple reflections" defined in [FZ2, FZ3]. Using the construction of preprojective or preinjective modules of hereditary algebras by Dlab-Ringel [DR] and the Coxeter automorphisms (i.e., a product of these isomorphisms), we construct infinitely many cluster variables for cluster algebras of infinite type and all cluster variables for finite types.Comment: revised versio