267 research outputs found

    Equi-Rank Homomorphism Preservation Theorem on Finite Structures

    No full text
    The Homomorphism Preservation Theorem (HPT) of classical model theory states that a first-order sentence is preserved under homomorphisms if, and only if, it is equivalent to an existential-positive sentence. This theorem remains valid when restricted to finite structures, as demonstrated by the author in [Rossman, 2008; Rossman, 2017] via distinct model-theoretic and circuit-complexity based proofs. In this paper, we present a third (and significantly simpler) proof of the finitary HPT based on a generalized Cai-Fürer-Immerman construction. This method establishes a tight correspondence between syntactic parameters of a homomorphism-preserved sentence (quantifier rank, variable width, alternation height) and structural parameters of its minimal models (tree-width, tree-depth, decomposition height). Consequently, we prove a conjectured "equi-rank" version of the finitary HPT. In contrast, previous versions of the finitary HPT possess additional properties, but incur blow-ups in the quantifier rank of the equivalent existential-positive sentence

    Rossman_online_supplement – Supplemental material for It’s Only Wrong If It’s Transactional: Moral Perceptions of Obfuscated Exchange

    No full text
    Supplemental material, Rossman_online_supplement for It’s Only Wrong If It’s Transactional: Moral Perceptions of Obfuscated Exchange by Oliver Schilke and Gabriel Rossman in American Sociological Review</p

    sj-pdf-1-asr-10.1177_00031224241232599 – Supplemental material for Honor among Crooks: The Role of Trust in Obfuscated Disreputable Exchange

    No full text
    Supplemental material, sj-pdf-1-asr-10.1177_00031224241232599 for Honor among Crooks: The Role of Trust in Obfuscated Disreputable Exchange by Oliver Schilke and Gabriel Rossman in American Sociological Review</p

    Glory and Gore

    No full text
    Who’s the most important character in the Iliad? That depends. Using the poem, Rossman illustrates how to understand related but conceptually distinct concepts through social network analysis. </jats:p

    An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity

    No full text
    Previous work of the author [Rossmann'08] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a reduction to lower bounds in circuit complexity, specifically on the AC0 formula size of the colored subgraph isomorphism problem. Formally, we show the following: if a first-order sentence of quantifier-rank k is preserved under homomorphisms on finite structures, then it is equivalent on finite structures to an existential-positive sentence of quantifier-rank poly(k). Quantitatively, this improves the result of [Rossmann'08], where the upper bound on quantifier-rank is a non-elementary function of k

    Criticality of Regular Formulas

    No full text
    We define the criticality of a boolean function f : {0,1}^n -> {0,1} as the minimum real number lambda >= 1 such that Pr [DT_{depth}(f|R_p) >= t] = k. In an unpublished manuscript [Rossmann, 2018], the author showed that a combination of Håstad’s switching and multi-switching lemmas [Håstad, 1986; Håstad, 2014] implies that AC^0 circuits of depth d+1 and size s have criticality at most O(log s)^d. In the present paper, we establish a stronger O(1/d log s)^d bound for regular formulas: the class of AC^0 formulas in which all gates at any given depth have the same fan-in. This result is based on (i) a novel switching lemma for bounded size (unbounded width) DNF formulas, and (ii) an extension of (i) which analyzes a canonical decision tree associated with an entire depth-d formula. As corollaries of our criticality bound, we obtain an improved #SAT algorithm and tight Linial-Mansour-Nisan Theorem for regular formulas, strengthening previous results for AC^0 circuits due to Impagliazzo, Matthews, Paturi [Impagliazzo et al., 2012] and Tal [Tal, 2017]. As a further corollary, we increase from o(log n /(log log n)) to o(log n) the number of quantifier alternations for which the QBF-SAT (quantified boolean formula satisfiability) algorithm of Santhanam and Williams [Santhanam and Williams, 2014] beats exhaustive search

    Televisions, Physicians, and Life Expectancy

    No full text
    This article, created by Allan Rossman of Dickinson College, describes a dataset on life expectancies, densities of people per television set, and densities of people per physician in various countries of the world. The example addresses correlation versus causation and data transformations. The author states that &quot;the example has proven very useful for helping students to discover the fundamental principle that correlation does not imply causation.&quot

    Gettin’ Down on “Friday”

    No full text
    Rebecca Black’s “Friday” may be annoying and ubiquitous, but it’s also a great example of contemporary cultural production. The author explores the making of a meme and the many hands behind a hit. </jats:p
    corecore