Sunday, August 16. Monday, August 17 - Morning. 14:00 21:00 Registration (Room 16) 8:30 9:30 Registration (Room 16)
|
|
|
- Melissa Montgomery
- 5 years ago
- Views:
Transcription
1 Sunday, August 16 14:00 21:00 Registration (Room 16) Monday, August 17 - Morning 8:30 9:30 Registration (Room 16) 9:30 9:40 Opening ceremony SESSION 1 (Chair: P.Marković) 9:40 10:30 Ralph N. McKenzie: A survey of recent work in algebra applied to the study of constraint satisfaction problems 10:40 11:10 COFFEE BREAK 11:10 12:00 Jaroslav Nešetřil: Restricted dualities
2 Monday, August 17 - Afternoon 14:30 15:20 15:30 15:50 15:55 16:15 SESSION 2A (Chair: K.A.Kearnes) Friedrich Wehrung: From lifting objects to lifting diagrams: Recent progress on larders and CLL Andrei Bulatov: CSPs of bounded width and checking for type 2 Ross Willard: pp-definability is NEXPTIME-complete 16:20 16:50 COFFEE BREAK 16:50 17:10 17:15 17:35 17:40 18:00 SESSION 2B (Chair: M.Goldstern) Andreja Tepavčević: Poset valued ideals and filters Branimir Šešelja: Weak congruence lattice representation problem SESSION 3A (Chair: M.Maróti) SESSION 3B (Chair: M.V.Volkov) SESSION 3C (Chair: B.Šešelja) Petar Marković: Some new tractable cases of the CSP Matthew Nickodemus: CSPs over small templates Erhard Aichinger: Commutator-equivalent algebras Peter G. Trotter: A structure and cardinality preserving embedding of semigroups into regular semigroups Mária B. Szendrei: E-solid locally inverse semigroups Arye Juhász: Solution of the word problem in certain inverse monoids Branka Budimirović: Lattice valued c-subgroups João Pita Costa: On parallelogram laws for skew lattices 18:05 18:25 18:30 18:50 Jiři Tůma: Intervals in subgroup lattices of locally finite groups Vladimir Božin: Structure of finite lattices and Frankl's Conjecture counterexample Akihiro Yamamura: Word problem of amalgamated free products of commutative inverse semigroups Eugenia A. Kochubinska: Non-isomorphic R(L)-cross-sections of the partial wreath product of finite symmetric inverse semigroups
3 Tuesday, August 18 - Morning 9:00 9:50 10:00 10:50 SESSION 4 (Chair: I.Dolinka) Keith A. Kearnes: Free spectra of intermediate growth Mikhail V. Volkov: The finite basis problem for Kauffman monoids 11:00 11:30 COFFEE BREAK 11:30 12:20 Mark V. Sapir: Algorithmic, asymptotic and geometric properties of groups Tuesday, August 18 - Afternoon 14:30 15:20 15:30 15:50 SESSION 5A (Chair: M.Valeriote) Marcin Kozik: Absorbing subuniverses Alexandr Kazda: Möbius number systems SESSION 5B (Chair: V.Dalmau) Miroslav Ploščica: On congruence lattices of some lattices 15:55 16:15 Ágnes Szendrei: Clones near the top of the clone lattice Tim Boykett: Polynomials over lattices 18:30 Departure of the buses to the conference dinner (parking lot of the Faculty of Science, Department of Biology) 19:00 Conference dinner at the Salaš 137 ethno-restaurant, with musical accompaniment by the Ravnica quintet
4 Wednesday, August 19 - Morning 9:00 9:50 10:00 10:50 SESSION 6 (Chair: Á.Szendrei) Martin Goldstern: Global clones from local clones Alexander Yu. Olshanskii: Actions of maximal growth 11:00 11:30 COFFEE BREAK 11:30 12:20 Marcel G. Jackson: A remarkable technique in finite semigroups, and its application to the algebra of relations
5 Wednesday, August 19 - Afternoon 15:00 15:20 15:25 15:45 15:50 16:10 SESSION 7A (Chair: R.N.McKenzie) SESSION 7B (Chair: F.Wehrung) SESSION 7C (Chair: N.R.Reilly) Michał Stronkowski: Abelianess implies quasi-affiness revisited Catarina A. Carvalho: Complexity of list homomorphism problems for reflexive digraphs Jakub Bulín: CSP dichotomy for special polyads Pierre Gillibert: An infinite combinatorial statement with a poset parameter Gábor Czédli: Modular fractal lattices and von Neumann frames Benedek Skublics: Matrices in modular lattices Napaporn Sarasit: Semigroups of tree languages Somnuek Worawiset: Regular endomorphisms of some strong semilattices of semigroups Irena Stojmenovska: Reductions for presentations of (n,m)-semigroups induced by reductions for presentations of binary semigroups 16:15 16:35 Dejan Delić: Oriented trees of bounded width Eszter K. Horváth: Islands 16:40 17:10 COFFEE BREAK 17:10 17:30 17:35 17:55 18:00 18:20 SESSION 8A (Chair: M.G.Jackson) Erkko Lehtonen: Clones of Boolean clique functions and hypergraph homomorphisms Sebastian Kerkhoff: On the generation of clones containing nearunanimity operations Reinhard Pöschel: Compatible quasiorders of (monounary acyclic) algebras SESSION 8B (Chair: S.Crvenković) Grzegorz Bińczak: Abelian groups with involution I Joanna Kaleta: Abelian groups with involution II Tiwadee Musunthia: Classification of varieties by lattices Žarko Popović: A note on Lallement's lemma
6 Thursday, August 20 - Morning 9:00 9:50 SESSION 9 (Chair: G.Czédli) Norman R. Reilly: A graphical approach to free objects in Rees- Sushkevich varieties 10:00 10:50 Matthew Valeriote: On the complexity of equivalence and isomorphism of primitive positive formulas 11:00 11:30 COFFEE BREAK 11:30 12:20 Libor Barto: Prague strategies
7 Thursday, August 20 - Afternoon 15:00 15:20 15:25 15:45 SESSION 10A (Chair: M.V.Sapir) Igor Dolinka: (I)NFB results for finite unary semigroups Alexander L. Popovich: On the representation of lattices by congruence lattices of semigroups SESSION 10B (Chair: D.Mašulović) Aleksandar Krapež: Quasigroup functional equations and graphs Vladimir Baltić: Various methods for counting the number of restricted permutations SESSION 10C (Chair: R.Pöschel) Jovanka Pantović: On maximal hyperclones on a finite set 15:50 16:10 Jörg Koppitz: The structure of the ideals of O n Milan Bašić: Recent results and applications of integral circulant graphs Hajime Machida: Some endoprimal monoids on a threeelement set 16:15 16:35 Michael Pinsker: Structure in mappings on the random graph Vladimir Kuchmei: Compatible functions on semilattices 16:40 17:10 COFFEE BREAK 17:10 17:30 17:35 17:55 18:00 18:20 18:25 18:45 SESSION 11A (Chair: J.Nešetřil) SESSION 11B (Chair: O.B.Sapir) SESSION 11C (Chair: M.Kozik) Dragan Mašulović: Endomorphism monoids of countable homomorphism-homogeneous relational systems Rajko Nenadov: On finite homomorphism-homogeneous binary relational systems Maja Pech: Endolocality and homomorphismhomogeneous relational structures I Christian Pech: Endolocality and homomorphismhomogeneous relational structures II (an exploration) Aleksandar Stamenković: Fuzzy automata: State reduction methods Nada Damljanović: Fuzzy and weighted automata: Bisimulation and structural equivalence Zorana Jančić: Fuzzy and weighted automata: Determinization methods Ivana Jančić: Fuzzy network analysis: Regular fuzzy equivalences and bisimulation Aleksander Ivanov: Categorical nilpotent QE-groups and computability Miodrag Kapetanović: A sufficient condition for quantifier elimination applicable to algebra Predrag Tanović: Strongly regular types Miloš Kurilić: Property (ħ) and cellularity of complete Boolean algebras
8 Friday, August 21 - Morning 9:00 9:50 SESSION 12 (Chair: M.B.Szendrei) Victor Dalmau: Constraint Satisfaction and linear width 10:00 10:50 Edmond W. H. Lee: Limit varieties generated by completely 0- simple semigroups 11:00 11:30 COFFEE BREAK 11:30 12:20 12:30 12:40 Closing Olga B. Sapir: Finitely generated permutative varieties
PROGRAM. Novi Sad, Serbia, March 15-18, The 83 rd Workshop on General Algebra & the 27 th Conference of Young Algebraists
The 83 rd Workshop on General Algebra & the 27 th Conference of Young Algebraists 83. Arbeitstagung allgemeine Algebra & 27. Tagung junger Algebraiker Novi Sad, Serbia, March 15-18, 2012 PROGRAM Wednesday,
Amphitheatre (ground floor) Room (floor I) Room (floor II) Emília Halušková: On limit closed classes of algebras
PROGRAMME Wednesday, 14 June 16:00 21:00 Registration (Reading Room, DMI Mathematics & Informatics building, ground floor) Thursday, 15 June Morning 7:45 8:30 Registration (Rectorate The central building
On Frankl conjecture. Coherence in predicate logic. Algebraic theory of fuzzy languages and automata
On Frankl conjecture Vladimir Božin University of Warwick, Coventry, United Kingdom bozin@maths.warwick.ac.uk Frankl conjecture states that for every finite family of sets closed under intersections there
Tutorial on the Constraint Satisfaction Problem
Tutorial on the Constraint Satisfaction Problem Miklós Maróti Vanderbilt University and University of Szeged Nový Smokovec, 2012. September 2 7. Miklós Maróti (Vanderbilt and Szeged) The Constraint Satisfaction
Tutorial on Universal Algebra, Mal cev Conditions, and Finite Relational Structures: Lecture I
Tutorial on Universal Algebra, Mal cev Conditions, and Finite Relational Structures: Lecture I Ross Willard University of Waterloo, Canada BLAST 2010 Boulder, June 2010 Ross Willard (Waterloo) Universal
Topological clones. Michael Pinsker. Technische Universität Wien / Univerzita Karlova v Praze. Funded by Austrian Science Fund (FWF) grant P27600
Technische Universität Wien / Univerzita Karlova v Praze Funded by Austrian Science Fund (FWF) grant P27600 TACL 2015 Outline I: Algebras, function clones, abstract clones, Birkhoff s theorem II:, Topological
{Symmetry, Logic, CSP}
{Symmetry, Logic, CSP} Libor Barto Charles University in Prague {Symmetry, Logic, Computation} Simons Institute, Berkeley, 9 Nov 2016 Message Topic: Constraint Satisfaction Problem (CSP) over a fixed finite
Constraint satisfaction problems over infinite domains
Constraint satisfaction problems over infinite domains Michael Kompatscher, Trung Van Pham Theory and Logic Group TU Wien Research Seminar, 27/04/2016 Schaefer s theorem Let Φ be a set of propositional
Algebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems
Algebraic Tractability Criteria for Infinite-Domain Constraint Satisfaction Problems Manuel Bodirsky Institut für Informatik Humboldt-Universität zu Berlin May 2007 CSPs over infinite domains (May 2007)
Finer complexity of Constraint Satisfaction Problems with Maltsev Templates
Finer complexity of Constraint Satisfaction Problems with Maltsev Templates Dejan Delic Department of Mathematics Ryerson University Toronto, Canada joint work with A. Habte (Ryerson University) May 24,
FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 83 87 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1 Dragan Mašulović
AAA71 - PROGRAM. Thursday, February 9, Registration Room C 17:30-18:30 Opening and Laudatio in memoriam Kazimierz Głazek 18:30-19:30 DINNER
AAA71 - PROGRAM Thursday, February 9, 2006 Registration 17:30-18:30 Opening and Laudatio in memoriam Kazimierz Głazek 18:30-19:30 DINNER Chair: P. Idziak Jiří Tuma (with Jiří Vabek) 19:30-21:00 On Rejewski's
Curriculum Vitae Keith A. Kearnes
Curriculum Vitae Keith A. Kearnes January 31, 2017 Contact Information: Department of Mathematics University of Colorado Boulder, CO 80309-0395 office phone: 303 492 5203 email: keith.kearnes@colorado.edu
TESTING FOR A SEMILATTICE TERM
TESTING FOR A SEMILATTICE TERM RALPH FREESE, J.B. NATION, AND MATT VALERIOTE Abstract. This paper investigates the computational complexity of deciding if a given finite algebra is an expansion of a semilattice.
CHARACTERIZATIONS OF SEVERAL MALTSEV CONDITIONS
CHARACTERIZATIONS OF SEVERAL MALTSEV CONDITIONS M. KOZIK, A. KROKHIN, M. VALERIOTE, AND R. WILLARD Abstract. Tame congruence theory identifies six Maltsev conditions associated with locally finite varieties
FINITELY RELATED ALGEBRAS IN CONGRUENCE DISTRIBUTIVE VARIETIES HAVE NEAR UNANIMITY TERMS
FINITELY RELATED ALGEBRAS IN CONGRUENCE DISTRIBUTIVE VARIETIES HAVE NEAR UNANIMITY TERMS LIBOR BARTO Abstract. We show that every finite, finitely related algebra in a congruence distributive variety has
Constraints in Universal Algebra
Constraints in Universal Algebra Ross Willard University of Waterloo, CAN SSAOS 2014 September 7, 2014 Lecture 1 R. Willard (Waterloo) Constraints in Universal Algebra SSAOS 2014 1 / 23 Outline Lecture
Universal algebra for CSP Lecture 2
Universal algebra for CSP Lecture 2 Ross Willard University of Waterloo Fields Institute Summer School June 26 30, 2011 Toronto, Canada R. Willard (Waterloo) Universal algebra Fields Institute 2011 1 /
FINITELY RELATED CLONES AND ALGEBRAS WITH CUBE-TERMS
FINITELY RELATED CLONES AND ALGEBRAS WITH CUBE-TERMS PETAR MARKOVIĆ, MIKLÓS MARÓTI, AND RALPH MCKENZIE Abstract. E. Aichinger, R. McKenzie, P. Mayr [1] have proved that every finite algebra with a cube-term
A SUBALGEBRA INTERSECTION PROPERTY FOR CONGRUENCE DISTRIBUTIVE VARIETIES
A SUBALGEBRA INTERSECTION PROPERTY FOR CONGRUENCE DISTRIBUTIVE VARIETIES MATTHEW A. VALERIOTE Abstract. We prove that if a finite algebra A generates a congruence distributive variety then the subalgebras
Polymorphisms, and how to use them
Polymorphisms, and how to use them Libor Barto 1, Andrei Krokhin 2, and Ross Willard 3 1 Department of Algebra, Faculty of Mathematics and Physics Charles University in Prague, Czech Republic libor.barto@gmail.com
Finite Simple Abelian Algebras are Strictly Simple
Finite Simple Abelian Algebras are Strictly Simple Matthew A. Valeriote Abstract A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said
Polymorphisms, and How to Use Them
Polymorphisms, and How to Use Them Libor Barto 1, Andrei Krokhin 2, and Ross Willard 3 1 Department of Algebra, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic libor.barto@gmail.com
Quick course in Universal Algebra and Tame Congruence Theory
Quick course in Universal Algebra and Tame Congruence Theory Ross Willard University of Waterloo, Canada Workshop on Universal Algebra and the Constraint Satisfaction Problem Nashville, June 2007 (with
Bounded width problems and algebras
Algebra univers. 56 (2007) 439 466 0002-5240/07/030439 28, published online February 21, 2007 DOI 10.1007/s00012-007-2012-6 c Birkhäuser Verlag, Basel, 2007 Algebra Universalis Bounded width problems and
TOPOLOGY IS IRRELEVANT (IN THE INFINITE DOMAIN DICHOTOMY CONJECTURE FOR CONSTRAINT SATISFACTION PROBLEMS)
TOPOLOGY IS IRRELEVANT (IN THE INFINITE DOMAIN DICHOTOMY CONJECTURE FOR CONSTRAINT SATISFACTION PROBLEMS) LIBOR BARTO AND MICHAEL PINSKER Abstract. We prove that an ω-categorical core structure primitively
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCE Department of Mathematics and Informatics
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCE Department of Mathematics and Informatics The 83rd Workshop on General Algebra & the 27th Conference of Young Algebraists ABSTRACTS Novi Sad, Serbia, March 15
14w5136 Algebraic and Model Theoretical Methods in Constraint Satisfaction
14w5136 Algebraic and Model Theoretical Methods in Constraint Satisfaction Manuel Bodirsky (Dresden Technical University) Andrei Bulatov (Simon Fraser University) Dugald MacPherson (University of Leeds)
The complexity of constraint satisfaction: an algebraic approach
The complexity of constraint satisfaction: an algebraic approach Andrei KROKHIN Department of Computer Science University of Durham Durham, DH1 3LE UK Andrei BULATOV School of Computer Science Simon Fraser
Graphs, Polymorphisms, and Multi-Sorted Structures
Graphs, Polymorphisms, and Multi-Sorted Structures Ross Willard University of Waterloo NSAC 2013 University of Novi Sad June 6, 2013 Ross Willard (Waterloo) Graphs, Polymorphisms, Multi-Sorted Struc NSAC
A FINER REDUCTION OF CONSTRAINT PROBLEMS TO DIGRAPHS
Logical Methods in Computer Science Vol. 11(4:18)2015, pp. 1 33 www.lmcs-online.org Submitted Jun. 24, 2014 Published Dec. 29, 2015 A FINER REDUCTION OF CONSTRAINT PROBLEMS TO DIGRAPHS JAKUB BULÍN a, DEJAN
Schaefer s theorem for graphs
Schaefer s theorem for graphs Manuel Bodirsky Laboratoire d Informatique (LIX), CNRS UMR 7161 École Polytechnique 91128 Palaiseau, France bodirsky@lix.polytechnique.fr Michael Pinsker Équipe de Logique
CD(4) HAS BOUNDED WIDTH
CD(4) HAS BOUNDED WIDTH CATARINA CARVALHO, VÍCTOR DALMAU, PETAR MARKOVIĆ, AND MIKLÓS MARÓTI Abstract. We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing
Clonoids and Promise CSP
Clonoids and Promise CSP Jakub Buĺın JKU Linz AAA94 & NSAC 2017 Research supported by University of Colorado Boulder and the Austrian Science Fund (FWF): P29931 In this talk... A more general framework
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCES Department of Mathematics and Informatics AAA94 + NSAC The 94th Workshop on General Algebra
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCES Department of Mathematics and Informatics AAA94 + NSAC 2017 The 94th Workshop on General Algebra in conjunction with the 5th Novi Sad Algebraic Conference ABSTRACTS
Schaefer s theorem for graphs
Schaefer s theorem for graphs Manuel Bodirsky Laboratoire d Informatique (LIX), CNRS UMR 7161 École Polytechnique 91128 Palaiseau, France bodirsky@lix.polytechnique.fr Michael Pinsker Équipe de Logique
Clones and Galois connections
Clones and Galois connections Reinhard Pöschel Institut für Algebra Technische Universität Dresden AAA75, Darmstadt 2007 on a special occasion concerning the founder of the AAA series November 2, 2007
AND. William DeMeo. joint work with. Cliff Bergman Jiali Li. Iowa State University BLAST 2015
THE ALGEBRAIC APPROACH TO CSP AND CSPS OF COMMUTATIVE IDEMPOTENT BINARS William DeMeo williamdemeo@gmail.com joint work with Cliff Bergman Jiali Li Iowa State University BLAST 2015 University of North
IDEMPOTENT n-permutable VARIETIES
IDEMPOTENT n-permutable VARIETIES M. VALERIOTE AND R. WILLARD Abstract. One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for
A Proof of CSP Dichotomy Conjecture
58th Annual IEEE Symposium on Foundations of Computer Science A Proof of CSP Dichotomy Conjecture Dmitriy Zhuk Department of Mechanics and Mathematics Lomonosov Moscow State University Moscow, Russia Email:
THE WONDERLAND OF REFLECTIONS
THE WONDERLAND OF REFLECTIONS LIBOR BARTO, JAKUB OPRŠAL, AND MICHAEL PINSKER Abstract. A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that
Subdirectly Irreducible Modes
Subdirectly Irreducible Modes Keith A. Kearnes Abstract We prove that subdirectly irreducible modes come in three very different types. From the description of the three types we derive the results that
NOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY
NOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY RALPH FREESE Abstract. In [1] T. Dent, K. Kearnes and Á. Szendrei define the derivative, Σ, of a set of equations Σ and show, for idempotent Σ,
Solving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory
Solving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory Nada Damljanović University of Kragujevac, Faculty of Technical Sciences in Čačak, Serbia nada.damljanovic@ftn.kg.ac.rs
Author manuscript, published in "27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010 (2010) "
Author manuscript, published in "27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010 (2010) 335-346" Symposium on Theoretical Aspects of Computer Science 2010 (Nancy, France),
The complexity of the list homomorphism problem for graphs
The complexity of the list homomorphism problem for graphs László Egri, Andrei Krokhin, Benoit Larose, Pascal Tesson April 2, 2009 Abstract We completely characterise the computational complexity of the
Remarks on categorical equivalence of finite unary algebras
Remarks on categorical equivalence of finite unary algebras 1. Background M. Krasner s original theorems from 1939 say that a finite algebra A (1) is an essentially multiunary algebra in which all operations
arxiv: v5 [cs.cc] 17 May 2015
![arxiv: v5 [cs.cc] 17 May 2015](/thumbs/80/81591651.jpg "arxiv: v5 [cs.cc] 17 May 2015")
SCHAEFER S THEOREM FOR GRAPHS MANUEL BODIRSKY AND MICHAEL PINSKER arxiv:1011.2894v5 [cs.cc] 17 May 2015 Abstract. Schaefer s theorem is a complexity classification result for so-called Boolean constraint
Constraint satisfaction problems and dualities
Andrei Krokhin - CSPs and dualities 1 Constraint satisfaction problems and dualities Andrei Krokhin University of Durham Andrei Krokhin - CSPs and dualities 2 The CSP The Constraint Satisfaction (or Homomorphism)
International Workshop on Mathematics of Constraint Satisfaction: Algebra, Logic and Graph Theory
International Workshop on Mathematics of Constraint Satisfaction: Algebra, Logic and Graph Theory 20-24 March 2006 St Anne's College, University of Oxford www.comlab.ox.ac.uk/mathscsp Constraints & Algebra
DECIDABILITY OF DEFINABILITY
DECIDABILITY OF DEFINABILITY MANUEL BODIRSKY, MICHAEL PINSKER, AND TODOR TSANKOV Abstract. For a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational
Collaborative Research: Algebra and Algorithms, Structure and Complexity Theory. National Science Foundation Grant No. DMS
Collaborative Research: Algebra and Algorithms, Structure and Complexity Theory National Science Foundation Grant No. DMS-1500174 B. Project Summary OVERVIEW This project will be a collaboration among
Congruence lattices and Compact Intersection Property
Congruence lattices and Compact Intersection Property Slovak Academy of Sciences, Košice June 8, 2013 Congruence lattices Problem. For a given class K of algebras describe Con K =all lattices isomorphic
Szigetek. K. Horváth Eszter. Szeged, április 27. K. Horváth Eszter () Szigetek Szeged, április / 43
Szigetek K. Horváth Eszter Szeged, 2010. április 27. K. Horváth Eszter () Szigetek Szeged, 2010. április 27. 1 / 43 Definition/1 Grid, neighbourhood relation K. Horváth Eszter () Szigetek Szeged, 2010.
Abelian Algebras and the Hamiltonian Property. Abstract. In this paper we show that a nite algebra A is Hamiltonian if the
Abelian Algebras and the Hamiltonian Property Emil W. Kiss Matthew A. Valeriote y Abstract In this paper we show that a nite algebra A is Hamiltonian if the class HS(A A ) consists of Abelian algebras.
UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS
UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS MICHAEL PINSKER AND SAHARON SHELAH Abstract. The set of all transformation monoids on a fixed set of infinite cardinality λ, equipped with the order
Taylor operations on finite reflexive structures
International Journal of Mathematics and Computer Science, 1(2006), 1-21 M CS Taylor operations on finite reflexive structures Benoit Larose Department of Mathematics and Statistics Concordia University
Bernhard Nebel, Julien Hué, and Stefan Wölfl. June 27 & July 2/4, 2012
Bernhard Nebel, Julien Hué, and Stefan Wölfl Albert-Ludwigs-Universität Freiburg June 27 & July 2/4, 2012 vs. complexity For some restricted constraint languages we know some polynomial time algorithms
Equational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
The Complexity of the Counting CSP
The Complexity of the Counting CSP Víctor Dalmau Universitat Pompeu Fabra The Complexity of the Counting CSP p.1/23 (Non Uniform) Counting CSP Def: (Homomorphism formulation) Let B be a (finite) structure.
On Polynomials in Mal cev Algebras
University of Novi Sad Faculty of Sciences Department of Mathematics and Informatics Nebojša Mudrinski On Polynomials in Mal cev Algebras Doctoral dissertation Novi Sad, 2009 Contents Foreword 3 Chapter
Complexity of conservative Constraint Satisfaction Problems
Complexity of conservative Constraint Satisfaction Problems ANDREI A. BULATOV Simon Fraser University In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set
Endomorphism Monoids of Graphs and Partial Orders
Endomorphism Monoids of Graphs and Partial Orders Nik Ruskuc nik@mcs.st-and.ac.uk School of Mathematics and Statistics, University of St Andrews Leeds, 3rd August 2007 S.J. Pride: S.J. Pride: Semigroups
arxiv: v2 [cs.cc] 2 Oct 2011
![arxiv: v2 [cs.cc] 2 Oct 2011](/thumbs/89/98907749.jpg "arxiv: v2 [cs.cc] 2 Oct 2011")
SCHAEFER S THEOREM FOR GRAPHS MANUEL BODIRSKY AND MICHAEL PINSKER arxiv:1011.2894v2 [cs.cc] 2 Oct 2011 Abstract. Schaefer s theorem is a complexity classification result for so-called Boolean constraint
CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS
CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS ANDREI BULATOV, PETER JEAVONS, AND ANDREI KROKHIN Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction
Algebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
Constraint Satisfaction Problems with Infinite Templates
Constraint Satisfaction Problems with Infinite Templates Manuel Bodirsky 1 École polytechnique, Laboratoire d informatique (LIX), France bodirsky@lix.polytechnique.fr Abstract. Allowing templates with
Caterpillar duality for CSP. C. Carvalho (UoD), V. Dalmau (UPF) and A. Krokhin (UoD)
Caterpillar duality for CSP C. Carvalho (UoD), V. Dalmau (UPF) and A. Krokhin (UoD) Motivation The following problems Scheduling; System of linear equations; Drawing up a timetable; Check the satisfiability
A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY
A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY KEITH A. KEARNES Abstract. We show that a locally finite variety satisfies a nontrivial congruence identity
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCE Department of Mathematics and Informatics AAA90
UNIVERSITY OF NOVI SAD FACULTY OF SCIENCE Department of Mathematics and Informatics AAA90 The 90th Workshop on General Algebra 90. Arbeitstagung Allgemeine Algebra ABSTRACTS Novi Sad, Serbia, June 5-7,
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. Katětov functors. Wiesław Kubiś Dragan Mašulović
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES Katětov functors Wiesław Kubiś Dragan Mašulović Preprint No. 2-2016 PRAHA 2016 Katětov functors Wies law Kubiś Dragan Mašulović Jan Kochanowski University
Answer: A. Answer: C. 3. If (G,.) is a group such that a2 = e, a G, then G is A. abelian group B. non-abelian group C. semi group D.
1. The set of all real numbers under the usual multiplication operation is not a group since A. zero has no inverse B. identity element does not exist C. multiplication is not associative D. multiplication
Quantified Equality Constraints
Quantified Equality Constraints Manuel Bodirsky Institut für Informatik Humboldt-Universität zu Berlin, Germany bodirsky@informatik.hu-berlin.de Hubie Chen Departament de Tecnologies de la Informació i
The p n sequences of semigroup varieties generated by combinatorial 0-simple semigroups
The p n sequences of semigroup varieties generated by combinatorial 0-simple semigroups Kamilla Kátai-Urbán and Csaba Szabó Abstract. We analyze the free spectra of semigroup varieties generated by finite
CORES OF COUNTABLY CATEGORICAL STRUCTURES
Logical Methods in Computer Science Vol. 3 (1:2) 2007, pp. 1 16 www.lmcs-online.org Submitted Sep. 23, 2005 Published Jan. 25, 2007 CORES OF COUNTABLY CATEGORICAL STRUCTURES MANUEL BODIRSKY Institut für
Universal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
Primitivity. Peter J. Cameron. Combinatorics, Algebra and More 8 July 2013
Primitivity Peter J. Cameron Combinatorics, Algebra and More 8 July 2013 Before I begin, I d like to say sincere thanks to I my colleagues and students at Queen Mary, past and present, who have made this
AN OVERVIEW OF MODERN UNIVERSAL ALGEBRA
AN OVERVIEW OF MODERN UNIVERSAL ALGEBRA ROSS WILLARD Abstract. This article, aimed specifically at young mathematical logicians, gives a gentle introduction to some of the central achievements and problems
D E J A N D E L I C. MMath (Algebra and Logic) University of Novi Sad, Novi Sad, Yugoslavia BMath (Pure Mathematics)
D E P A R T M E N T O F M A T H E M A T I C S, R Y E R S O N U N I V E R S I T Y 3 5 0 V I C T O R I A S T., T O R O N T O, O N M 5 B 1 K 3 P H O N E ( 4 1 6 ) 9 7 9-5 0 0 0 E X T. 6 9 7 1 F A X ( 4 1
LOCALLY SOLVABLE FACTORS OF VARIETIES
PROCEEDINGS OF HE AMERICAN MAHEMAICAL SOCIEY Volume 124, Number 12, December 1996, Pages 3619 3625 S 0002-9939(96)03501-0 LOCALLY SOLVABLE FACORS OF VARIEIES KEIH A. KEARNES (Communicated by Lance W. Small)
The finite congruence lattice problem
The finite congruence lattice problem Péter P. Pálfy Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences and Eötvös University, Budapest Summer School on General Algebra and Ordered Sets
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete Jaroslav Nešetřil 1 and Mark Siggers 1 Department of Applied Mathematics and Institute for Theoretical Computer Science
MATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
Flexible satisfaction
Flexible satisfaction LCC 2016, Aix-Marseille Université Marcel Jackson A problem and overview A problem in semigroup theory The semigroup B 1 2 ( ) ( ) 1 0 1 0, 0 1 0 0, ( ) 0 1, 0 0 ( ) 0 0, 1 0 ( )
Jónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
arxiv: v1 [math.lo] 12 Sep 2007
![arxiv: v1 [math.lo] 12 Sep 2007](/thumbs/94/118282909.jpg "arxiv: v1 [math.lo] 12 Sep 2007")
CD(4) has bounded width arxiv:0709.1934v1 [math.lo] 12 Sep 2007 Catarina Carvalho, Víctor Dalmau, Petar Marković, and Miklós Maróti Abstract. We prove that the constraint languages invariant under a short
NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION
NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,
A DICHOTOMY FOR FIRST-ORDER REDUCTS OF UNARY STRUCTURES
Logical Methods in Computer Science Vol. 14(2:13)2018, pp. 1 31 https://lmcs.episciences.org/ Submitted Apr. 12, 2017 Published May 22, 2018 A DICHOTOMY FOR FIRST-ORDER REDUCTS OF UNARY STRUCTURES MANUEL
A monoidal interval of clones of selfdual functions
Journal of Automata, Languages and Combinatorics u v w, x y c Otto-von-Guericke-Universität Magdeburg A monoidal interval of clones of selfdual functions Andrei Krokhin Department of Computer Science,
A four element semigroup that is inherently nonfinitely based?
A four element semigroup that is inherently nonfinitely based? Peter R. Jones Marquette University NBSAN Workshop, York, November 21, 2012 Finite basis properties A (finite) algebra A is finitely based
TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS
International Journal of Algebra and Computation Vol. 16, No. 3 (2006) 563 581 c World Scientific Publishing Company TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER
Permutation groups and transformation semigroups
Permutation groups and transformation semigroups Peter J. Cameron Novi Sad Algebraic Conference, June 2013 Groups and semigroups How can group theory help the study of semigroups? If a semigroup has a
RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS
RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS KEITH A. KEARNES AND YOUNG JO KWAK Abstract. We prove that if V is a residually finite variety of nonassociative algebras over a finite field, and
ABSTRACT ALGEBRA WITH APPLICATIONS
ABSTRACT ALGEBRA WITH APPLICATIONS IN TWO VOLUMES VOLUME I VECTOR SPACES AND GROUPS KARLHEINZ SPINDLER Darmstadt, Germany Marcel Dekker, Inc. New York Basel Hong Kong Contents f Volume I Preface v VECTOR
The complexity of conservative valued CSPs
The complexity of conservative valued CSPs (Extended Abstract) Vladimir Kolmogorov Institute of Science and Technology (IST), Austria vnk@ist.ac.at Stanislav Živný University of Oxford, UK standa.zivny@cs.ox.ac.uk
On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties
International Journal of Algebra, Vol. 1, 2007, no. 1, 1 9 On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties Edmond W. H. Lee 1 Department of Mathematics, Simon Fraser University
SMALL CONGRUENCE LATTICES
SMALL CONGRUENCE LATTICES William DeMeo williamdemeo@gmail.com University of South Carolina joint work with Ralph Freese, Peter Jipsen, Bill Lampe, J.B. Nation BLAST Conference Chapman University August
Primitive Ideals of Semigroup Graded Rings
Sacred Heart University DigitalCommons@SHU Mathematics Faculty Publications Mathematics Department 2004 Primitive Ideals of Semigroup Graded Rings Hema Gopalakrishnan Sacred Heart University, gopalakrishnanh@sacredheart.edu
arxiv: v1 [cs.lo] 13 Feb 2016
![arxiv: v1 [cs.lo] 13 Feb 2016](/thumbs/80/82082015.jpg "arxiv: v1 [cs.lo] 13 Feb 2016")
THE ALGEBRAIC DICHOTOMY CONJECTURE FOR INFINITE DOMAIN CONSTRAINT SATISFACTION PROBLEMS LIBOR BARTO AND MICHAEL PINSKER arxiv:1602.04353v1 [cs.lo] 13 Feb 2016 Abstract. We prove that an ω-categorical core