We consider intersections of $n$ diagonal forms degrees $k_1 \lt \cdots k_n$, and we prove an asymptotic formula for the number rational points bounded height on these varieties. The proof uses Hardy–Littlewood method recent breakthro

The study of a variation the marking game, in which first player marks vertices and second edges an undirected graph was proposed by Bartnicki et al. (Electron J Combin 15:R72, 2008). In this goal is to mark as many around unmarked vertex possible, while wants just opposite. paper, we prove various bounds for corresponding invariant, vertex-edge coloring number $${\text {col}}_\mathrm{ve}(G)$$ ...

Mobile Code is an emerging paradigm that is gaining momentum in several elds of application. Network Management is a potential area for the use of this technology, provided it will be able to interoperate with well established solutions for Network Management. This paper presents the integration a classic NM protocol, like SNMP, into a platform of Mobile Agents. Our platform, called JAMES, has ...

This paper presents an overview of JAMES, a Java-based platform of mobile agents that is mainly oriented for the management of data and telecommunication networks. This platform has been developed on behalf of a Eureka Project ( !1921) and the project partners are Siemens SA, University of Coimbra and Siemens AG. We describe the main architecture of the platform giving more emphasis to the most...

Given a graph $G$, 2-coloring of the edges $K_n$ is said to contain balanced copy $G$ if we can find such that half its in each color class. If there exists an integer $k$ that, for $n$ sufficiently large, every with more than contains then say balanceable. The smallest this holds called balancing number $G$.In paper, define general variant number, generalized by considering 2-coverings edge se...