Results 71 to 80 of about 4,881 (233)

Algebraic singular functions are not always dense in the ideal of C∗$C^*$‐singular functions

Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.
Abstract We give the first examples of étale (non‐Hausdorff) groupoids G$\mathcal {G}$ whose C∗$C^*$‐algebras contain singular elements that cannot be approximated by singular elements in Cc(G)$\mathcal {C}_c(\mathcal {G})$. We provide two examples: one is a bundle of groups and the other a minimal and effective groupoid constructed from a self‐similar
Diego Martínez, Nóra Szakács
wiley   +1 more source

Manifestly unitary higher Hilbert spaces

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Higher idempotent completion gives a formal inductive construction of the n$n$‐category of finite‐dimensional n$n$‐vector spaces starting with the complex numbers. We propose a manifestly unitary construction of low‐dimensional higher Hilbert spaces, formally constructing the C∗$\mathrm{C}^*$‐3‐category of 3‐Hilbert spaces from Baez's 2 ...
Quan Chen, Giovanni Ferrer, Brett Hungar, David Penneys, Sean Sanford   +4 more
wiley   +1 more source

Monoid Varieties with Extreme Properties

, 2018
Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and, surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties.
Lee, Edmond W. H., Jackson, Marcel
core   +1 more source

Every group-embeddable monoid arises as the bimorphism monoid of some graph [PDF]

Generalizing results of Frucht and de Groot/Sabidussi, we demonstrate that every group-embeddable monoid is isomorphic to the bimorphism monoid of some graph.Mathematics Subject Classifications: 05C63, 20M30Keywords: Infinite graph theory, group ...
Dilley, Isaac K., Coleman, Tom, Dilley, Isaac, H. Coleman, Thomas D.   +3 more
core   +3 more sources

Topological Structures Induced by General Fuzzy Automata Based on Lattice-ordered Monoid

پژوهش‌های ریاضی, 2021
The fundamental role of algebraic properties in the development of the basics of computer science has led researchers to study the concepts of fuzzy automaton separatedness, connectedness, and reversibility on a large scale.In this paper, the general ...
khadijeh abolpour
doaj  

Counting 5‐isogenies of elliptic curves over Q$\mathbb {Q}$

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract We show that the number of 5‐isogenies of elliptic curves defined over Q$\mathbb {Q}$ with naive height bounded by H>0$H > 0$ is asymptotic to C5·H1/6(logH)2$C_5\cdot H^{1/6} (\log H)^2$ for some explicitly computable constant C5>0$C_5 > 0$. This settles the asymptotic count of rational points on the genus zero modular curves X0(m)$\mathcal {X}
Santiago Arango‐Piñeros, Changho Han, Oana Padurariu, Sun Woo Park   +3 more
wiley   +1 more source

On seminormal monoid rings

, 2006
Given a seminormal affine monoid M we consider several monoid properties of M and their connections to ring properties of the associated affine monoid ring K[M] over a field K.
Li, Ping, Bruns, Winfried, Römer, Tim
core   +1 more source

Graded near-rings

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
In this paper, we consider graded near-rings over a monoid G as generalizations of graded rings over groups, and study some of their basic properties.
Dumitru Mariana, Năstăsescu Laura, Toader Bogdan   +2 more
doaj   +1 more source

On the ET0L subgroup membership problem in bounded automata groups

Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.
Abstract We are interested in the subgroup membership problem in groups acting on rooted d$d$‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with d$d$ letters, form the boundary of the tree.
Alex Bishop, Daniele D'Angeli, Francesco Matucci, Tatiana Nagnibeda, Davide Perego, Emanuele Rodaro   +5 more
wiley   +1 more source

On the atomicity of power monoids of Puiseux monoids

International Journal of Algebra and Computation
A submonoid of the additive group [Formula: see text] is called a Puiseux monoid if it consists of non-negative rationals. Given a monoid M, the set consisting of all non-empty finite subsets of M is also a monoid under the Minkowski sum, and it is called the (finitary) power monoid of M.
Victor Gonzalez, Eddy Li, Henrick Rabinovitz, Pedro Rodriguez, Marcos Tirador   +4 more
openaire   +2 more sources