Results 61 to 70 of about 4,881 (233)

Oppenheim–Schur inequalities for causal products

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.
Abstract We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting.
Dominique Guillot   +2 more
wiley   +1 more source

On Endomorphisms of the Additive Monoid of Subnets of a Two-layer Neural Network

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2022
Previously, for each multilayer neural network of direct signal propagation (hereinafter, simply a neural network), finite commutative groupoids were introduced, which were called additive subnet groupoids.
Andrey Litavrin
doaj   +1 more source

Infinity‐operadic foundations for embedding calculus

open access: yesJournal of Topology, Volume 19, Issue 2, June 2026.
Abstract Motivated by applications to spaces of embeddings and automorphisms of manifolds, we consider a tower of ∞$\infty$‐categories of truncated right modules over a unital ∞$\infty$‐operad O$\mathcal {O}$. We study monoidality and naturality properties of this tower, identify its layers, describe the difference between the towers as O$\mathcal {O}$
Manuel Krannich, Alexander Kupers
wiley   +1 more source

Kauffman Monoids

open access: yesJournal of Knot Theory and Its Ramifications, 2002
This paper gives a self-contained and complete proof of the isomorphism of freely generated monoids extracted from Temperley-Lieb algebras with monoids made of Kauffman's diagrams.
Borisavljević, Mirjana   +2 more
openaire   +2 more sources

Confluence of the Chinese Monoid [PDF]

open access: yes, 2019
The Chinese monoid, related to Knuth’s Plactic monoid, is of great interest in algebraic combinatorics. Both are ternary monoids, generated by relations between words of three symbols. The relations are, for a totally ordered alphabet, cba = cab = bca if
Klop, Jan Willem   +5 more
core   +2 more sources

On residually finite semigroups of cellullar automata [PDF]

open access: yesInternational Journal of Group Theory, 2015
We prove that if M is a monoid and A a finite set with more than one element‎, ‎then the residual finiteness of M is equivalent to that of the monoid consisting of all cellular automata over M with alphabet A ‎.
Tullio Ceccherini-Silberstein   +1 more
doaj  

Thurston norm for coherent right‐angled Artin groups via L2$L^2$‐invariants

open access: yesJournal of Topology, Volume 19, Issue 2, June 2026.
Abstract We define a new notion of splitting complexity for a group G$G$ along a non‐trivial integral character ϕ∈H1(G;Z)$\phi \in H^1(G; \mathbb {Z})$. If G$G$ is a one‐ended coherent right‐angled Artin group, we show that the splitting complexity along an epimorphism ϕ:G→Z$\phi \colon G \rightarrow \mathbb {Z}$ equals the L2$L^2$‐Euler characteristic
Monika Kudlinska
wiley   +1 more source

The Möbius Inverse Monoid

open access: yes, 1998
We show that the Möbius transformations generate anF-inverse monoid whose maximum group image is the Möbius group.
Lawson, Mark V.
core   +1 more source

Twisted ambidexterity in equivariant homotopy theory

open access: yesJournal of Topology, Volume 19, Issue 2, June 2026.
Abstract We develop the concept of twisted ambidexterity in a parametrized presentably symmetric monoidal ∞$\infty$‐category, which generalizes the notion of ambidexterity by Hopkins and Lurie and the Wirthmüller isomorphisms in equivariant stable homotopy theory, and is closely related to Costenoble–Waner duality.
Bastiaan Cnossen
wiley   +1 more source

On semifir monoid rings

open access: yes, 2021
We give a new condition on a monoid M for the monoid ring F[M] to be a 2-fir. Futhermore, we construct a monoid M that satisfies all the currently known necessary conditions for F[M] to be a semifir and that the group of units ofM is trivial, but M is ...
Cedó, Ferran
core  

Home - About - Disclaimer - Privacy