We analyze and compare geometrical theories based on mereology (mereogeometries). Most theories in this area lack in formalization, and this prevents any systematic logical analysis. To overcome this problem, we concentrate on specific interpretations for the primitives and use them to isolate comparable models for each theory. Relying on the chosen interpretations, we introduce the notion of e...

Let G = (V,E) be a graph of density p on n vertices. Following Erdős, Luczak and Spencer [11], an m-vertex subgraph H of G is called full if H has minimum degree at least p(m − 1). Let f(G) denote the order of a largest full subgraph of G. If p ( n 2 ) is a positive integer, define fp(n) = min{f(G) : |V (G)| = n, |E(G)| = p ( n 2 ) }. Erdős, Luczak and Spencer [11] proved that if p = 1 2 , then...

Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. We extend earlier models’ definitions of substitutability to settings in which each agent can be both a buyer in some transactions and a seller in others, and show that all these de...

Almost all public library funding in the United States iscontrolled by local, state, and/or federal budgets, policies,and laws. Influencing budgets, policies, and laws happensthrough lobbying and advocacy campaigns. When signifi-cant changes or cuts to library funding are proposed, howdo stakeholders respond and what is the potential out-come of advocacy efforts? As (fic...

In silico Optimization of a FragmentBased Hit Yields Biologically Active, High-Efficiency Inhibitors for Glutamate Racemase FERM conclusions: A novel lead compound for inhibition of the antibacterial drug target, glutamate racemase, was optimized for both potency and lipophilic efficiency. A hybrid MD–docking and scoring scheme, FERM-SMD, was used to predict the relative potencies of potential ...

We do a thorough mathematical study of the notion of full conglomerability, that is, conglomerability with respect to all the partitions of an infinite possibility space, in the sense considered by Peter Walley [1991]. We consider both the cases of precise and imprecise probability (sets of probabilities). We establish relations between conglomerability and countable additivity, continuity, sup...