Samuel Coskey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Samuel Coskey has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Paul Ellis
Department of Mathematics and Computer Science Manhattanville College 2900 Purchase Street 10577 Purchase NY USA
8 shared publications - John D. Clemens
1910 University Drive, Boise, ID 83725
5 shared publications - Joel David Hamkins
University of Notre Dame
3 shared publications - Ben Blum-Smith
Department of Applied Mathematics and Statistics Johns Hopkins University
2 shared publications - Ilijas Farah
Department of Mathematics and Statistics, York University, 4700 Keele Street, North York, Ontario, Canada, M3J 1P3
2 shared publications - Juris Steprāns
Department of Mathematics York University Toronto, Ontario M3J 1P3, Canada
2 shared publications
Latest Publications
- Open Access
- 13 June 2022
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 88 (2) , 540-561
COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- 13 June 2022
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 88 (2) , 540-561
Open AccessCOMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- Open Access
The Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
We describe the Fundamental Theorem on Symmetric Polynomials (FTSP), exposit a classical proof, and offer a novel proof that arose out of an informal course on group theory. The paper develops this proof in tandem with the pedagogical context that led to it. We also discuss the role of the FTSP both as a lemma in the original historical development of Galois theory and as an early example of the connection between symmetry and expressibility that is described by the theory.
Open AccessThe Fundamental Theorem on Symmetric Polynomials: History's First Whiff of Galois Theory
We describe the Fundamental Theorem on Symmetric Polynomials (FTSP), exposit a classical proof, and offer a novel proof that arose out of an informal course on group theory. The paper develops this proof in tandem with the pedagogical context that led to it. We also discuss the role of the FTSP both as a lemma in the original historical development of Galois theory and as an early example of the connection between symmetry and expressibility that is described by the theory.
- Open Access
- 29 June 2020
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 66 (2) , 182-189
The classification of countable models of set theory
- 29 June 2020
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 66 (2) , 182-189
Open AccessThe classification of countable models of set theory
- Open Access
The classification of countable models of set theory
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be. We then give partial results concerning the classification of countable well-founded models of ZFC.
Open AccessThe classification of countable models of set theory
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be. We then give partial results concerning the classification of countable well-founded models of ZFC.
- Open Access
The set splittability problem
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or ceiling.) It is natural to study the set splittability problem in the context of combinatorial discrepancy theory and its applications, since a collection is splittable if and only if it has discrepancy $\leq1$. We introduce a natural generalization of splittability problem called the $p$-splittability problem, where we replace the fraction $\frac12$ in the definition with an arbitrary fraction $p\in(0,1)$. We first show that the $p$-splittability problem is NP-complete. We then give several criteria for $p$-splittability, including a complete characterization of $p$-splittability for three or fewer sets ($p$ arbitrary), and for four or fewer sets ($p=\frac12$). Finally we prove the asymptotic prevalence of splittability over unsplittability in an appropriate sense.Open AccessThe set splittability problem
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or ceiling.) It is natural to study the set splittability problem in the context of combinatorial discrepancy theory and its applications, since a collection is splittable if and only if it has discrepancy $\leq1$. We introduce a natural generalization of splittability problem called the $p$-splittability problem, where we replace the fraction $\frac12$ in the definition with an arbitrary fraction $p\in(0,1)$. We first show that the $p$-splittability problem is NP-complete. We then give several criteria for $p$-splittability, including a complete characterization of $p$-splittability for three or fewer sets ($p$ arbitrary), and for four or fewer sets ($p=\frac12$). Finally we prove the asymptotic prevalence of splittability over unsplittability in an appropriate sense. - Open Access
On the classification of automorphisms of trees
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the conjugacy problem in the case of automorphisms of several non-regularly branching trees.
Open AccessOn the classification of automorphisms of trees
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the conjugacy problem in the case of automorphisms of several non-regularly branching trees.
- 8 November 2018
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 58 (5-6) , 565-574
On the classification of vertex-transitive structures
- 8 November 2018
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 58 (5-6) , 565-574
On the classification of vertex-transitive structures
- Open Access
On the classification of vertex-transitive structures
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that the classification of countable vertex-transitive digraphs and partial orders are Borel complete. We identify the complexity of the classification of countable vertex-transitive linear orders. Finally we show that the classification of vertex-transitive countable tournaments is properly above $E_0$ in complexity.Open AccessOn the classification of vertex-transitive structures
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that the classification of countable vertex-transitive digraphs and partial orders are Borel complete. We identify the complexity of the classification of countable vertex-transitive linear orders. Finally we show that the classification of vertex-transitive countable tournaments is properly above $E_0$ in complexity. - 8 September 2018
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 58 (3-4) , 457-467
Conjugacy for homogeneous ordered graphs
- 8 September 2018
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 58 (3-4) , 457-467
Conjugacy for homogeneous ordered graphs
- Open Access
Conjugacy for homogeneous ordered graphs
We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of $G$ is Borel reducible to the conjugacy relation on automorphisms of $G$.Open AccessConjugacy for homogeneous ordered graphs
We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that the isomorphism relation on substructures of $G$ is Borel reducible to the conjugacy relation on automorphisms of $G$.