arXiv subjects

G. Greco

Publications and source records attributed to G. Greco.

27 records · Page 2Linked to original sources

arXiv2011

Evidence of Deterministic Components in the Apparent Randomness of GRBs: Clues of a Chaotic Dynamic

Prompt γ-ray emissions from gamma-ray bursts (GRBs) exhibit a vast range of extremely complex temporal structures with a typical variability time-scale significantly short - as fast as milliseconds. This work aims to investigate the apparent randomness of the GRB time profiles making extensive use of nonlinear techniques combining the advanced spectral method of the Singular Spectrum Analysis (SSA) with the classical tools provided by the Chaos Theory. Despite their morphological complexity, we detect evidence of a non stochastic short-term variability during the overall burst duration - seemingly consistent with a chaotic behavior. The phase space portrait of such variability shows the existence of a well-defined strange attractor underlying the erratic prompt emission structures. This scenario can shed new light on the ultra-relativistic processes believed to take place in GRB explosions and usually associated with the birth of a fast-spinning magnetar or accretion of matter onto a newly formed black hole.

astro-ph.HE↗

arXiv2011

Pure Nash Equilibria: Hard and Easy Games

We investigate complexity issues related to pure Nash equilibria of strategic games. We show that, even in very restrictive settings, determining whether a game has a pure Nash Equilibrium is NP-hard, while deciding whether a game has a strong Nash equilibrium is SigmaP2-complete. We then study practically relevant restrictions that lower the complexity. In particular, we are interested in quantitative and qualitative restrictions of the way each players payoff depends on moves of other players. We say that a game has small neighborhood if the utility function for each player depends only on (the actions of) a logarithmically small number of other players. The dependency structure of a game G can be expressed by a graph DG(G) or by a hypergraph H(G). By relating Nash equilibrium problems to constraint satisfaction problems (CSPs), we show that if G has small neighborhood and if H(G) has bounded hypertree width (or if DG(G) has bounded treewidth), then finding pure Nash and Pareto equilibria is feasible in polynomial time. If the game is graphical, then these problems are LOGCFL-complete and thus in the class NC2 of highly parallelizable problems.

cs.GT↗

arXiv2010

Photometry and spectroscopy of GRB 060526: A detailed study of the afterglow and host galaxy of a z=3.2 gamma-ray burst

Aims: With this paper we want to investigate the highly variable afterglow light curve and environment of gamma-ray burst (GRB) 060526 at $z=3.221$. Methods: We present one of the largest photometric datasets ever obtained for a GRB afterglow, consisting of multi-color photometric data from the ultraviolet to the near infrared. The data set contains 412 data points in total to which we add additional data from the literature. Furthermore, we present low-resolution high signal-to-noise spectra of the afterglow. The afterglow light curve is modeled with both an analytical model using broken power law fits and with a broad-band numerical model which includes energy injections. The absorption lines detected in the spectra are used to derive column densities using a multi-ion single-component curve-of-growth analysis from which we derive the metallicity of the host of GRB 060526. Results: The temporal behaviour of the afterglow follows a double broken power law with breaks at $t=0.090\pm0.005$ and $t=2.401\pm0.061$ days. It shows deviations from the smooth set of power laws that can be modeled by additional energy injections from the central engine, although some significant microvariability remains. The broadband spectral-energy distribution of the afterglow shows no significant extinction along the line of sight. The metallicity derived from \ion{S}{II} and \ion{Fe}{II} of [S/H] = --0.57 $\pm$0.25 and [Fe/H] = --1.09$\pm$0.24 is relatively high for a galaxy at that redshift but comparable to the metallicity of other GRB hosts at similar redshifts. At the position of the afterglow, no host is detected to F775W(AB) = 28.5 mag with the HST, implying an absolute magnitude of the host M(1500 Å)$>$--18.3 mag which is fainter than most long-duration hosts, although the GRB may be associated with a faint galaxy at a distance of 11 kpc.

astro-ph↗

arXiv2009

Analysis of the Prompt Optical Emission of the Naked-Eye GRB 080319B

We present the observed/intrinsic optical parameters and the variability analysis of the Naked-Eye Burst, GRB 080319B, observed by the TORTORA wide-field optical monitoring system. The event is extreme not only in observed properties but also intrinsically: it is the most luminous event ever recorded at optical wavelengths. The temporal properties suggest short-lived periodic activities of the internal engine. This is the fastest optically variable source detected at cosmological distances.

