3 citations · 3 across the 5 of their papers we have counts for
7 papers
On the simplicity of Katsura algebras
Josiah Aakre, Nóra Szakács
We give a complete characterization of the (purely infinite) simplicity of Katsura algebras and the associated Steinberg algebras. This is achieved by characterizing when the singu…
On the simplicity of Nekrashevych algebras of contracting self-similar groups
Benjamin Steinberg, Nóra Szakács
Nekrashevych algebras of self-similar group actions are natural generalizations of the classical Leavitt algebras. They are discrete analogues of the corresponding Nekrashevych $C^…
Simplicity of inverse semigroup and étale groupoid algebras
Benjamin Steinberg, Nóra Szakács
In this paper, we prove that the algebra of an étale groupoid with totally disconnected unit space has a simple algebra over a field if and only if the groupoid is minimal and effe…
Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
Robert D. Gray, Pedro V. Silva, Nóra Szakács
We prove that the class of finitely presented inverse monoids whose Schützenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the langu…
Inverse monoids of partial graph automorphisms
Robert Jajcay, Tatiana Jajcayova, Nóra Szakács +1
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoi…
On F-inverse covers of finite-above inverse monoids
Nóra Szakács, Mária B. Szendrei
Finite-above inverse monoids are a common generalization of finite inverse monoids and Margolis--Meakin expansions of groups. Given a finite-above -unitary inverse monoid an…
On the number of slim, semimodular lattices
Gábor Czédli, Tamás Dékány, László Ozsvárt +2
A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G.…