Contraction Bidimensionality: the Accurate Picture

We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we unify and significantly simplify contraction bidimensionality theory -- the meta algorithmic framework to design efficient parameterized and approximation algorithms for contraction closed parameters

(Total) Vector Domination for Graphs with Bounded Branchwidth

Given a graph $G=(V,E)$ of order $n$ and an $n$-dimensional non-negative vector $d=(d(1),d(2),\ldots,d(n))$, called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum $S\subseteq V$ such that every vertex $v$ in $V\setminus S$ (resp., in $V$) has at least $d(v)$ neighbors in $S$. The (total) vector domination is a generalization of many dominating set type problems, e.g., the dominating set problem, the $k$-tuple dominating set problem (this $k$ is different from the solution size), and so on, and its approximability and inapproximability have been studied under this general framework. In this paper, we show that a (total) vector domination of graphs with bounded branchwidth can be solved in polynomial time. This implies that the problem is polynomially solvable also for graphs with bounded treewidth. Consequently, the (total) vector domination problem for a planar graph is subexponential fixed-parameter tractable with respectto $k$, where $k$ is the size of solution.Comment: 16 page

Anisotropy beta functions

The flow of couplings under anisotropic scaling of momenta is computed in $\phi^3$ theory in 6 dimensions. It is shown that the coupling decreases as momenta of two of the particles become large, keeping the third momentum fixed, but at a slower rate than the decrease of the coupling if all three momenta become large simultaneously. This effect serves as a simple test of effective theories of high energy scattering, since such theories should reproduce these deviations from the usual logarithmic scale dependence.Comment: uuencoded ps file, 6 page

"If We Want to Get Men in, Then We Need to Ask Men What They Want": Pathways to Effective Health Programing for Men.

In Ireland, men’s health is becoming a priority. In line with global trends, indicators of poor mental health (including rates of depression and suicide) are increasing alongside rates of unemployment and social isolation. Despite the growing awareness of men’s health as a national priority, and development of the first National Men’s Health Policy in the world, there is still a concern about men’s non-engagement with health services. Health and community services often struggle to appropriately accommodate men, and men commonly avoid health spaces. A growing body of literature suggests that a persistent lack of support or resources for service providers contributes to their inability to identify and meet men’s unique health needs. This study aims to provide further insight into the ways in which this gap between men and health services can be closed. Semi-structured, qualitative interviews were conducted with nine project partners (n=9) of a successful men’s health program in Dublin. Interviews captured reflections on what processes or strategies contribute to effective men’s health programs. Findings suggest that gender-specific strategies – especially related to community- engagement and capacity building - are necessary in creating health programs that both promote men’s health and enable men to safely and comfortably participate. Moreover, including men in all aspects of the planning stages helps to ensure that programs are accessible and acceptable for men. It is envisaged that these findings will be operationalized into a user-driven resource to illustrate evidence-informed strategies and guiding principles that could be used by practitioners hoping to engage with me

Dynamic Programming for Graphs on Surfaces

We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2^{O(k log k)} n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called "surface cut decomposition", generalizing sphere cut decompositions of planar graphs introduced by Seymour and Thomas, which has nice combinatorial properties. Namely, the number of partial solutions that can be arranged on a surface cut decomposition can be upper-bounded by the number of non-crossing partitions on surfaces with boundary. It follows that partial solutions can be represented by a single-exponential (in the branchwidth k) number of configurations. This proves that, when applied on surface cut decompositions, dynamic programming runs in 2^{O(k)} n steps. That way, we considerably extend the class of problems that can be solved in running times with a single-exponential dependence on branchwidth and unify/improve most previous results in this direction.Comment: 28 pages, 3 figure

Linear systems with adiabatic fluctuations

We consider a dynamical system subjected to weak but adiabatically slow fluctuations of external origin. Based on the ``adiabatic following'' approximation we carry out an expansion in \alpha/|\mu|, where \alpha is the strength of fluctuations and 1/|\mu| refers to the time scale of evolution of the unperturbed system to obtain a linear differential equation for the average solution. The theory is applied to the problems of a damped harmonic oscillator and diffusion in a turbulent fluid. The result is the realization of `renormalized' diffusion constant or damping constant for the respective problems. The applicability of the method has been critically analyzed.Comment: Plain Latex, no figure, 21 page

Dynamic programming for graphs on surfaces

We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k·log k). Our approach combines tools from topological graph theory and analytic combinatorics.Postprint (updated version

Status of the Standard Solar Model Prediction of Solar Neutrino Fluxes

The Standard Solar Model (BP04) predicts a total 8B neutrino flux that is 17.2% larger than measured in the salt phase of the SNO detector (and if it were significant it will indicate oscillation to sterile neutrinos). Hence it is important to examine in details uncertainties (and values) of inputs to the SSM. Currently, the largest fractional uncertainty is due to the new evaluation of the surface composition of the sun. We examine the nuclear input on the formation of solar 8B [S17(0)] and demonstrate that it is still quite uncertain due to ill known slope of the measured astrophysical cross section factor and thus ill defined extrapolation to zero energy. This yields an additional reasonably estimated uncertainty due to extrapolation of +0.0 -3.0 eV-b (+0% -14%). Since a large discrepancy exists among measured as well as among predicted slopes, the value of S17(0) is dependent on the choice of data and theory used to extrapolate S17(0). This situation must be alleviated by new measurement(s). The "world average" is driven by the Seattle result due to the very small quoted uncertainty, which we however demonstrate it to be an over-estimated accuracy. We propose more realistic error bars for the Seattle results based on the published Seattle data.Comment: Fifth International Conferenceon Non-Accelerator New Physics, Dubna, June 20-25, 2005. Work Supported by USDOE Grant No. DE-FG02-94ER4087

Proper Size of the Visible Universe in FRW Metrics with Constant Spacetime Curvature

In this paper, we continue to examine the fundamental basis for the Friedmann-Robertson-Walker (FRW) metric and its application to cosmology, specifically addressing the question: What is the proper size of the visible universe? There are several ways of answering the question of size, though often with an incomplete understanding of how far light has actually traveled in reaching us today from the most remote sources. The difficulty usually arises from an inconsistent use of the coordinates, or an over-interpretation of the physical meaning of quantities such as the so-called proper distance R(t)=a(t)r, written in terms of the (unchanging) co-moving radius r and the universal expansion factor a(t). In this paper, we use the five non-trivial FRW metrics with constant spacetime curvature (i.e., the static FRW metrics, but excluding Minkowski) to prove that in static FRW spacetimes in which expansion began from an initial signularity, the visible universe today has a proper size equal to R_h(t_0/2), i.e., the gravitational horizon at half its current age. The exceptions are de Sitter and Lanczos, whose contents had pre-existing positions away from the origin. In so doing, we confirm earlier results showing the same phenomenon in a broad range of cosmologies, including LCDM, based on the numerical integration of null geodesic equations through an FRW metric.Comment: Accepted for publication in Classical and Quantum Gravit