Abstract The significance of the two founder saints to contribution made by Jesuit missionaries, many whom became martyrs, making Roman Catholicism as a world religion, was explicit not at canonization ceremony itself, nor in celebratory processions through streets Rome, but events and decorations put up within spaces controlled Jesuits themselves Gesù, Collegio Romano, novitiate S. Andrea al Q...

We introduce directed acyclic graph (DAG) games, a generalization of standard tree games, to study cost sharing on networks. This structure has not been previously analyzed from a cooperative game theoretic perspective. Every monotonic and subadditive cost game – including monotonic minimum cost spanning tree games – can be modeled as a DAG-game. We provide an efficiently verifiable condition s...

The infinite-dimensional mechanics of fluids and plasmas can be formulated as “noncanonical” Hamiltonian systems on a phase space of Eulerian variables. Singularities of the Poisson bracket operator produce singular Casimir elements that foliate the phase space, imposing topological constraints on the dynamics. Here we proffer a physical interpretation of Casimir elements as adiabatic invariant...

This paper describe a system-level approach to improve the area and delay of datapath designs that perform polynomial computations over , which are used in many applications such as computer graphics and digital signal processing domains. This approach optimizes the implementation of multivariate polynomial systems in terms of the number of arithmetic operations by performing optimization on a ...

There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on DAG-networks. We briefly discuss the relation of DAG-games with other networkbased cost games. We demonstrate tha...

We consider S, the class of …nite semilattices; T , the class of …nite treeable semilattices; and Tm, the subclass of T which contains trees with branching bounded by m. We prove that ES, the class of …nite lattices with linear extensions, is a Ramsey class. We calculate Ramsey degrees for structures in S, T and Tm. In addition to this we give a topological interpretation of our results and we ...

We present a new algorithm to canonize molecular graphs using the signature molecular descriptor introduced in the previous papers of this series. While developed specifically for molecular structures, the algorithm can be used for any graph and is not limited to acyclic graphs, planar graphs, bounded valence, or bounded genus graphs, for which polynomial time algorithms exist. The algorithm is...