Asymptotic properties of the development of conformally flat data near spatial infinity

Certain aspects of the behaviour of the gravitational field near null and spatial infinity for the developments of asymptotically Euclidean, conformally flat initial data sets are analysed. Ideas and results from two different approaches are combined: on the one hand the null infinity formalism related to the asymptotic characteristic initial value problem and on the other the regular Cauchy initial value problem at spatial infinity which uses Friedrich's representation of spatial infinity as a cylinder. The decay of the Weyl tensor for the developments of the class of initial data under consideration is analysed under some existence and regularity assumptions for the asymptotic expansions obtained using the cylinder at spatial infinity. Conditions on the initial data to obtain developments satisfying the Peeling Behaviour are identified. Further, the decay of the asymptotic shear on null infinity is also examined as one approaches spatial infinity. This decay is related to the possibility of selecting the Poincar\'e group out of the BMS group in a canonical fashion. It is found that for the class of initial data under consideration, if the development peels, then the asymptotic shear goes to zero at spatial infinity. Expansions of the Bondi mass are also examined. Finally, the Newman-Penrose constants of the spacetime are written in terms of initial data quantities and it is shown that the constants defined at future null infinity are equal to those at past null infinity.Comment: 24 pages, 1 figur

A rigidity property of asymptotically simple spacetimes arising from conformally flat data

Given a time symmetric initial data set for the vacuum Einstein field equations which is conformally flat near infinity, it is shown that the solutions to the regular finite initial value problem at spatial infinity extend smoothly through the critical sets where null infinity touches spatial infinity if and only if the initial data coincides with Schwarzschild data near infinity.Comment: 37 page

Combinatorial optimization model for railway engine assignment problem

