We present an algorithm for constructing the characteristic polynomial of a threshold graph’s adjacency matrix. The algorithm is based on a diagonalization procedure that is easy to describe. It can be implemented using O(n) space and with running time O(n). Submitted: December 2013 Reviewed: October 2014 Revised: November 2014 Accepted: December 2014 Final: December 2014 Published: December 20...

Article history: Received 31 October 2014 Available online xxxx

Modern Personal Digital Assistant (PDA) architectures often use a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient, in terms of bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) based...

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic polynomial of a multiarrangement which generalizes the characteristic polynomial of an arragnement. The characteristic polynomial of an arrangement is a combinatori...