Results 71 to 80 of about 35,172 (254)
Modeling (∞,1)$(\infty,1)$‐categories with Segal spaces
Abstract In this paper, we construct a model structure for (∞,1)$(\infty,1)$‐categories on the category of simplicial spaces, whose fibrant objects are the Segal spaces. In particular, we show that it is Quillen equivalent to the models of (∞,1)$(\infty,1)$‐categories given by complete Segal spaces and Segal categories.
Lyne Moser, Joost Nuiten
wiley +1 more source
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 +2 more
doaj +1 more source
Hinich's model for Day convolution revisited
Abstract We prove that Hinich's construction of the Day convolution operad of two O$\mathcal {O}$‐monoidal ∞$\infty$‐categories is an exponential in the ∞$\infty$‐category of ∞$\infty$‐operads over O$\mathcal {O}$, and use this to give an explicit description of the formation of algebras in the Day convolution operad as a bivariant functor.
Christoph Winges
wiley +1 more source
The Hopf monoid on nonnesting supercharacters of pattern groups
We construct supercharacter theories for a collection of unipotent matrix groups and produce a Hopf monoid from the supercharacters. These supercharacter theories are coarser than those defined by Diaconis--Isaacs for algebra groups and have ...
Andrews, Scott
core +1 more source
Coxeter's enumeration of Coxeter groups
Abstract In a short paper that appeared in the Journal of the London Mathematical Society in 1934, H. S. M. Coxeter completed the classification of finite Coxeter groups. In this survey, we describe what Coxeter did in this paper and examine an assortment of topics that illustrate the broad and enduring influence of Coxeter's paper on developments in ...
Bernhard Mühlherr, Richard M. Weiss
wiley +1 more source
Coloring Complexes and Combinatorial Hopf Monoids
We generalize the notion of coloring complex of a graph to linearized combinatorial Hopf monoids. These are a generalization of the notion of coloring complex of a graph. We determine when a combinatorial Hopf monoid has such a construction, and discover
White, Jacob
core
Some Properties of Hyper Ideals in Hyper Hoop‐Algebras
In this paper, we investigate the structural properties of hyper ideals in hyper hoop‐algebras, a generalization of hoop‐algebras under the framework of hyperstructures. Building upon foundational concepts in hyper group theory and hoop theory, the study introduces definitions for hyper ideals and weak hyper ideals, as well as their absorptive and ...
Teferi Getachew Alemayehu +5 more
wiley +1 more source
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite ...
Ceccherini-Silberstein, Tullio +1 more
core +3 more sources
Topological Structures Induced by General Fuzzy Automata Based on Lattice-ordered Monoid
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
Semigroup identities and varieties of plactic monoids [PDF]
Thomas Aird
openalex +1 more source

