July 2020 - Categories - categories.org.au

Re: "First" use of 'Category theory' to describe our field
by David Roberts 23 Feb '24

23 Feb '24

Dear Ross, no, that's pretty good! It's mildly surprising that it took ~20 years for the name to 'stick', but maybe less so given that the field grew slowly to start. Thanks, David David Roberts Webpage: https://ncatlab.org/nlab/show/David+Roberts Blog: https://thehighergeometer.wordpress.com On Thu, 11 Jul 2019 at 08:21, Ross Street <ross.street(a)mq.edu.au> wrote: > > Dear David > > From memory, the Pure Mathematics Honours (USyd) course that Max Kelly taught in 1965 > was called ``Category Theory''. It concentrated on different kinds of morphisms > and factorizations in a category, and finished with adjoint functors. > Also John Gray's (UIllinois) 1968-69 graduate course had that name. > > From Eilenberg I heard that each person using categories should have their own category of expertise. > I told this to John Gray who said that was fine; the time had come for that category to be Cat. > > I would suggest that the first category theorists to think of themselves as such were Eilenberg's students at Columbia. > However, Mac Lane was definitely a category theorist. > > This is probably not the verifiable stuff you were seeking. > > Ross > > > On 10 Jul 2019, at 10:01 PM, David Roberts <droberts.65537(a)gmail.com> wrote: > > Hi all, > > the (idle) question is: when did the phrase 'category theory' catch on > for the field? Clearly it didn't leap from either of the heads of > Eilenberg or Mac Lane full-grown, since they used the phrase 'General > theory of natural equivalences'. There are the old 'Reports of the > Midwest Category Seminar' lecture notes (the first in 1967), which > hints that 'category theory' wasn't quite the name in use. > > Even more interesting: who was the first "category theorist", by that name? > > Answers referring to verifiable sources would be best. > > Thoughts? > > David > > > > David Roberts > Webpage: https://ncatlab.org/nlab/show/David+Roberts > Blog: https://thehighergeometer.wordpress.com > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

3 4

Volume LXI-3 of the "Cahiers"
by Andrée Ehresmann 31 Jul '20

31 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear colleagues, We are pleased to inform you that Volume LXI-3 (3rd quarter 2020) of the Cahiers is now freely downloadable from the?? website of the Cahiers, http://cahierstgdc.com, both as a whole issue and as separate articles. Hoping you are spending good vacations Best regards, Andree Ehresmann, Marino Gran and Rene Guitart [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Junior Researcher Positions
by Maria Manuel Clementino 31 Jul '20

31 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. CALL - 3 JUNIOR RESEARCHER POSITIONS: An international tender to fulfill 3 vacancies for the position of Junior Researcher in the field of Mathematics, is open for 10 working days following the publication of the present notice in Di??rio da Rep??blica [Official Journal of the Portuguese Republic, 30/07/2020]. The stated position will be held under a public service employment contract of specified duration at University of Coimbra, Faculty of Sciences and Technology, UNIT 324 - Centro de Matem??tica da UC (CMUC), under the Project UIDP/00324/2020. Public tender reference: IT057-20-10081 Place of Work: University of Coimbra, Faculdade de Ci??ncias e Tecnologia, UNIDADE 324 - Centro de Matem??tica da UC Job description: The Junior Researchers will contribute for the development of CMUC project during the period 2020-2023, in particular of the CMUC research group in which they will be integrated. The tasks involved include: (a) Participation in the activities of CMUC with their specialized expertise; (b) Develop research tasks integrated in one of the research groups of CMUC (Algebra and Combinatorics; Algebra, Logic and Topology; Analysis; Geometry; Numerical Analysis and Optimization; Probability and Statistics); (c) Production and edition of scientific papers and progress reports of their research work; (d) Supervision of PhD students in topics covered by CMUC project; (e) Participation in the outreach activities of CMUC. Contract length: three-year contract. For more information see the official announcement at http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=125891 Deadline for applications: 13 August 2020. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

2nd CfP : International Workshop on Quantum Compilation : 23-24 Sept 2020
by Ross Duncan 28 Jul '20

