415 research outputs found
Alica Ann McCarty
No full textAlice Ann (Nolan) McCarty, the mother of 11 children and a longtime resident of Palo Alto, has died. She was 94. McCarty died peacefully and surrounded by family on Nov. 29, at home in Redwood City. After World War II, she married her high school sweetheart, Leo Robert McCarty, and they came to California, where Leo attended Stanford University. They were married 58 years when he died in 2004. A stay-at-home mother for the first 15 years of their marriage, she later worked part-and full-time, as needed, mastering computer programs as they evolved. A long-time member at Our Lady of the Rosary Church, and St. Thomas Aquinas Parish, she volunteered in many capacities through the years. All of her children survive her: Michael (Cathy), Kevin (Elena), Kathleen, Maureen Mandell, Mary Aileen Fehrenbacher (David), Nora Lundin (Chris), Rose Emanuel (Charlie Weir), Theresa Young (Jim), John (Alessandra), Kieran and Robert (Kathleen). She is also survived by 22 grandchildren
On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification
No full textGraph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded treedepth, and they are a special case of graph classes of bounded expansion. We introduce a notion of decomposition for these classes and show that these decompositions can be efficiently computed. Also, a natural extension of our decomposition leads to a new characterization and decomposition for graph classes of bounded expansion (and an efficient algorithm computing this decomposition).
We then focus on interpretations of graph classes of bounded tree rank. We give a characterization of graph classes interpretable in graph classes of tree rank 2. Importantly, our characterization leads to an efficient sparsification procedure: For any graph class interpretable in a graph class of tree rank at most 2, there is a polynomial time algorithm that to any G ∈ computes a (sparse) graph H from a fixed graph class of tree rank at most 2 such that G = I(H) for a fixed interpretation I. To the best of our knowledge, this is the first efficient "interpretation reversal" result that generalizes the result of Gajarský et al. [LICS 2016], who showed an analogous result for graph classes interpretable in classes of graphs of bounded degree
Obstructions for bounded shrub-depth and rank-depth
No full textShrub-depth and rank-depth are dense analogues of the tree-depth of a graph.
It is well known that a graph has large tree-depth if and only if it has a long
path as a subgraph. We prove an analogous statement for shrub-depth and
rank-depth, which was conjectured by Hlin\v{e}n\'y, Kwon, Obdr\v{z}\'alek, and
Ordyniak [Tree-depth and vertex-minors, European J.~Combin. 2016]. Namely, we
prove that a graph has large rank-depth if and only if it has a vertex-minor
isomorphic to a long path. This implies that for every integer , the class
of graphs with no vertex-minor isomorphic to the path on vertices has
bounded shrub-depth.Comment: 19 pages, 5 figures; accepted to Journal of Combinatorial Theory Ser.
Colouring Polygon Visibility Graphs and Their Generalizations
No full textCurve pseudo-visibility graphs generalize polygon and pseudo-polygon visibility graphs and form a hereditary class of graphs. We prove that every curve pseudo-visibility graph with clique number ω has chromatic number at most 3⋅4^{ω-1}. The proof is carried through in the setting of ordered graphs; we identify two conditions satisfied by every curve pseudo-visibility graph (considered as an ordered graph) and prove that they are sufficient for the claimed bound. The proof is algorithmic: both the clique number and a colouring with the claimed number of colours can be computed in polynomial time
Letter to E. C. McCarty from John S. Watts
No full textLetter to E. C. McCarty from John S. Watts, former judge, attorney, Santa Fe, regarding what he had found out about the estate of his deceased brother, Isaac McCarty. Watts had not received any letters or payment from the McCarty family to do the investigation thus far. He learned that the partner Ceran St. Vrain and Preston Beck were both away for month. St. Vrain had paid the debts of McCarty amounting to 30.000, the remaining could be divided between St. Vrain and the family. There was also a contract for flour with the goverment, the value of which was unknown. Watts did not want to proceed further without authorization and promise of compensation. A transcript in the handwriting of the author. Document in English, 3 pp/fr, missing heading page
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs
No full textIn this paper, we consider the class ^d of sphere intersection graphs in R^d for d ≥ 2. We show that for each integer t, the class of all graphs in ^d that exclude K_{t,t} as a subgraph has strongly sublinear separators. We also prove that ^d has asymptotic dimension at most 2d+2
The Woman Diver and the Dragon Ball
No full textA Noh play and temple chronicle, thought to have prehistoric origins in one of the oldest professions, was translated for the Shikoku Bilingual Guidebook by Akiko Takemoto and Steve McCarty. The co-author narrates this podcast, telling the heart-wrenching story of a woman's ultimate sacrifice, with an overlay of Buddhism and archetypal symbolism. After the story, some discussion questions are suggested to have listeners consider the significance of the story and the East Asian cultural value conflicts involved
Recommended from our members
Unlikely Allies in the Academy
No full textPart three of the Unlikely Allies in the Academy Series, hosted by the Office of Diversity and Inclusion for continued dialogue based upon the book "Unlikely Allies in the Academy: Women of Color and White Women in Conversation." This video features Dr. Theresa Torres, author of the chapter “A Latina Testimonio: Challenges as an Academic, Issues of Difference, and a Call for Solidarity with White Female Academics” and her colleague, diversity expert and independent scholar Lisa McCarty
二言語による子育てに関する著述 (Interviews & articles in Japanese on bilingual child-raising)
No full textMain magazine & online interviews and articles on bilingual child-raising by the author in Japanese from 2007-2010: 1) 「いつ話すかな？英語の言葉」 [When will children start speaking English? - Interview with the author and H. Toyota of Tokyo University of Technology], 2) 「英語を子ども自身の第二言語にする方法」 [How to make English a child’s second language], 3) 「インターネットでできる英語体験」[Experiencing English through the Internet], 4) 「日本でできるグローバル体験～英語や異文化の取り入れ方～」 [Global experiences in Japan by encountering English & other cultures], and 5) 「Steve A. McCarty先生インタビュー」[Interview with the author]. Tokyo: Benesse (an educational information corporation)
Independence and conservativity results for intuitionistic set theory
No full textThere are two main parts to this thesis. The first part will deal with some independence results. In 1979, Lifschitz in [13] introduced a realizability interpretation
for Heyting's arithmetic, HA, that could differentiate between Church's thesis with uniqueness condition, CT0!, and the general form of Church's thesis, CT0. The objective here is to extend Lifschitz' realizability to intuitionistic Zermelo-Fraenkel set theory with two sorts, IZFN. In addition to separating Church's thesis with uniqueness condition from its general form in intuitionistic set theory, I also obtain several interesting
corollaries. The interpretation repudiates a weak form of countable choice, ACN2, asserting that every countable family of inhabited subsets of {0,1} has a choice function.
The second part will be concerned with Constructive Zermelo-Fraenkel Set Theory and other intuitionistic set theories augmented by various principles, notably choice principles. It will be shown that the addition of these (choice) principles does not change the stock of provable arithmetical theorems.
This type of conservativity result has its roots in a theorem of Goodman[9] who showed that Heyting arithmetic in all nite types augmented by the axiom of choice for all levels is conservative over HA. The technique I employ here to obtain such results for intuitionistic set theories, however, owes a lot to a paper by Beeson published in 1979. In [2] he showed how to construe Goodman's Theorem as the composition of two interpretations, namely relativized realizability and forcing. In this thesis, I adopt the same
approach and employ it to a plethora of intuitionistic set theories
- …
