Corpus ID: 199000704

Complexity in Young's Lattice

@article{Wires2019ComplexityIY,
  title={Complexity in Young's Lattice},
  author={A. Wires},
  journal={arXiv: Combinatorics},
  year={2019}
}
  • A. Wires
  • Published 2019
  • Mathematics
  • arXiv: Combinatorics
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently, as an ordered set Young's lattice has an undecidable elementary theory and is inherently non-finitely axiomatizable but every ideal generates a finitely axiomatizable universal class of equivalence relations. We end with conjectures concerning the complexities… Expand

References

SHOWING 1-10 OF 25 REFERENCES
Definability in the Subword Order
Young's lattice and dihedral symmetries revisited: Möbius strips and metric geometry
Definability in the Substructure Ordering of Simple Graphs
Defining Recursive Predicates in Graph Orders
  • R. Thinniyam
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2018
Definability in Substructure Orderings, II: Finite Ordered Sets
ON DIFFERENTIAL POSETS
Theories of orders on the set of words
  • D. Kuske
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 2006
...
1
2
3
...