Regularization of the collision in the electromagnetic two-body problem

We derive a differential equation that is regular at the collision of two equal-mass bodies with attractive interaction in the relativistic action-at-a-distance electrodynamics. We use the energy constant related to the Poincare invariance of the theory to define finite variables with finite derivatives at the collision. The collision orbits are calculated numerically using the regular equation adapted in a self-consistent minimization method (a stable numerical method that chooses only nonrunaway solutions). This dynamical system appeared 100 years ago as an example of covariant time-symmetric two-body dynamics and acquired the status of electrodynamics in the 1940s by the works of Dirac, Wheeler, and Feynman. We outline the method with an emphasis on the physics of this complex conservative dynamical system.     

Cellulose

Ohne Zusammenfassung     

Algorithms for clique-independent sets on subclasses of circular-arc graphs

A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose polynomial time algorithms for finding the maximum cardinality and weight of a clique-independent set of a -free CA graph. Also, we apply the algorithms to the special case of an HCA graph. The complexity of the proposed algorithm for the cardinality problem in HCA graphs is O(n). This represents an improvement over the existing algorithm by Guruswami and Pandu Rangan, whose complexity is O(n²). These algorithms suppose that an HCA model of the graph is given.     

Equivalence of Dirac and Maxwell equations and quantum mechanics

In this paper we present an analysis of the possible equivalence of Dirac and Maxwell equations using the Clifford bundle formalism and compare it with Campolattaro's approach, which uses the traditional tensor calculus and the standard Dirac covariant spinor field. We show that Campolattaro's intricate calculations can be proved in few lines in our formalism. We briefly discuss the implications of our findings for the interpretation of quantum mechanics.     

Complex Geometry and Dirac Equation

Complex geometry represents a fundamentalingredient in the formulation of the Dirac equation bythe Clifford algebra. The choice of appropriate complexgeometries is strictly related to the geometricinterpretation of the complex imaginary unit . We discuss two possibilities which appearin the multivector algebra approach: the₁₂₃ and ₂₁ complexgeometries. Our formalism provides a set of rules which allows an immediate translation between thecomplex standard Dirac theory and its version withingeometric algebra. The problem concerning a doublegeometric interpretation for the complex imaginary unit is also discussed.     

Covariant Hamiltonian for the electromagnetic two-body problem

We give a Hamiltonian formalism for the delay equations of motion of the electromagnetic two-body problem with arbitrary masses and with either repulsive or attractive interaction. This dynamical system based on action-at-a-distance electrodynamics appeared 100 years ago and it was popularized in the 1940s by the Wheeler and Feynman program to quantize it as a means to overcome the divergencies of perturbative QED. Our finite-dimensional implicit Hamiltonian is closed and involves no series expansions. As an application, the Hamiltonian formalism is used to construct a semiclassical canonical quantization based on the numerical trajectories of the attractive problem.     

On Clique-Transversals and Clique-Independent Sets

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. A clique-independent set is a subset of pairwise disjoint cliques of G. Denote by _C (G) and _C (G) the cardinalities of the minimum clique-transversal and maximum clique-independent set of G, respectively. Say that G is clique-perfect when _C (H)= _C (H), for every induced subgraph H of G. In this paper, we prove that every graph not containing a 4-wheel nor a 3-fan as induced subgraphs and such that every odd cycle of length greater than 3 has a short chord is clique-perfect. The proof leads to polynomial time algorithms for finding the parameters _C (G) and _C (G), for graphs belonging to this class. In addition, we prove that to decide whether or not a given subset of vertices of a graph is a clique-transversal is Co-NP-Complete. The complexity of this problem has been mentioned as unknown in the literature. Finally, we describe a family of highly clique-imperfect graphs, that is, a family of graphs G whose difference _C (G)– _C (G) is arbitrarily large.     

Sources and Sinks in Comparability Graphs

We prove that a subset S of vertices of a comparability graph G is a source set if and only if each vertex of S is a source and there is no odd induced path in G between two vertices of S. We also characterize pairs of subsets corresponding to sources and sinks, respectively. Finally, an application to interval graphs is obtained.     

Algorithms for finding clique-transversals of graphs

A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is NP-hard to determine the minimum cardinality τ _c of a clique-transversal of G. In this work, first we propose an algorithm for determining this parameter for a general graph, which runs in polynomial time, for fixed τ _c . This algorithm is employed for finding the minimum cardinality clique-transversal of [`(3K₂)]\overline{3K_{2}} -free circular-arc graphs in O(n ⁴) time. Further we describe an algorithm for determining τ _c of a Helly circular-arc graph in O(n) time. This represents an improvement over an existing algorithm by Guruswami and Pandu Rangan which requires O(n ²) time. Finally, the last proposed algorithm is modified, so as to solve the weighted version of the corresponding problem, in O(n ²) time.