arXiv subjects

Marcello Mamino

Publications and source records attributed to Marcello Mamino.

27 records · Page 2Linked to original sources

arXiv2014

On the Computing Power of $+$, $-$, and $\times$

Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision problems that can be solved in polynomial time in the new model by machines with no machine constants. How does this class depend on $B$? We prove that it is always contained in the class obtained for $B = \{+, -, \times\}$. Moreover, if $B$ is a set of continuous semialgebraic functions containing $+$ and $-$, and such that arbitrarily small numbers can be computed using $B$, then we have the following dichotomy: either our class is $\mathsf P$ or it coincides with the class obtained for $B = \{+, -, \times\}$.

cs.CC↗

arXiv2014

Condensation and topological phase transitions in a dynamical network model with rewiring of the links

Growing network models with both heterogeneity of the nodes and topological constraints can give rise to a rich phase structure. We present a simple model based on preferential attachment with rewiring of the links. Rewiring probabilities are modulated by the negative fitness of the nodes and by the constraint for the network to be a simple graph. At low temperatures and high rewiring rates, this constraint induces a Bose-Einstein condensation of paths of length 2, i.e. a new phase transition with an extended condensate of links. The phase space of the model includes further transitions in the scaling of the connected component and the degeneracy of the network.

cond-mat.dis-nn↗

arXiv2014

Duality between preferential attachment and static random networks on hyperbolic spaces

There is a complex relation between the mechanism of preferential attachment, scale-free degree distributions and hyperbolicity in complex networks. In fact, both preferential attachment and hidden hyperbolic spaces often generate scale-free networks. We show that there is actually a duality between a class of growing spatial networks based on preferential attachment on the sphere and a class of static random networks on the hyperbolic plane. Both classes of networks have the same scale-free degree distribution as the Barabasi-Albert model. As a limit of this correspondence, the Barabasi-Albert model is equivalent to a static random network on an hyperbolic space with infinite curvature.

cond-mat.dis-nn↗

arXiv2013

Groups definable in two orthogonal sorts

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two structures is superstable of finite Lascar rank and the Lascar rank is definable, then G is an extension of a group internal to the (possibly) unstable sort by a definable subgroup internal to the stable sort. In the final part of the paper we show that if the unstable sort is an o-minimal expansion of the reals, then G has a natural Lie structure and the extension is a topological cover.

math.LO↗

arXiv2012

On the computational complexity of a game of cops and robbers

We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme. The game takes place on an undirected graph where n simultaneously moving cops attempt to capture a single robber, all moving at the same speed. The players are allowed to pick their starting positions at the first move. The question of the computational complexity of deciding this game was raised in the '90s by Goldstein and Reingold. We prove that the game is hard for PSPACE.

cs.CC↗

arXiv2012

Discrete subgroups of locally definable groups

We work in the category of locally definable groups in an o-minimal expansion of a field. Eleftheriou and Peterzil conjectured that every definably generated abelian connected group G in this category is a cover of a definable group. We prove that this is the case under a natural convexity assumption inspired by the same authors, which in fact gives a necessary and sufficient condition. The proof is based on the study of the zero-dimensional compatible subgroups of G. Given a locally definable connected group G (not necessarily definably generated), we prove that the n-torsion subgroup of G is finite and that every zero-dimensional compatible subgroup of G has finite rank. Under a convexity hypothesis we show that every zero-dimensional compatible subgroup of G is finitely generated.

math.LO↗

arXiv2011

Splitting definably compact groups in o-minimal structures

An argument of A.Borel shows that every compact connected Lie group is homeomorphic to the Cartesian product of its derived subgroup and a torus. We prove a parallel result for definably compact definably connected groups definable in an o-minimal expansion of a real closed field. As opposed to the Lie case, however, we provide an example showing that the derived subgroup may not have a definable semidirect complement.

math.LO↗

arXiv2009

Higher homotopy of groups definable in o-minimal structures

It is known that a definably compact group G is an extension of a compact Lie group L by a divisible torsion-free normal subgroup. We show that the o-minimal higher homotopy groups of G are isomorphic to the corresponding higher homotopy groups of L. As a consequence, we obtain that all abelian definably compact groups of a given dimension are definably homotopy equivalent, and that their universal cover are contractible.

math.LO↗

arXiv2008

Arithmetic of Dedekind cuts of ordered Abelian groups

We study the set of Dedekind cuts over a linearly ordered Abelian group as a structure over the language (0,<,+,-). Moreover, we obtain a simple set of axioms for the universal part of the theory of such structures. Finally, we prove that every structure satisfying the given axioms is a sub-structure of the set of cuts over a suitable group.

math.LO↗