This paper presents an experimental study for the Hungarian State Railway Company (M\'AV). The engine assignment problem was solved at M\'AV by their experts without using any explicit operations research tool. Furthermore, the operations research model was not known at the company. The goal of our project was to introduce and solve an operations research model for the engine assignment problem on real data sets. For the engine assignment problem we are using a combinatorial optimization model. At this stage of research the single type train that is pulled by a single type engine is modeled and solved for real data. There are two regions in Hungary where the methodology described in this paper can be used and M\'AV started to use it regularly. There is a need to generalize the model for multiple type trains and multiple type engines

On the existence and convergence of polyhomogeneous expansions of zero-rest-mass fields

The convergence of polyhomogeneous expansions of zero-rest-mass fields in asymptotically flat spacetimes is discussed. An existence proof for the asymptotic characteristic initial value problem for a zero-rest-mass field with polyhomogeneous initial data is given. It is shown how this non-regular problem can be properly recast as a set of regular initial value problems for some auxiliary fields. The standard techniques of symmetric hyperbolic systems can be applied to these new auxiliary problems, thus yielding a positive answer to the question of existence in the original problem.Comment: 10 pages, 1 eps figur

Time asymmetric spacetimes near null and spatial infinity. I. Expansions of developments of conformally flat data

The Conformal Einstein equations and the representation of spatial infinity as a cylinder introduced by Friedrich are used to analyse the behaviour of the gravitational field near null and spatial infinity for the development of data which are asymptotically Euclidean, conformally flat and time asymmetric. Our analysis allows for initial data whose second fundamental form is more general than the one given by the standard Bowen-York Ansatz. The Conformal Einstein equations imply upon evaluation on the cylinder at spatial infinity a hierarchy of transport equations which can be used to calculate in a recursive way asymptotic expansions for the gravitational field. It is found that the the solutions to these transport equations develop logarithmic divergences at certain critical sets where null infinity meets spatial infinity. Associated to these, there is a series of quantities expressible in terms of the initial data (obstructions), which if zero, preclude the appearance of some of the logarithmic divergences. The obstructions are, in general, time asymmetric. That is, the obstructions at the intersection of future null infinity with spatial infinity are different, and do not generically imply those obtained at the intersection of past null infinity with spatial infinity. The latter allows for the possibility of having spacetimes where future and past null infinity have different degrees of smoothness. Finally, it is shown that if both sets of obstructions vanish up to a certain order, then the initial data has to be asymptotically Schwarzschildean to some degree.Comment: 32 pages. First part of a series of 2 papers. Typos correcte

Can one detect a non-smooth null infinity?

It is shown that the precession of a gyroscope can be used to elucidate the nature of the smoothness of the null infinity of an asymptotically flat spacetime (describing an isolated body). A model for which the effects of precession in the non-smooth null infinity case are of order $r^{-2}\ln r$ is proposed. By contrast, in the smooth version the effects are of order $r^{-3}$. This difference should provide an effective criterion to decide on the nature of the smoothness of null infinity.Comment: 6 pages, to appear in Class. Quantum Gra

Studying Attractor Symmetries by Means of Cross Correlation Sums

We use the cross correlation sum introduced recently by H. Kantz to study symmetry properties of chaotic attractors. In particular, we apply it to a system of six coupled nonlinear oscillators which was shown by Kroon et al. to have attractors with several different symmetries, and compare our results with those obtained by ``detectives" in the sense of Golubitsky et al.Comment: LaTeX file, 16 pages and 16 postscript figures; tarred, gzipped and uuencoded; submitted to 'Nonlinearity

Divergent evolution of protein conformational dynamics in dihydrofolate reductase.

Molecular evolution is driven by mutations, which may affect the fitness of an organism and are then subject to natural selection or genetic drift. Analysis of primary protein sequences and tertiary structures has yielded valuable insights into the evolution of protein function, but little is known about the evolution of functional mechanisms, protein dynamics and conformational plasticity essential for activity. We characterized the atomic-level motions across divergent members of the dihydrofolate reductase (DHFR) family. Despite structural similarity, Escherichia coli and human DHFRs use different dynamic mechanisms to perform the same function, and human DHFR cannot complement DHFR-deficient E. coli cells. Identification of the primary-sequence determinants of flexibility in DHFRs from several species allowed us to propose a likely scenario for the evolution of functionally important DHFR dynamics following a pattern of divergent evolution that is tuned by cellular environment

5-Approximation for H\mathcal{H}-Treewidth Essentially as Fast as H\mathcal{H}-Deletion Parameterized by Solution Size

The notion of $\mathcal{H}$-treewidth, where $\mathcal{H}$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of $\mathcal{H}$-treewidth at most $k$ can be decomposed into (arbitrarily large) $\mathcal{H}$-subgraphs which interact only through vertex sets of size $O(k)$ which can be organized in a tree-like fashion. $\mathcal{H}$-treewidth can be used as a hybrid parameterization to develop fixed-parameter tractable algorithms for $\mathcal{H}$-deletion problems, which ask to find a minimum vertex set whose removal from a given graph $G$ turns it into a member of $\mathcal{H}$. The bottleneck in the current parameterized algorithms lies in the computation of suitable tree $\mathcal{H}$-decompositions. We present FPT approximation algorithms to compute tree $\mathcal{H}$-decompositions for hereditary and union-closed graph classes $\mathcal{H}$. Given a graph of $\mathcal{H}$-treewidth $k$, we can compute a 5-approximate tree $\mathcal{H}$-decomposition in time $f(O(k)) \cdot n^{O(1)}$ whenever $\mathcal{H}$-deletion parameterized by solution size can be solved in time $f(k) \cdot n^{O(1)}$ for some function $f(k) \geq 2^k$. The current-best algorithms either achieve an approximation factor of $k^{O(1)}$ or construct optimal decompositions while suffering from non-uniformity with unknown parameter dependence. Using these decompositions, we obtain algorithms solving Odd Cycle Transversal in time $2^{O(k)} \cdot n^{O(1)}$ parameterized by $\mathsf{bipartite}$-treewidth and Vertex Planarization in time $2^{O(k \log k)} \cdot n^{O(1)}$ parameterized by $\mathsf{planar}$-treewidth, showing that these can be as fast as the solution-size parameterizations and giving the first ETH-tight algorithms for parameterizations by hybrid width measures.Comment: Conference version to appear at the European Symposium on Algorithms (ESA 2023