3,581 research outputs found
Art-Rite
No full text"Edited by Walter Robinson, Edit DeAk, and Joshua Cohn, Art-Rite was published in New York City between 1973 and 1978. The periodical has long been celebrated for its underground/overground position and its cutting, humorous, on-the-streets coverage and critique of the art world. Art-Rite moved easily through the expansive community it mapped out, paying homage to an emergent generation of artists, including many who were—or would soon become—the defining voices of the era. Through hundreds of interviews, reviews, statements, and projects for the page—as well as artist-focused and thematic issues on video, painting, performance, and artists’ books—Art-Rite’s sharp editorial vision and commitment to spotlighting the work of artists stands as a meaningful and lasting contribution to the art history of New York City and beyond. All issues of Art-Rite are collected and published here." -- Distributor's website
Voyage of the Northern Light : newspaper reports and articles.
No full textCover title.; For private circulation only.; Contains typescript copy of a letter from the author to the Daily telegraph.; Library's N copy is inscribed "To the Editor Bulletin, Joshua Slocum ... Strictly private". ANL; Electronic reproduction. Canberra, A.C.T. : National Library of Australia, 2009
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Finite Matrix Multiplication Algorithms from Infinite Groups
No full textThe Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group G satisfying a simple combinatorial condition (the Triple Product Property). The complexity of such an algorithm then depends on the representation theory of G. In this paper we extend the group-theoretic framework to the setting of infinite groups. In particular, this allows us to obtain constructions in Lie groups, with favorable parameters, that are provably impossible in finite groups of Lie type (Blasiak, Cohn, Grochow, Pratt, and Umans, ITCS '23). Previously the Lie group setting was investigated purely as an analogue of the finite group case; a key contribution in this paper is a fully developed framework for obtaining bona fide matrix multiplication algorithms directly from Lie group constructions.
As part of this framework, we introduce "separating functions" as a necessary new design component, and show that when the underlying group is G = GL_n, these functions are polynomials with their degree being the key parameter. In particular, we show that a construction with "half-dimensional" subgroups and optimal degree would imply ω = 2. We then build up machinery that reduces the problem of constructing optimal-degree separating polynomials to the problem of constructing a single polynomial (and a corresponding set of group elements) in a ring of invariant polynomials determined by two out of the three subgroups that satisfy the Triple Product Property. This machinery combines border rank with the Lie algebras associated with the Lie subgroups in a critical way.
We give several constructions illustrating the main components of the new framework, culminating in a construction in a special unitary group that achieves separating polynomials of optimal degree, meeting one of the key challenges. The subgroups in this construction have dimension approaching half the ambient dimension, but (just barely) too slowly. We argue that features of the classical Lie groups make it unlikely that constructions in these particular groups could produce nontrivial bounds on ω unless they prove ω = 2. One way to get ω = 2 via our new framework would be to lift our existing construction from the special unitary group to GL_n, and improve the dimension of the subgroups from (dim G)/2 - Θ(n) to (dim G)/2 - o(n)
Matrix Multiplication via Matrix Groups
No full textIn 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining ω = 2, while other families of groups remain potentially viable. In this paper we turn our attention to matrix groups, whose usefulness within this framework was relatively unexplored.
We first show that groups of Lie type cannot prove ω = 2 within the group-theoretic approach. This is based on a representation-theoretic argument that identifies the second-smallest dimension of an irreducible representation of a group as a key parameter that determines its viability in this framework. Our proof builds on Gowers' result concerning product-free sets in quasirandom groups. We then give another barrier that rules out certain natural matrix group constructions that make use of subgroups that are far from being self-normalizing.
Our barrier results leave open several natural paths to obtain ω = 2 via matrix groups. To explore these routes we propose working in the continuous setting of Lie groups, in which we develop an analogous theory. Obtaining the analogue of ω = 2 in this potentially easier setting is a key challenge that represents an intermediate goal short of actually proving ω = 2. We give two constructions in the continuous setting, each of which evades one of our two barriers
Indigeous author talk
No full textA unique online author event celebrating the diversity of literature created by and for Two-Spirit and Indigiqueer people. This event features writers and creators T’áncháy Redvers and Joshua Whitehead in conversation with host Taya Jardine.Other UBCNon UBCUnreviewedOthe
Hebrew made easy [electronic resource] : or, a brief introduction to the Hebrew grammar, (upon a new and delightful plan); Whereby our British Gentlemen and Ladies may, in so very short a Time as Twenty-Four Days, learn the most necessary and essential Variations of that incomparable Language, without the Help of the Latin, or the Assistance of a Master. The second edition, with additions. By the author of The great importance of the Hebrew language.
No full textThe author of "The great importance of the Hebrew language" = Joshua Kettilby.Kettilby's 'Hebrew made easy' was first published in [1760?] (c.f.t123545). 'The excellency and great importance of the Hebrew language ... by Joshua Kettilby, author of Hebrew made easy' was published in 1762 (c.f.t183663)Electronic reproduction.English Short Title Catalog,Reproduction of original from Bodleian Library (Oxford)
Reply to Joshua Meltzer
No full textA reply to Joshua Meltzer\u27s comment on the author\u27s paper Bridging Fragmentation and Unity: International Law as a Universe of Inter-Connected Island
Key to the genera of the Cerambycidae of western North America
No full textJames R. LaBonte, Joshua B. Dunlap, Daniel R. Clark, Thomas E. Valente, Joshua J. Vlach, Oregon Department of Agriculture.Title from PDF cover (viewed on October 20, 2021).Covers OCLC #1277514227 and OCLC #1226522396.This archived document is maintained by the State Library of Oregon as part of the Oregon Documents Depository Program. It is for informational purposes and may not be suitable for legal purposes.Mode of access: Internet from the Oregon Government Publications Collection.Text in English
- …