28 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. Note to moderator : due the use of various categorical methods in quantum software we believe this notice is relevant to the list. --- IWQC 2020 Call for contributions --- 4rd International Workshop on Quantum Compilation. https://quantumweek2020.cambridgequantum.com/iwqc20.html We invite contributions to the 4th International Workshop on Quantum Compilation. The workshop aims to bring together researchers from quantum computing, electronic design automation, and compiler construction. Open questions that we anticipate this group to tackle include new methods for circuit synthesis and optimization, optimizations and rewriting, techniques for verifying the correctness of quantum programs, and new techniques for compiling efficient circuits and protocols regarding fault-tolerant and architecture constraints.The scope of the workshop includes, but is not limited to, current hot topics in quantum circuit design such as : * space-optimizing compilers for reversible circuits * design-space exploration for automatic code generation from classical HDL specification * quantum programming languages and type systems * reversible logic synthesis * technology-aware mapping * error correction * optimized libraries (e.g., for arithmetic and Hamiltonian simulation) * benchmarking of circuits for small and medium scale quantum computers * quantum and reversible circuit peep-holing and (re)synthesis * software and tools for all above mentioned topics * quantum outreach: coding contests, tutorials, education Due to the ongoing COVID-19 epidemic the workshop will happen as an online virtual event. We will investigate the possibility of an in-person meeting if the situation improves, but the full participation in the workshop will be possible remotely. Best Student Paper Prize! The PC will award a GBP 500 prize for the best paper whose authors are all students at the time of submission. The prize will be shared equally between the authors. Invited Speakers : * Eleanor Rieffel, Quantum Artificial Intelligence Laboratory (QuAIL) NASA Ames Research Center * Margaret Martonosi, Quantum computer architecture and programming languages research group (QArch), Princeton University * Earl T. Campbell, University of Sheffield and AWS Center for Quantum Computing. Important dates: * 14 August 2020: Submission of abstracts * 31 August 2020: Notification of decisions * 23 and 24 September 2020 : Workshop Note that IWQC20 forms part of a week long sequence of workshops on quantum computing; see https://quantumweek2020.cambridgequantum.com/ Instructions for authors : The main purpose of the workshop is to exchange recent ideas and research in the area of quantum compilation. The workshop has no formal proceedings. Authors are invited to submit an abstract or a paper, with no restrictions on the format. Submission of tool and case-study papers are highly encouraged. In case of a positive evaluation, submissions are accepted either as oral or poster presentation to be part of the workshop program. All abstracts and papers are distributed only among the participants. Please submit your papers through EasyChair: https://easychair.org/conferences/?conf=iwqc20 Programme Committee : Ross Duncan, Cambridge Quantum Computing and University of Strathclyde, ross.duncan(a)cambridgequantum.com Thomas Häner, Microsoft, thomas.haner(a)microsoft.com Aleks Kissinger, University of Oxford, Aleks.kissinger(a)cs.ox.ac.uk Neil J. Ross, Dalhousie University, neil.jr.ross(a)gmail.com Mathias Soeken, Microsoft and EPFL, mathias.soeken(a)epfl.ch [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Object of connected components for internal categories
by David Roberts 27 Jul '20

