Skip to main content Accessibility help
×
Home
Hostname: page-component-59b7f5684b-7j4dq Total loading time: 0.241 Render date: 2022-09-27T02:19:50.693Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

Deciding the Existence of Minority Terms

Published online by Cambridge University Press:  24 October 2019

Alexandr Kazda
Affiliation:
Charles University, Prague, Czech Republic Email: alex.kazda@gmail.com
Jakub Opršal
Affiliation:
University of Durham, Durham, UK Email: jakub.oprsal@durham.ac.uk
Matt Valeriote
Affiliation:
McMaster University, Hamilton, Ontario, Canada Email: matt@math.mcmaster.ca
Dmitriy Zhuk
Affiliation:
Charles University, Prague, Czech Republic Lomonosov Moscow State University, Moscow, Russia Email: zhuk@intsys.msu.ru

Abstract

This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation $m$ that satisfies the minority equations $m(y,x,x)\approx m(x,y,x)\approx m(x,x,y)\approx y$. We show that a common polynomial-time approach to testing for this type of condition will not work in this case and that this decision problem lies in the class NP.

Type
Article
Copyright
© Canadian Mathematical Society 2019

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Author A. K. was supported by Charles University grants PRIMUS/SCI/12 and UNCE/SCI/022; J. O. was supported by the European Research Council (Grant Agreement no. 681988, CSP-Infinity) and the UK EPSRC (Grant EP/R034516/1); M. V. was supported by the Natural Sciences and Engineering Council of Canada; D. Z. was supported by the Russian Foundation for Basic Research (grant 19-01-00200).

References

Bergman, C., Universal algebra: Fundamentals and selected topics. Pure and Applied Mathematics (Boca Raton), 301, CRC Press, Boca Raton, FL, 2012.Google Scholar
Bulatov, A., Mayr, P., and Szendrei, Á., The subpower membership problem for finite algebras with cube terms. Log. Methods Comput. Sci. 15(2019), no. 1, Paper No. 11.Google Scholar
Burris, S. and Sankappanavar, H. P., A course in universal algebra. Graduate Texts in Mathematics, 78, Springer-Verlag, New York-Berlin, 1981.CrossRefGoogle Scholar
Dalmau, V., Generalized majority-minority operations are tractable. Log. Methods in Comput. Sci. 2(2006), no. 4, 4:1. https://doi.org/10.2168/LMCS-2(4:1)2006.CrossRefGoogle Scholar
Freese, R. and Valeriote, M. A., On the complexity of some Maltsev conditions. Internat. J. Algebra Comput. 19(2009), 4177. https://doi.org/10.1142/S0218196709004956CrossRefGoogle Scholar
García, O. C. and Taylor, W., The lattice of interpretability types of varieties. Mem. Amer. Math. Soc. 50(1984), no. 305. https://doi.org/10.1090/memo/0305.Google Scholar
Horowitz, J., Computational complexity of various Mal’cev conditions. Internat. J. Algebra Comput. 23(2013), 15211531. https://doi.org/10.1142/S0218196713500343CrossRefGoogle Scholar
Kazda, A. and Valeriote, M., Deciding some Maltsev conditions in finite idempotent algebras. J. Symbolic Logic., to appear.Google Scholar
Kearnes, K. A. and Kiss, E. W., The shape of congruence lattices. Mem. Amer. Math. Soc. 222(2013), no. 1046. https://doi.org/10.1090/S0065-9266-2012-00667-8Google Scholar
Kozik, M., A finite set of functions with an EXPTIME-complete composition problem. Theoret. Comput. Sci. 407(2008), 330341. https://doi.org/10.1016/j.tcs.2008.06.057CrossRefGoogle Scholar
Mayr, P., The subpower membership problem for Mal’cev algebras. Internat. J. Algebra Comput. 22(2012), 1250075. https://doi.org/10.1142/S0218196712500750CrossRefGoogle Scholar
Olšák, M., The weakest nontrivial idempotent equations. Bull. London Math. Soc. 49(2017), 10281047. https://doi.org/10.1112/blms.12097CrossRefGoogle Scholar
Valeriote, M. and Willard, R., Idempotent n-permutable varieties. Bull. Lond. Math. Soc. 46(2014), 870880. https://doi.org/10.1112/blms/bdu044CrossRefGoogle Scholar
3
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Deciding the Existence of Minority Terms
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Deciding the Existence of Minority Terms
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Deciding the Existence of Minority Terms
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *