Permutation groups with small orbit growth
暂无分享,去创建一个
[1] Peter J. Cameron. Normal subgroups of infinite multiply transitive permutation groups , 1981, Comb..
[2] J. Melleray,et al. Polish groups and Baire category methods , 2016 .
[3] Dmitriy Zhuk,et al. A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[4] Lovkush Agarwal,et al. Reducts of the generic digraph , 2014, Annals of Pure and Applied Logic.
[5] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[6] W. Hodges,et al. Cohomology of Structures and Some Problems of Ahlbrandt and Ziegler , 1994 .
[7] Saharon Shelah,et al. The Small Index Property for ω‐Stable (ω‐Categorical Structures and for the Random Graph , 1993 .
[8] James H. Schmerl,et al. Countable homogeneous partially ordered sets , 1979 .
[9] P. Cameron. Transitivity of permutation groups on unordered sets , 1976 .
[10] Szymon Torunczyk,et al. On computability and tractability for infinite sets , 2018, LICS.
[11] A. H. Lachlan,et al. Countable homogeneous tournaments , 1984 .
[12] Peter M. Neumann. OLIGOMORPHIC PERMUTATION GROUPS (London Mathematical Society Lecture Note Series 152) , 1992 .
[13] Simon Thomas,et al. Reducts of the random graph , 1991, Journal of Symbolic Logic.
[14] Christian Rosendal,et al. Automatic Continuity of Group Homomorphisms , 2009, The Bulletin of Symbolic Logic.
[15] Markus Junker,et al. The 116 reducts of (ℚ, <, a) , 2008, Journal of Symbolic Logic.
[16] Andrew M. Pitts,et al. A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.
[17] P. Cameron,et al. Infinitely many reducts of homogeneous structures , 2016, 1609.07694.
[18] J. K. Truss,et al. Countable homogeneous multipartite graphs , 2012, Eur. J. Comb..
[19] Martin Ziegler,et al. What's so special about (Z/4Z)ω? , 1991, Arch. Math. Log..
[20] Ehud Hrushovski,et al. Totally categorical structures , 1989 .
[21] Martin Ziegler,et al. Quasi finitely axiomatizable totally categorical theories , 1986, Ann. Pure Appl. Log..
[22] Reza Akhtar,et al. On countable homogeneous 3-hypergraphs , 1995, Arch. Math. Log..
[23] Ehud Hrushovski,et al. Finite Structures with Few Types , 1993 .
[24] Michael Pinsker,et al. Schaefer's Theorem for Graphs , 2015, J. ACM.
[25] E. Gaughan. Topological group structures of infinite symmetric groups. , 1967, Proceedings of the National Academy of Sciences of the United States of America.
[26] Michael Pinsker,et al. Canonical Functions: a proof via topological dynamics , 2016, Contributions Discret. Math..
[27] Barnaby Martin,et al. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[28] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.
[29] Reconstructing structures with the strong small index property up to bi-definability , 2017, Fundamenta Mathematicae.
[30] Second cohomology groups and finite covers of infinite symmetric groups , 2009, 0909.0366.
[31] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[32] Slawomir Lasota,et al. Turing Machines with Atoms , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[33] Jaroslav Nesetril,et al. Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..
[34] Slawomir Lasota,et al. Automata theory in nominal sets , 2014, Log. Methods Comput. Sci..
[35] Michael Pinsker,et al. Reducts of the random partial order , 2011, 1111.7109.
[36] Michael Pinsker,et al. Decidability of Definability , 2013, The Journal of Symbolic Logic.
[37] Manuel Bodirsky. Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..
[38] Peter J. Cameron. Some counting problems related to permutation groups , 2000, Discret. Math..
[39] Todor Tsankov,et al. Weakly almost periodic functions, model-theoretic stability, and minimality of topological groups , 2013, 1312.7757.
[40] C. Ward Henson,et al. Countable homogeneous relational structures and ℵ0-categorical theories , 1972, Journal of Symbolic Logic.
[41] Michael Kompatscher,et al. ${2^{{\aleph _0}}}$ PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS , 2018, The Journal of Symbolic Logic.
[42] John K. Truss,et al. Homogeneous coloured multipartite graphs , 2014, Eur. J. Comb..
[43] Manuel Bodirsky,et al. A Dichotomy for First-Order Reducts of Unary Structures , 2016, Log. Methods Comput. Sci..
[44] Michael Pinsker,et al. The universal homogeneous binary tree , 2014, J. Log. Comput..
[45] Michael Pinsker,et al. The 42 reducts of the random ordered graph , 2013, 1309.2165.
[46] Alistair H. Lachlan,et al. aleph0-Categorical, aleph0-stable structures , 1985, Annals of Pure and Applied Logic.
[47] Peter Jonsson,et al. The Reducts of the homogeneous Binary Branching C-Relation , 2016, J. Symb. Log..
[48] Saharon Shelah,et al. Subgroups of small index in infinite symmetric groups. II , 1986, Journal of Symbolic Logic.
[49] Soyoung Moon,et al. Highly transitive actions of free products , 2012, 1203.5652.
[50] Libor Barto,et al. The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
[51] Simon Thomas,et al. Reducts of Random Hypergraphs , 1996, Ann. Pure Appl. Log..