Ricerc@Sapienza

I argue that the construction of representation theorems is a powerful tool for creating novel objects and theories in mathematics, as the construction of a new representation introduces new pieces of information in a very specific way that enables a solution for a problem and a proof of a new theorem. In more detail, I show how the work behind the proof of a representation theorem transforms a mathematical problem in a way that makes it tractable and introduces information into it that it did not contain at the beginning of the process.

This paper presents the design of a novel low-voltage high-speed D-latch circuit suitable for nanometer CMOS technologies. The proposed topology is compared against the low-voltage triple-tail D-latch and its advantages are demonstrated both by simulations, under different performance/power consumption tradeoffs with a 40-nm CMOS technology, and theoretically, thanks to a simple model of the propagation delay derived for both low-voltage topologies.

The visualization of large graphs in interactive applications, specifically on small devices, can make harder to understand and analyze the displayed information. We show as simple topological properties of the graph can provide an efficient automatic computation of features which improves the 'readibility' of a large graph by a proper selection of the displayed information.