27 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. Dear all, I was wondering if there is any place in the literature that people consider a hypothesis on a category E of the following form: (*) For an internal category C in E, there is an object of connected components pi_0(C). This is equivalent to saying that s,t: Mor(C) ==> Obj(C) has a coequaliser for any C. One setup I know that is *sufficient* is if C is a sigma-pretopos (in the language of the Elephant) aka an aleph_1-ary pretopos (in the language of Shulman's exact completions article). This is a pretopos that additionally has countable disjoint sums (rather than just finite). This is sufficient because then we can take the underlying internal graph of C, then form the corresponding relation, freely form the associated symmetric, reflexive relation (this part so far only requires the finitary structure) and then form the transitive closure (this requires the countable sums). However, given an internal category C I already have a transitive (and reflexive) relation, namely the preorder reflection of C (which only requires finitary operations). So while I don't necessarily expect any other construction that doesn't require the countable sums, I was wondering if people had considered this condition (*) directly and in isolation. My best guess is it would be in some cohesion-type setup, but I'm not interested in the rest of the cohesion axioms at this time. Many thanks, David David Roberts Webpage: https://ncatlab.org/nlab/show/David+Roberts Blog: https://thehighergeometer.wordpress.com [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1

Call for online participation: Workshop on Semantic Spaces at the Intersection of NLP, Physics, and Cognitive Sciences
by Martha Lewis 24 Jul '20

24 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. [with apologies for cross-posting] CALL FOR ONLINE PARTICIPATION Workshop on Semantic Spaces at the Intersection of NLP, Physics, and Cognitive Sciences https://sites.google.com/view/semspace2020/home <https://sites.google.com/view/semspace2020/home> August 6th and 7th 2020 online **** Registration is now open for SemSpace2020 at https://sites.google.com/view/semspace2020/registration <https://sites.google.com/view/semspace2020/registration>. Registration is free, but please do register for planning purposes. AIMS AND SCOPE Vector embeddings of word meanings have become a mainstream tool in large scale natural language processing tools. The use of vectors to represent meanings in semantic spaces or feature spaces is also employed in cognitive science. Unrelated to natural language and cognitive science, vectors and vector spaces have been extensively used as models of physical theories and especially the theory of quantum mechanics. Crucial similarities between the vector representations of quantum mechanics and those of natural language are exhibited via bicompact linear logic and compact closed categorical structures in natural language. Exploiting the common ground provided by vector spaces, the proposed workshop will bring together researchers working at the intersection of NLP, cognitive science, and physics, offering to them an appropriate forum for presenting their uniquely motivated work and ideas. The interplay between these three disciplines will foster theoretically motivated approaches to understanding how meanings of words interact with each other in sentences and discourse via grammatical types, how they are determined by input from the world, and how word and sentence meanings interact logically. Topics of interest include (but are not restricted to): Reasoning in semantic spaces Compositionality in semantic spaces and conceptual spaces Conceptual spaces in linguistics and natural language processing Applications of quantum logic in natural language processing and cognitive science Modelling functional words such as prepositions and relative pronouns in compositional distributional models of meaning Diagrammatic reasoning for natural language processing and cognitive science Modelling so-called ‘non-compositional’ phenomena such as metaphor INVITED SPEAKERS Jennifer Culbertson, University of Edinburgh Andrea E. Martin, Max Planck Institute for Psycholinguistics and Radboud University, Nijmegen LIST OF ACCEPTED TALKS (in no particular order) (see also https://sites.google.com/view/semspace2020/programme <https://sites.google.com/view/semspace2020/programme>) Russell Richie and Sudeep Bhatia: Similarity judgment within and across categories: A comprehensive model comparison James Hefford, Vincent Wang and Matthew Wilson: Categories of Semantic Concepts Sean Tull and Johannes Kleiner: Integrated Information in Process Theories Sonia Cenceschi, Licia Sbattella and Roberto Tedesco: CALLIOPE: a multi-dimensional model for the prosodic characterisation of Information Units Tiffany Duneau: Solving logical puzzles in DisCoCirc Konstantinos Meichanetzidis, Stefano Gogioso, Giovanni De Felice, Alexis Toumi, Nicolo Chiappori and Bob Coecke: Quantum Natural Language Processing on Near-Term Quantum Computers Sergey Slavnov: Cobordisms and commutative categorial grammars Sean Tull: Monoidal Categories for Formal Concept Analysis Lachlan McPheat, Mehrnoosh Sadrzadeh, Adriana Correia and Alexis Toumi: Derivations and Vector Semantics of Anaphora with Ellipsis in Lambek Calculus with a Relevant Modality Sanjaye Ramgoolam, Mehrnoosh Sadrzadeh and Lewis Sword: Gaussianity and typicality in matrix distributional semantics Gemma De Las Cuevas, Andreas Klinger, Martha Lewis and Tim Netzer: Cats climb entails mammals move: preserving hyponymy in compositional distributional semantics Whitney Tabor: On the relationship between syntactic and semantic encoding in vector space language models Please send any queries to semspace2020(a)easychair.org <mailto:semspace2020@easychair.org> PROGRAMME COMMITTEE Bob Coecke, University of Oxford Stefano Gogioso, University of Oxford Giuseppe Greco, Utrecht University Peter Gärdenfors, Lund University Helle Hvid Hansen, Delft University of Technology Jules Hedges, Max Planck Institute for Mathematics in the Sciences Peter Hines, University of York Alexander Kurz, Chapman University Antonio Lieto, University of Turin, Department of Computer Science Dan Marsden, University of Oxford Michael Moortgat, Utrecht University Richard Moot, CNRS (LIRMM) & University of Montpellier Dusko Pavlovic, University of Hawaii Emmanuel Pothos, City University London Matthew Purver, Queen Mary University of London Mehrnoosh Sadrzadeh, University College London Giovanni Sileno, University of Amsterdam Pawel Sobocinski, Tallinn University of Technology Oriol Valentín, Universitat Politècnica de Catalunya Dominic Widdows, Grab Geraint Wiggins, Vrije Universiteit Brussel / Queen Mary University of London Gijs Wijnholds, Utrecht University Frank Zenker, Lund University ORGANIZATION COMMITTEE Martha Lewis, ILLC, University of Amsterdam Michael Moortgat, Utrecht University [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

ETAPS 2021 1st joint call for papers
by Tarmo Uustalu 23 Jul '20

23 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. ****************************************************************** JOINT CALL FOR PAPERS 24th European Joint Conferences on Theory and Practice of Software ETAPS 2021 Luxembourg, Luxembourg, 27 March-1 April 2021 http://www.etaps.org/2021 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences, accompanied by satellite workshops. ETAPS 2021 is the twenty-fourth event in the series. -- MAIN CONFERENCES (29 March-1 April) -- * ESOP: European Symposium on Programming (PC chair: Nobuko Yoshida, Imperial College London, UK) * FASE: Fundamental Approaches to Software Engineering (PC chairs: Esther Guerra, Univ. Autónoma de Madrid, Spain, and Mariëlle Stoelinga, Univ. Twente, The Netherlands) * FoSSaCS: Foundations of Software Science and Computation Structures (PC chairs: Stefan Kiefer, Univ. of Oxford, UK, and Christine Tasson, IRIF, Univ. Paris Diderot, France) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs: Jan Friso Groote, Techn. Univ. Eindhoven, The Netherlands, and Kim G. Larsen, Aalborg Univ., Denmark) TACAS '21 will host the 10th Competition on Software Verification (SV-COMP). -- IMPORTANT DATES * Papers due: 15 October 2020 23:59 AoE (=GMT-12) * Rebuttal (ESOP, FoSSaCS and, for selected papers, TACAS): 7 December 00:01 AoE - 9 December 23:59 AoE * Notification: 23 December 2020 * Camera-ready versions due: 22 January 2021 -- SUBMISSION INSTRUCTIONS -- The four main conferences of ETAPS 2021 solicit contributions of the following types. All page limits are given **excluding bibliography**. * ESOP: regular research papers of max 25 pp * FASE: regular research papers and empirical evaluation papers of max 18 pp, tool demonstration papers of max 6 pp + mandatory appendix of max 6 pp, * FoSSaCS: regular research papers of max 18 pp * TACAS: regular research papers, case study papers and regular tool papers of max 16 pp, tool demonstration papers of max 6 pp For definitions of the different paper types and specific instructions, where they are present, see the webpages of the individual conferences. All accepted papers will appear in the conference proceedings and have presentations during the conference. A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. Submissions must follow the formatting guidelines of Springer's LNCS and be submitted electronically in pdf through the Easychair author interface of the respective conference. Submissions not adhering to the specified format and length may be rejected immediately. FASE will use double-blind reviewing. Authors are asked to omit their names and institutions; refer to own prior work in the third person; not to include acknowledgements that might identify them. Regular tool paper and tool demonstration paper submissions to TACAS must be accompanied by an artifact. The artifact will be evaluated and the outcome will be taken into account in the acceptance decision of the paper. ESOP and FoSSaCS will use an author rebuttal phase. TACAS will have rebuttal for selected papers. -- PUBLICATION The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's LNCS series. The proceedings volumes will appear in gold open access, so the published versions of all papers will be available for everyone to download from the publisher's website freely, from the date of online publication, perpetually. The copyright of the papers will remain with the authors. -- SATELLITE EVENTS (27-28 March) -- A number of satellite workshops will take place before the main conferences. -- CITY AND HOST INSTITUTION -- Luxembourg is the capital of the small European nation of the same name. Built amid deep gorges cut by the Alzette and Pétrusse rivers, it is famed for its ruins of medieval fortifications. The vast Bock Casemates tunnel network encompasses a dungeon, prison and the Archaeological Crypt, considered the city's birthplace. Along ramparts above, the Chemin de la Corniche promenade offers dramatic viewpoints. ETAPS 2021 is organised by the Interdisciplinary Centre for Security, Reliability and Trust (SnT), Université du Luxembourg. -- ORGANIZERS -- General chair: Peter Y. A. Ryan (SnT & Université du Luxembourg) Workshops chair: Joaquin Garcia-Alfaro (Telecom SudParis, France) Organization chair: Peter Roenne (SnT Luxembourg) Event manager: Magali Martin (SnT Luxembourg) -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at etaps2021 at uni.lu . [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: Deck project
by Maurice Meagher 23 Jul '20

23 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. Sara, The date to review options will be around Aug 12th. Someone from our office will touch base to schedule a meeting, thanks. On Wed, Jul 22, 2020 at 10:32 AM Sara Faridi <Sara.Faridi(a)dal.ca<mailto:Sara.Faridi@dal.ca>> wrote: Hi Maurice, thanks for the update. Do you know a timeline for this? We spoke about two to three weeks when you were here, so I was hoping for an update. Many thanks, Sara ________________________________________ From: Maurice Meagher <mmeagher(a)archadeck.net<mailto:mmeagher@archadeck.net>> Sent: Wednesday, July 22, 2020 10:30 AM To: Sara Faridi Cc: Peter Selinger Subject: Re: Deck project CAUTION: The Sender of this email is not from within Dalhousie. Sara, I will get an answer from our team when the drawings, and details will be ready for review. Thanks Maurice Meagher B.I.S, CAPS Renovator of the Year 2020 Archadeck of Nova Scotia (BBB rating of A+) Phone: (902) 444-DECK (3325) Case Design/Remodeling (BBB rating of A+) Phone: (902) 454-CASE (2273) On Jul 22, 2020, at 9:26 AM, Sara Faridi <faridi(a)mathstat.dal.ca<mailto:faridi@mathstat.dal.ca>> wrote: Hi Maurice, I hope you are well. I was wondering if you have the designs for our deck ready? And also the installation date? Thanks, Sara On Wed, 24 Jun 2020, Maurice Meagher wrote: CAUTION: The Sender of this email is not from within Dalhousie. Sara, Peter, Answers are below your questions. Thanks Maurice Meagher B.I.S, CAPS Renovator of the Year 2020 Archadeck of Nova Scotia (BBB rating of A+) Phone: (902) 444-DECK (3325) Case Design/Remodeling (BBB rating of A+) Phone: (902) 454-CASE (2273) On Jun 24, 2020, at 8:09 AM, Sara Faridi <faridi(a)mathstat.dal.ca<mailto:faridi@mathstat.dal.ca>> wrote: Hi Maurice, thanks again for visiting us yesterday. Peter and I would like to go ahead and see some drawings for the project. A couple of questions: 1) do we do a e-transfer to you directly for the retainer? To this email address? Yes 2) Could you confirm the ballpark amounts you gave us yesterday (if I remember correctly): Upper 30's deck with stairs (2 options for stairs with 2 or 3 landings) Yes +/- 15K no stairs (same as the 2018 plan you sent us adjusted for 2020 cost of labor) Yes +/-4K for pavers $5,500 to $6,400 plus hst depending on selection. Best wishes, Sara -- Maurice Meagher B.I.S, CAPS Renovator of the Year 2020 Archadeck of Nova Scotia Phone: (902) 444-DECK (3325) Case Design/Remodeling Phone: (902) 454-CASE (2273)

