• Publications
  • Influence
Definability in the Substructure Ordering of Simple Graphs
For simple graphs, we investigate and seek to characterize the properties first-order definable by the induced subgraph relation. Let $${\mathcal{P}\mathcal{G}}$$PG denote the set of finiteExpand
Dichotomy for finite tournaments of mixed-type
  • A. Wires
  • Mathematics, Computer Science
  • Discret. Math.
  • 6 December 2015
We characterize those finite tournaments T of mixed-type which admit a Taylor operation. Expand
A quasi-Mal’cev condition with unexpected application
A quasi-Mal’cev condition for quasivarieties is established which in the case of locally finite quasivarieties forbids strongly abelian congruences and for varieties is equivalent to possessing aExpand
On supernilpotent algebras
We establish a characterization of supernilpotent Mal’cev algebras which generalizes the affine structure of abelian Mal’cev algebras and the recent characterization of 2-supernilpotent Mal’cevExpand
Complexity in Young's Lattice
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 singleExpand
[Animal day 2006. Animal inspection and classical swine fever].
On finite Taylor algebras
  • A. Wires
  • Computer Science, Mathematics
  • Int. J. Algebra Comput.
  • 20 December 2016
We establish a new hereditary characterization of finite idempotent Taylor algebras. Expand