July 2011 - Categories - categories.org.au

Research positions
by Maria Manuel Clementino 26 Feb '14

26 Feb '14

5-YEAR RESEARCH POSITIONS The Centre for Mathematics of the University of Coimbra (CMUC) invites applications for five 5-year research positions in all areas of Mathematics. Applicants should have a PhD in Mathematics and at least three years of post-doctoral experience, with an international-level publication record and demonstrated ability to perform independent research. Preference will be given to candidates working in one of the areas in which the members of CMUC are currently active. A very good command of English is required. The appointments will be made for three years, renewable for two more. Successful applicants are expected to develop research within the areas of interest of CMUC. They should also contribute to graduate studies, supervising students from the Department of Mathematics. The basic salary is equivalent to the index 195 of the Portuguese research career (in the order of 42 500 euros a year), in accordance with the Ciência 2008 guidelines http://alfa.fct.mctes.pt/apoios/contratacaodoutorados/edital2008 Benefits include private health insurance and social security. Applicants should send • cover sheet (available from www.mat.uc.pt/cmuc/coversheet.pdf) including names and contact information of three persons who can provide a letter of recommendation • curriculum vitae (publication list included) • a 5-year research proposal (2 pages max), emphasizing their own research goals as pdf files to cmuc(a)mat.uc.pt. The subject of the e-mail message must include the job reference C2008 FCTUC CMUC v15-v19. The deadline for applications is *September 10, 2008.* ------------------------------ More information can be found at www.mat.uc.pt

1 1

separable locale
by Thomas Streicher 17 May '13

17 May '13

Recently rereading Fourman's "Continuous Truth" I came across the term "separable locale" but could nowhere find an explanation. Does it mean a cHa A for which there exists a countable subset B such that ever a in A is the supremum of those b in B with b leq a. This would be the point free account of "second countable", i.e. having a countable basis. Of course, second countable T_) spaces are separable, i.e. have a countable dense set. Is this reading the "usual" one? Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

5 4

What else do simplicial sets classify?
by Andrej Bauer 05 Oct '11

05 Oct '11

