Homogeneous geodesics of non-unimodular Lorentzian Lie groups and naturally reductive Lorentzian spaces in dimension three

We determine, for all three-dimensional non-unimodular Lie groups equipped with a Lorentzian metric, the set of homogeneous geodesics through a point. Together with the results of [C] and [CM2], this leads to the full classification of three-dimensional Lorentzian g.o. spaces and naturally reductive spaces

Coherent states for a particle on a sphere

The coherent states for a particle on a sphere are introduced. These states are labelled by points of the classical phase space, that is the position on the sphere and the angular momentum of a particle. As with the coherent states for a particle on a circle discussed in Kowalski K {\em et al} 1996 {\em J. Phys. A} {\bf 29} 4149, we deal with a deformation of the classical phase space related with quantum fluctuations. The expectation values of the position and the angular momentum in the coherent states are regarded as the best possible approximation of the classical phase space. The correctness of the introduced coherent states is illustrated by an example of the rotator.Comment: LaTeX, 16 pages, 2 figure

Scalar field theory on κ\kappa-Minkowski space-time and Doubly Special Relativity

In this paper we recall the construction of scalar field action on $\kappa$-Minkowski space-time and investigate its properties. In particular we show how the co-product of $\kappa$-Poincar\'e algebra of symmetries arises from the analysis of the symmetries of the action, expressed in terms of Fourier transformed fields. We also derive the action on commuting space-time, equivalent to the original one. Adding the self-interaction $\Phi^4$ term we investigate the modified conservation laws. We show that the local interactions on $\kappa$-Minkowski space-time give rise to 6 inequivalent ways in which energy and momentum can be conserved at four-point vertex. We discuss the relevance of these results for Doubly Special Relativity.Comment: 17 pages; some editing done, final version to be published in Int. J. Mod. Phys.

Nonlinear dynamics of a semiquantum Hamiltonian in the vicinity of quantum unstable regimes

We examine the emergence of chaos in a non-linear model derived from a semiquantum Hamiltonian describing the coupling between a classical field and a quantum system. The latter corresponds to a bosonic version of a BCS-like Hamiltonian, and possesses stable and unstable regimes. The dynamics of the whole system is shown to be strongly influenced by the quantum subsystem. In particular, chaos is seen to arise in the vicinity of a quantum critical case, which separates the stable and unstable regimes of the bosonic system.Comment: 14 pages, 6 figure

Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader

Counting the number of nodes in {Anonymous Dynamic Networks} is enticing from an algorithmic perspective: an important computation in a restricted platform with promising applications. Starting with Michail, Chatzigiannakis, and Spirakis [Michail et al., 2013], a flurry of papers sped up the running time guarantees from doubly-exponential to polynomial [Dariusz R. Kowalski and Miguel A. Mosteiro, 2018]. There is a common theme across all those works: a distinguished node is assumed to be present, because Counting cannot be solved deterministically without at least one. In the present work we study challenging questions that naturally follow: how to efficiently count with more than one distinguished node, or how to count without any distinguished node. More importantly, what is the minimal information needed about these distinguished nodes and what is the best we can aim for (count precision, stochastic guarantees, etc.) without any. We present negative and positive results to answer these questions. To the best of our knowledge, this is the first work that addresses them

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

Starting with Michail, Chatzigiannakis, and Spirakis work [Michail et al., 2013], the problem of Counting the number of nodes in {Anonymous Dynamic Networks} has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of communication, as long as the network is connected in each round. The problem is central in distributed computing as the number of participants is frequently needed to make important decisions, such as termination, agreement, synchronization, and many others. A variety of algorithms built on top of mass-distribution techniques have been presented, analyzed, and also experimentally evaluated; some of them assumed additional knowledge of network characteristics, such as bounded degree or given upper bound on the network size. However, the question of whether Counting can be solved deterministically in sub-exponential time remained open. In this work, we answer this question positively by presenting Methodical Counting, which runs in polynomial time and requires no knowledge of network characteristics. Moreover, we also show how to extend Methodical Counting to compute the sum of input values and more complex functions without extra cost. Our analysis leverages previous work on random walks in evolving graphs, combined with carefully chosen alarms in the algorithm that control the process and its parameters. To the best of our knowledge, our Counting algorithm and its extensions to other algebraic and Boolean functions are the first that can be implemented in practice with worst-case guarantees