1 0

Re: locales such that the associated topos is subdiscrete?
by Thomas Streicher 22 Jul '20

22 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. As I was just told by Matias Menni an answer to my question is also provided in Prop.6.3.5 of Pieter Hofstra's Thesis. Maybe I should explain a bit why I asked this question. In arxiv:2005.06019 Jonas Frey and I have characterized triposes over a base topos SS as regular functors F from SS to a topos EE such that 1. every object of EE appears as subquotient of some FI 2. F^*Sub_EE admits a generic family. What we had to leave as an open question whether triposes over SS = Set inducing the same topos are equivalent. In Hyland, Johnstone and Pitts's paper introcing triposes this question was aked for localic toposes and remained unanswered since the last 40 years. Krivine's work on classical realizability has come up with an alternative characterization of boolean triposes over Set and he has shown that F : Set->EE is the inverse image part of a localic g.m. iff F preserves 2. But it is still open whether (boolean) triposes F : Set->EE with EE loclic are nevessarily isomorphic to Delta : Set -> EE. BTW if one drops condition 2 there is a simple answer. For natural numbers n > 0 the functors F_n : Set->Set sending X to X^n are all triposes in this weaker sense and pairwise not isomorphic. As explained in my Paper with Jonas these generalized triposes are precisely those introduced by Andy Pitts in his 1999 paper "Tripos Theory in Retrospect". In many respects this weaker notion is more natural. The only disadvantage is that less is expressible in the internal language of the base topos SS. Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 2

