Results 41 to 50 of about 6,864 (172)
Aggregation and the Structure of Value
ABSTRACT Roughly, the view I call “Additivism” sums up value across time and people. Given some standard assumptions, I show that Additivism follows from two principles. The first says that how lives align in time cannot, in itself, matter. The second says, roughly, that a world cannot be better unless it is better within some period or another.
Weng Kin San
wiley +1 more source
Acylindrical visual splittings and the Tits alternative for Artin groups
Abstract We give a necessary and sufficient condition on a visual splitting of an Artin group satisfying the conclusions of two well‐known conjectures to be acylindrical, and demonstrate how this can be used to provide a large class of novel examples of Artin groups that satisfy the Tits alternative.
William D. Cohen
wiley +1 more source
22 pages, 6 figuresWe investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof
Surroca, Gil Puig I, Knauer, Kolja
core +1 more source
Two-sided homological properties of special and one-relator monoids
A monoid presentation is called special if the right-hand side of each defining relation is equal to 1. We prove results which relate the two-sided homological finiteness properties of a monoid defined by a special presentation with those of its group of
Robert D. Gray, Benjamin Steinberg
doaj +1 more source
Convergence and combinatorics of the Reverse algorithm
Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito +2 more
wiley +1 more source
A Levi–Civita Equation on Monoids, Two Ways
We consider the Levi–Civita equation f(xy)=g1(x)h1(y)+g2(x)h2(y)f\left( {xy} \right) = {g_1}\left( x \right){h_1}\left( y \right) + {g_2}\left( x \right){h_2}\left( y \right) for unknown functions f, g1, g2, h1, h2 : S → ℂ, where S is a monoid.
Ebanks Bruce
doaj +1 more source
Endomorphisms and anti-endomorphisms of some finite groupoids
In this paper, we study anti-endomorphisms of some finite groupoids. Previously, special groupoids $S(k, q)$ of order $k(1+k)$ with a generating set of $k$ elements were introduced.
Litavrin Andrey V.
doaj +1 more source
Geometric inverse semigroup theory: a note on the Milnor–Schwarz lemma for inverse monoids
Abstract We generalise the Milnor–Schwarz lemma to inverse monoids acting on presheaves of geodesic metric spaces. We provide two proofs of this fact: one only uses elementary techniques, inspired by the arguments for group actions on metric spaces; the other involves a version of the Vietoris–Rips complex, and builds on work of Chung–Martínez–Szakács.
Giorgio Mangioni, Francesco Tesolin
wiley +1 more source
Interpolation categories for conformal embeddings
Abstract In this paper, we give a diagrammatic description of the categories of modules coming from the conformal embeddings V(slN,N)⊂V(soN2−1,1)$\mathcal{V}({\mathfrak{sl}}_{N},N)\subset \mathcal{V}({\mathfrak{so}}_{{N}^{2}-1},1)$. A small variant of this construction (morally corresponding to a conformal embedding of glN${\mathfrak{gl}}_{N}$ level N ...
Cain Edie‐Michell, Noah Snyder
wiley +1 more source
Pascal\u27s triangle is a very important structure in combinatorics: its entries, the binomial coefficients, answer a number of counting-related questions. I will define a set of functions, the Planar Rook monoid, whose structure is tied to Pascal\u27s
Herbig, Kathryn E
core +2 more sources