The presheaf category of simplicial sets is the classifying topos for the theory L of a bounded linear order. In general, there could be other theories which are "Morita equivalent" to L in the sense that their classifying toposes are equivalent to simplicial sets. Are any such known, preferably occurring in nature? With kind regards, Andrej [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

8 7

2 postdoc positions (each 1 year) at Oxford
by Bob Coecke 29 Jul '11

29 Jul '11

Two postdoc positions are advertised in the approximately 30 member quantum group, led by Samson Abramsky and Bob Coecke: http://www.cs.ox.ac.uk/activities/quantum/ The group has a has a multidisciplinary research activity including the areas of quantum foundations and quantum computation, category theory, computer science logic and AI including computational linguistics. The applicants are expected to contribute to one of the ongoing research strands within the group. One of the successful candidates is expected to contribute to the development of quantum reasoning software, and its exploitation in quantum foundations and quantum information. Given constraints regarding visas etc., the aimed startdate is October 1st. Further particulars can be found here: http://www.cs.ox.ac.uk/news/378-full.html [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Early registration deadline approaching for FCT 2011 - Fundamentals of Computation Theory in Oslo
by Cristian Prisacariu 27 Jul '11

27 Jul '11

Please excuse if you receive multiple coppies of this anouncement! -------------------------------------------------------------------- Call for Participation FCT 2011 18th International Symposium on Fundamentals of Computer Theory August 22-25, 2011, Oslo, Norway http://fct11.ifi.uio.no/ Established in 1977, the biennial Symposium on Fundamentals of Computation Theory is an international forum for researchers interested in all aspects of theoretical computer science. -------------------------------------------------------------------- REGISTRATION OPEN Early registration deadline: July 31, 2011 A limited amount of student sponsorships are available on application. INVITED SPEAKERS: - Yuri Gurevich (Microsoft Research, Redmond USA) "Impugning Randomness, Convincingly" - Daniel Lokshtanov (University of California, USA) "Kernelization; an Overview" - Jose Meseguer (University of Illinois at Urbana-Champaign, USA) "The Rewriting Logic Semantics Project: A Progress Report" - Andrew P. Black (Portland State University, USA) TBA The accepted papers are listed below. They are arranged in sessions covering ---------------------------------------------- o Complexity theory o Parametrized algorithms o Computation models o Calculi and programs o Graph algorithms o Fundamentals of Computing ---------------------------------------------- For the schedule of the program, see the FCT web-site. 1. A.N. Trahtman. Modifying the upper bound on the length of minimal synchronizing word 2. Annabell Berger and Matthias Mueller-Hannemann. Dag Realizations of Directed Degree Sequences 3. Bart M. P. Jansen and Stefan Kratsch. Data Reduction for Graph Coloring Problems 4. Chia-Jung Lee, Chi-Jen Lu and Shi-Chun Tsai. Computational Randomness from Generalized Hardcore Sets 5. Elliot Fairweather, Maribel Fernandez and Murdoch Gabbay. Principal types for nominal theories 6. Fabien Givors and Gregory Lafitte. Sub-Computabilities 7. Ferdinando Cicalese, Martin Milanic and Ugo Vaccaro. Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs 8. Florian Corzilius and Erika Abraham. Virtual Substitution for SMT Solving 9. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli and Vangelis Paschos. Online maximum k-coverage 10. Gregory Gutin, Mark Jones and Anders Yeo. A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application 11. Guillaume Malod. Succinct algebraic branching programs characterizing non-uniform complexity classes 12. Jacques Bahi, Jean-Francois Couchot, Christophe Guyeux and Adrien Richard. On the Link Between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems 13. Jos Baeten, Bas Luttik and Paul Van Tilburg. Reactive Turing Machines 14. Klaus Meer. Almost transparent short proofs for NP over the reals 15. Krishnendu Chatterjee, Laurent Doyen and Rohit Singh. On Memoryless Quantitative Objectives 16. Ludwig Staiger. Constructive dimension and Hausdorff dimension: the case of exact dimension 17. Mamadou Moustapha Kante, Vincent Limouzy, Arnaud Mary and Lhouari Nourine. Enumeration of Minimal Dominating Sets and Variants 18. Marius Zimand. On the optimal compression of sets in PSPACE 19. Martin Ebbesen, Paul Fischer and Carsten Witt. Edge-matching Problems with Rotations 20. Mila Dalla Preda and Cinzia Di Giusto. Hunting distributed malware with the k-calculus 21. Nathaniel Charlton and Bernhard Reus. Specification patterns and proofs for recursion through the store 22. Paul Hunter. LIFO-search on digraphs: A searching game for cycle-rank 23. Petr Golovach, Daniel Paulusma and Jian Song. Coloring graphs without short cycles and long induced paths 24. Pinar Heggernes, Pim Van 'T Hof, Bart Jansen, Stefan Kratsch and Yngve Villanger. Parameterized Complexity of Vertex Deletion into Perfect Graph Classes 25. Robert Bredereck, Andre Nichterlein, Rolf Niedermeier and Geevarghese Philip. The Effect of Homogeneity on the Complexity of k-Anonymity 26. Sergey Goncharov and Lutz Schroeder. A Coinductive Calculus for Asynchronous Side-effecting Processes 27. Stephen Fenner. Functions that preserve p-randomness 28. Stephane Bessy and Anthony Perez. Polynomial kernels for Proper Interval Completion and related problems EVENTS * FCT is part of the program related to the scientific opening of the new "Ole-Johan Dahl building" of the Department of Informatics. This part takes the morning of Monday 22nd. It will include invited talks and discussion panel on mainly theory and future of programming languages. * The social dinner takes place in the Gamle Logen, the place where the King of Norway hands each year the Abel Prize for life-long achievements in Mathematics. * An excursion is organized in the second afternoon of the conference. [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CSL call for participation
by geoff＠cs.miami.edu 25 Jul '11

25 Jul '11

--------------------------------------------------------------------- CALL FOR PARTICIPATION, EARLY REGISTRATION DEADLINE APPROACHING TYPES 2011, 8-11 September, http://www.types.name/ CSL 2011, 12-15 September, http://www.eacsl.org/csl11 Bergen, Norway GENERAL INFORMATION Types for Proofs and Programs (TYPES) is a forum to present new and on-going work in all aspects of type theory and its applications, especially in computer programming and in formalized and computer-assisted reasoning, see: http://www.types.name/ Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. A preliminary program for CSL'11 is now available: http://www.eacsl.org/csl11/program.pdf The pre-conference workshop Epsilon Calculus and Constructivity on Sunday 11 September is free for TYPES/CSL'11 participants REGISTRATION for TYPES/CSL'11: https://registrer.app.uib.no/csl Early registration deadline: 1 August 2011 BOOKING a hotel room at a reduced rate can be done via: booking(a)ght.no NB limited availability, and the offer expires 1 August 2011, see: http://www.eacsl.org/csl11/#accommodation ---------------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

sets within geometry (nancy, 26-29 july 2011)
by Andre.Rodin＠ens.fr 23 Jul '11

23 Jul '11

For an updated version of the program of this upcoming meeting please check http://www.archmathsci.org/conferences-and-workshops/symposium-sets-within-… best wishes, Andrei [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

bilimit_topos
by Eduardo J. Dubuc 21 Jul '11

21 Jul '11

Dear colleagues, I just put a new paper on the ArXiv, The details of the paper appear below. Best wishes, eduardo Dubuc http://arxiv.org/abs/1107.1685 A construction of 2-cofiltered bilimits of topoi Authors: Eduardo J. Dubuc, Sergio Yuhjtman (Submitted on 8 Jul 2011) Abstract: We show the existence of bilimits of 2-cofiltered diagrams of topoi, generalizing the construction of cofiltered bilimits developed in "SGA 4 Springer LNM 270 (1972)". For any given such diagram, we show that it can be represented by a 2-cofiltered diagram of small sites with finite limits, and we construct a small site for the inverse limit topos. This is done by taking the 2-filtered bicolimit of the underlying categories and inverse image functors. We use the construction of this bicolimit developed in "A construction of 2-filtered bicolimits of categories, Cah. Top. et Geo. Diff. Vol. XLVII-2 (2006)", where it is proved that if the categories in the diagram have finite limits and the transition functors are exact, then the bicolimit category has finite limits and the pseudocone functors are exact. An application of our result here is the fact that every Galois topos has points "2-Filteredness and the point of every Galois topos, Proc. CT2007, App. Cat. St., Vol. 18, 2, (2010)". Comments: 7 pages Subjects: Category Theory (math.CT) Cite as: arXiv:1107.1685v1 [math.CT] [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Paper on "Partially traced categories"
by selinger＠mathstat.dal.ca 21 Jul '11

21 Jul '11

Dear colleagues, we just put a new paper on the ArXiv about partially traced categories. They are almost the same thing as traced monoidal categories (a la Joyal, Street, and Verity 1996), except that the trace is a partially defined operation, subject to some axioms. The main result is a representation theorem: every partially traced category can be faithfully embedded in a totally traced category (and conversely, every symmetric monoidal subcategory of a totally traced category is partially traced; thus this representation theorem completely characterizes partially traced categories). Interestingly, there are some naturally occuring examples of partially traced categories (such as on the category of vector spaces with direct sum as the monoidal structure) that do not appear to be embedded in any *naturally occuring* totally traced category (i.e., other than the one constructed by the completeness theorem). The details of the paper appear below. Best wishes, -- Octavio, Phil, and Peter ---------------------------------------------------------------------- Partially traced categories Octavio Malherbe, Philip J. Scott, Peter Selinger http://arxiv.org/abs/1107.3608 Abstract: This paper deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every symmetric monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int-construction. ---------------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

2 1

Re: Good article for promoting pure math research
by André Joyal 20 Jul '11

20 Jul '11

Dear All, An article on THE UNPLANNED IMPACTS OF MATHEMATICS was recently published in Nature: http://www.nature.com/nature/journal/v475/n7355/full/475166a.html andré [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

9 8