astro-ph.HE↗

arXiv2009

Fast optical variability of Naked-Eye Burst - manifestation of periodic activity of internal engine

We imaged the position of the Naked-Eye Burst, GRB080319B, before, during and after its gamma-ray activity with sub-second temporal resolution and discovered the fast variability of its prompt optical emission. Its characteristics and similarity with properties of gamma emission temporal structure suggest that it reflects the behaviour of internal engine -- supposedly, a hyperaccreting solar-mass black hole formed in the collapse of a massive stellar core.

astro-ph.HE↗

arXiv2008

GRB 080319B: A Naked-Eye Stellar Blast from the Distant Universe

Long duration gamma-ray bursts (GRBs) release copious amounts of energy across the entire electromagnetic spectrum, and so provide a window into the process of black hole formation from the collapse of a massive star. Over the last forty years, our understanding of the GRB phenomenon has progressed dramatically; nevertheless, fortuitous circumstances occasionally arise that provide access to a regime not yet probed. GRB 080319B presented such an opportunity, with extraordinarily bright prompt optical emission that peaked at a visual magnitude of 5.3, making it briefly visible with the naked eye. It was captured in exquisite detail by wide-field telescopes, imaging the burst location from before the time of the explosion. The combination of these unique optical data with simultaneous gamma-ray observations provides powerful diagnostics of the detailed physics of this explosion within seconds of its formation. Here we show that the prompt optical and gamma-ray emissions from this event likely arise from different spectral components within the same physical region located at a large distance from the source, implying an extremely relativistic outflow. The chromatic behaviour of the broadband afterglow is consistent with viewing the GRB down the very narrow inner core of a two-component jet that is expanding into a wind-like environment consistent with the massive star origin of long GRBs. These circumstances can explain the extreme properties of this GRB.

astro-ph↗

arXiv2007

GRBs with optical afterglow and known redshift: a statistical study

We present a correlation between two intrinsic parameters of GRB optical afterglows. These are the isotropic luminosity at the maximum of the light curve (Lpeak) and the time-integrated isotropic energy (Eiso) radiated after the observed maximum. We test the correlation between the logarithms of (Eiso) and (Lpeak) and finally we value the effect of the different samples of GRBs in according with the first optical observation reduced to proper time.

astro-ph↗

arXiv2004

Optimization of Bound Disjunctive Queries with Constraints

"To Appear in Theory and Practice of Logic Programming (TPLP)" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the size of the data relevant to answer the query and, consequently, reduces both the complexity of computing a single model and the number of models to be considered. The motivation of this work stems from the observation that traditional binding propagation optimization techniques for bottom-up model generator systems, simulating the goal driven evaluation of top-down engines, are only suitable for positive (disjunctive) queries, while hard problems are expressed using unstratified negation. The main contribution of the paper consists in the extension of a previous technique, defined for positive disjunctive queries, to queries containing both disjunctive heads and constraints (a simple and expressive form of unstratified negation). As the usual way of expressing declaratively hard problems is based on the guess-and-check technique, where the guess part is expressed by means of disjunctive rules and the check part is expressed by means of constraints, the technique proposed here is highly relevant for the optimization of queries expressing hard problems. The value of the technique has been proved by several experiments.

cs.LO↗

arXiv2003

A Splitting Lemma

In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise non-adjacent vertices) of the graph. Our analysis shows that the stability number of every graph G can be decomposed in the sum of the stability number of a subgraph containing a perfect 2-matching (i.e. a system of vertex-disjoint odd-cycles and edges covering the vertex-set) plus a term computable in polynomial time. As a consequence, it is possible to bound from above and below the stability number in terms of the matching number of a subgraph having a perfect 2-matching and other quantities computable in polynomial time. Our results are closely related to those by Lorentzen, Balinsky, Spielberg, and Pulleyblank on the linear relaxation of the vertex-cover problem. Moreover, The convex programming problem involved has important applications in information theory and extremal set theory where, as a graph capacity formula, has been used to answer a longstanding open question about qualitatively independet sets in the sense of Renyi (L. Gargano, J. K{ö}rner, and U. Vaccaro, "Sperner capacities", Graphs and combinatorics, 9:31-46, 1993).

math.CO↗