Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Nik Ruskuc"'
The study of permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative combinatorics, model theory, the theory of automata and languages, and bioinformatics. Arising
Publikováno v:
University of St Andrews CRIS
Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is inherited
Autor:
Nik Ruskuc, Ashley Clayton
Publikováno v:
Journal of the Australian Mathematical Society. 109:24-35
The direct product $\mathbb{N}\times \mathbb{N}$ of two free monogenic semigroups contains uncountably many pairwise nonisomorphic subdirect products. Furthermore, the following hold for $\mathbb{N}\times S$, where $S$ is a finite semigroup. It conta
Autor:
Craig Miller, Nik Ruskuc
Publikováno v:
Communications in Algebra. 47:782-799
The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act $A$ and a
We investigate four finiteness conditions related to residual finiteness: complete separability, strong subsemigroup separability, weak subsemigroup separability and monogenic subsemigroup separability. For each of these properties we examine under w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b8cd9dda74b92959dda46ed193b2d82
Funding: UK Engineering and Physical Sciences Research Council (EPSRC) grant EP/I032312/1. Research also partially supported by the Hungarian Scientific Research Fund (OTKA) grant PD115705. The research of Yang Dandan was supported by grant 20170604
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94aa178fe880f629a4cb2d96c77986fe
https://eprints.whiterose.ac.uk/164764/1/coherencyrevised.pdf
https://eprints.whiterose.ac.uk/164764/1/coherencyrevised.pdf
Autor:
James East, Nik Ruskuc
The twisted partition monoid $\mathcal{P}_n^\Phi$ is an infinite monoid obtained from the classical finite partition monoid $\mathcal{P}_n$ by taking into account the number of floating components when multiplying partitions. The main result of this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fdf0e33e39a19c99b6ea2d184c98b917
http://arxiv.org/abs/2010.04392
http://arxiv.org/abs/2010.04392
Autor:
Matthew McDevitt, Nik Ruskuc
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being decomposable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bb359e283707879efea01b3b906a77e
http://arxiv.org/abs/2003.10743
http://arxiv.org/abs/2003.10743
Publikováno v:
Bulletin of the London Mathematical Society. 50:1016-1026
The first two authors were supported by the National Science Foundation under Grant No. DMS 1500254. We prove the statement in the title and exhibit examples of quotients of arbitrary nilpotency class. This answers a question by Holt. Postprint