PhD position(s) in Structural and Algorithmic Aspects of Preference-based Problems in Social Choice - Vienna, Austria - Deadline: July 31, 2020
by Mihaela Rozman 22 Jul '20

22 Jul '20

CAUTION: The Sender of this email is not from within Dalhousie. [Note from moderator: Sorry, this was previously sent with incorrect header information] PhD POSITION(S) PROJECT Structural and Algorithmic Aspects of Preference-based Problems in Social Choice STARTING DATE: Negotiable LOCATION: Vienna, Austria INSTITUTION: Algorithms and complexity group at the Faculty of Informatics, Technische Universität Wien (Vienna University of Technology) FUNDING: The PhD candidates receive an employment contract for the initial period of 3 years, thus study fees do not apply. Salary range starts at 22.000 net/year EUR for 30h/week. APPLICATION DEADLINE: July 31, 2020 ========================================================== We invite applications for PhD position(s) (3 years with the possibility of extension), working with Jiehua Chen in the Algorithms and Complexity Group at the Vienna University of Technology (Technische Universität Wien – TU Wien), Vienna, Austria. The PhD position(s) is available for the WWTF research project (Vienna Science and Technology Fund) titled Structural and Algorithmic Aspects of Preference-based Problems in Social Choice: https://www.wwtf.at/programmes/vienna_research_groups/VRG18-012/index.php?l… The research topics include voting, structured preferences, stable matching (matchings under preferences) with a focus on parameterized and approximation algorithm design. =============================== YOUR PROFILE =============================== Applicants with a solid background in areas such as algorithm design (including BUT NOT LIMITED to parameterized algorithms and approximation algorithms), computational complexity, and/or discrete mathematics are welcome to apply. =============================== WE OFFER =============================== -The PhD position(s) entails an employment contract. -The position(s) is available immediately and the starting date is quite flexible - A research and study environment that is friendly and gender-balanced - TU Wien is a great place for professional growth (e.g., the Austrian Science Fund and other funding agencies offer multiple funding opportunities for young researchers to advance their independent scientific careers) - Vienna, the city, features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields - Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide. =============================== APPLICATION =============================== Please send your application, including - your academic CV, - a motivation letter, including an explanation of your research interests, - your Master's thesis and - a list of subjects studied, giving sufficient details and grades/marks obtained directly to Jiehua Chen: jiehua.chen(a)tuwien.ac.at <mailto:jiehua.chen@tuwien.ac.at> (If possible all in a single PDF file) DEADLINE: 31. July 2020 For informal inquiries you can also contact via the above email address. =============================== ADDITIONAL INFORMATION =============================== Faculty of Informatics: https://informatics.tuwien.ac.at/ Research group website: https://www.ac.tuwien.ac.at/ Outreach: www.vcla.at <http://www.vcla.at> Twitter: @vclaTUwien ------=extPart_000_017A_01D6601C.7ABA2A60 Content-Type: text/html; charset=tf-8" Content-Transfer-Encoding: quoted-printable <html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=utf-8"><meta name=Generator content="Microsoft Word 15 (filtered medium)"><style></style></head><body link="#0563C1" vlink="#954F72"><div class=WordSection1>PhD POSITION(S) <o:p></o:p>PROJECT Structural and Algorithmic Aspects of Preference-based Problems in Social Choice<o:p></o:p>STARTING DATE: Negotiable<o:p></o:p>LOCATION: Vienna, Austria<o:p></o:p>INSTITUTION: Algorithms and complexity group at the Faculty of Informatics, Technische Universität Wien (Vienna University of Technology)<o:p></o:p>FUNDING: The PhD candidates receive an employment contract for the initial period of 3 years, thus study fees do not apply. Salary range starts at 22.000 net/year EUR for 30h/week. <o:p></o:p>APPLICATION DEADLINE: July 31, 2020<o:p></o:p>==========================================================<o:p></o:p>We invite applications for PhD position(s) (3 years with the possibility of extension), working with Jiehua Chen in the Algorithms and Complexity Group at the Vienna University of Technology (Technische Universität Wien – TU Wien), Vienna, Austria. <o:p></o:p><o:p> </o:p>The PhD position(s) is available for the WWTF research project (Vienna Science and Technology Fund) titled Structural and Algorithmic Aspects of Preference-based Problems in Social Choice: <a href="https://www.wwtf.at/programmes/vienna_research_groups/VRG18-012/index.php?l…">https://www.wwtf.at/programmes/vienna_research_groups/VRG18-012/index.php?l…</a><o:p></o:p><o:p> </o:p>The research topics include voting, structured preferences, stable matching (matchings under preferences) with a focus on parameterized and approximation algorithm design.<o:p></o:p><o:p> </o:p><o:p> </o:p>===============================<o:p></o:p>YOUR PROFILE<o:p></o:p>===============================<o:p></o:p><o:p> </o:p>Applicants with a solid background in areas such as algorithm design (including BUT NOT LIMITED to parameterized algorithms and approximation algorithms), computational complexity, and/or discrete mathematics are welcome to apply.<o:p></o:p><o:p> </o:p>===============================<o:p></o:p>WE OFFER<o:p></o:p>===============================<o:p></o:p><o:p> </o:p>-The PhD position(s) entails an employment contract. <o:p></o:p>-The position(s) is available immediately and the starting date is quite flexible<o:p></o:p>- A research and study environment that is friendly and gender-balanced <o:p></o:p>- TU Wien is a great place for professional growth (e.g., the Austrian Science Fund and other funding agencies offer multiple funding opportunities for young researchers to advance their independent scientific careers) <o:p></o:p>- Vienna, the city, features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields<o:p></o:p>- Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide.<o:p></o:p><o:p> </o:p>===============================<o:p></o:p>APPLICATION <o:p></o:p>===============================<o:p></o:p><o:p> </o:p>Please send your application, including<o:p></o:p>- your academic CV,<o:p></o:p>- a motivation letter, including an explanation of your research interests,<o:p></o:p>- your Master's thesis and<o:p></o:p>- a list of subjects studied, giving sufficient details and grades/marks obtained<o:p></o:p><o:p> </o:p>directly to Jiehua Chen: <a href="mailto:jiehua.chen@tuwien.ac.at">jiehua.chen(a)tuwien.ac.at</a><o:p></o:p>(If possible all in a single PDF file)<o:p></o:p><o:p> </o:p>DEADLINE: 31. July 2020 <o:p></o:p><o:p> </o:p>For informal inquiries you can also contact via the above email address.<o:p></o:p><o:p> </o:p>===============================<o:p></o:p>ADDITIONAL INFORMATION<o:p></o:p>===============================<o:p></o:p>Faculty of Informatics: <a href="https://informatics.tuwien.ac.at/">https://informatics.tuwien.ac.at/</a> <o:p></o:p>Research group website: <a href="https://www.ac.tuwien.ac.at/">https://www.ac.tuwien.ac.at/</a> <o:p></o:p>Outreach: <a href="http://www.vcla.at">www.vcla.at</a> <o:p></o:p>Twitter: @vclaTUwien  <o:p></o:p><o:p> </o:p><o:p> </o:p></div></body></html> ------=extPart_000_017A_01D6601C.7ABA2A60-- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0