β-Perfect Graphs

AbstractThe class ofβ-perfect graphs is introduced. We draw a number of parallels between these graphs and perfect graphs. We also introduce some special classes ofβ-perfect graphs. Finally, we show that the greedy algorithm can be used to colour a graphGwith no even chordless cycles using at most 2(χ(G)−1) colours

X-ray measurement of residual stresses in laser surface melted Ti-6Al-4V alloy

In this paper, we report on the residual stresses in laser surface melted Ti-6Al-4V, determined using X-ray diffraction methods. The principal result is that there is an increase in the transverse residual stress with each successive, overlapping laser track. The result can be used to explain the observation of crack formation in overlapping tracks but not necessarily in single tracks produced under identical processing conditions.

Subset feedback vertex set is fixed parameter tractable

The classical Feedback Vertex Set problem asks, for a given undirected graph G and an integer k, to find a set of at most k vertices that hits all the cycles in the graph G. Feedback Vertex Set has attracted a large amount of research in the parameterized setting, and subsequent kernelization and fixed-parameter algorithms have been a rich source of ideas in the field. In this paper we consider a more general and difficult version of the problem, named Subset Feedback Vertex Set (SUBSET-FVS in short) where an instance comes additionally with a set S ? V of vertices, and we ask for a set of at most k vertices that hits all simple cycles passing through S. Because of its applications in circuit testing and genetic linkage analysis SUBSET-FVS was studied from the approximation algorithms perspective by Even et al. [SICOMP'00, SIDMA'00]. The question whether the SUBSET-FVS problem is fixed-parameter tractable was posed independently by Kawarabayashi and Saurabh in 2009. We answer this question affirmatively. We begin by showing that this problem is fixed-parameter tractable when parametrized by |S|. Next we present an algorithm which reduces the given instance to 2^k n^O(1) instances with the size of S bounded by O(k^3), using kernelization techniques such as the 2-Expansion Lemma, Menger's theorem and Gallai's theorem. These two facts allow us to give a 2^O(k log k) n^O(1) time algorithm solving the Subset Feedback Vertex Set problem, proving that it is indeed fixed-parameter tractable.Comment: full version of a paper presented at ICALP'1

On-Mass-Shell Renormalization of Fermion Mixing Matrices

We consider favourable extensions of the standard model (SM) where the lepton sector contains Majorana neutrinos with vanishing left-handed mass terms, thus allowing for the see-saw mechanism to operate, and propose physical on-mass-shell (OS) renormalization conditions for the lepton mixing matrices that comply with ultraviolet finiteness, gauge-parameter independence, and (pseudo)unitarity. A crucial feature is that the texture zero in the neutrino mass matrix is preserved by renormalization, which is not automatically the case for possible generalizations of existing renormalization prescriptions for the Cabibbo-Kobayashi-Maskawa (CKM) quark mixing matrix in the SM. Our renormalization prescription also applies to the special case of the SM and leads to a physical OS definition of the renormalized CKM matrix.Comment: 18 pages (Latex), to appear in Nucl. Phys.

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

Fredholm determinants and the statistics of charge transport

Using operator algebraic methods we show that the moment generating function of charge transport in a system with infinitely many non-interacting Fermions is given by a determinant of a certain operator in the one-particle Hilbert space. The formula is equivalent to a formula of Levitov and Lesovik in the finite dimensional case and may be viewed as its regularized form in general. Our result embodies two tenets often realized in mesoscopic physics, namely, that the transport properties are essentially independent of the length of the leads and of the depth of the Fermi sea.Comment: 30 pages, 2 figures, reference added, credit amende

Lifshitz Tails in Constant Magnetic Fields

We consider the 2D Landau Hamiltonian $H$ perturbed by a random alloy-type potential, and investigate the Lifshitz tails, i.e. the asymptotic behavior of the corresponding integrated density of states (IDS) near the edges in the spectrum of $H$. If a given edge coincides with a Landau level, we obtain different asymptotic formulae for power-like, exponential sub-Gaussian, and super-Gaussian decay of the one-site potential. If the edge is away from the Landau levels, we impose a rational-flux assumption on the magnetic field, consider compactly supported one-site potentials, and formulate a theorem which is analogous to a result obtained in the case of a vanishing magnetic field

Fluctuations of Matrix Entries of Regular Functions of Wigner Matrices

We study the fluctuations of the matrix entries of regular functions of Wigner random matrices in the limit when the matrix size goes to infinity. In the case of the Gaussian ensembles (GOE and GUE) this problem was considered by A.Lytova and L.Pastur in J. Stat. Phys., v.134, 147-159 (2009). Our results are valid provided the off-diagonal matrix entries have finite fourth moment, the diagonal matrix entries have finite second moment, and the test functions have four continuous derivatives in a neighborhood of the support of the Wigner semicircle law.Comment: minor corrections; the manuscript will appear in the Journal of Statistical Physic

The spectral curve of a quaternionic holomorphic line bundle over a 2-torus

A conformal immersion of a 2-torus into the 4-sphere is characterized by an auxiliary Riemann surface, its spectral curve. This complex curve encodes the monodromies of a certain Dirac type operator on a quaternionic line bundle associated to the immersion. The paper provides a detailed description of the geometry and asymptotic behavior of the spectral curve. If this curve has finite genus the Dirichlet energy of a map from a 2-torus to the 2-sphere or the Willmore energy of an immersion from a 2-torus into the 4-sphere is given by the residue of a specific meromorphic differential on the curve. Also, the kernel bundle of the Dirac type operator evaluated over points on the 2-torus linearizes in the Jacobian of the spectral curve. Those results are presented in a geometric and self contained manner.Comment: 36 page

Feedback Vertex Sets in Tournaments

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740^n minimal feedback vertex sets, and that there is an infinite family of tournaments, all having at least 1.5448^n minimal feedback vertex sets. This improves and extends the bounds of Moon (1971). On the algorithmic side, we design the first polynomial space algorithm that enumerates the minimal feedback vertex sets of a tournament with polynomial delay. The combination of our results yields the fastest known algorithm for finding a minimum size feedback vertex set in a tournament