Results 11 to 20 of about 2,420 (83)
Dynamic asymptotic dimension and Matui's HK conjecture
Proceedings of the London Mathematical Society, Volume 126, Issue 4, Page 1182-1253, April 2023., 2023 Abstract We prove that the homology groups of a principal ample groupoid vanish in dimensions greater than the dynamic asymptotic dimension of the groupoid (as a side‐effect of our methods, we also give a new model of groupoid homology in terms of the Tor groups of homological algebra, which might be of independent interest).
Christian Bönicke +3 more
wiley +1 more source
Schreier split extensions of preordered monoids [PDF]
, 2020 Properties of preordered monoids are investigated and important subclasses of such structures are studied. The corresponding full subcategories of the category of preordered monoids are functorially related between them as well as with the categories of ...
Martins-Ferreira, Nelson +1 more
core +2 more sources
Boolean Algebras with Semigroup Operators: Free Product and Free Objects
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 Two important algebraic structures are S‐acts and Boolean algebras. Combining these two structures, one gets S‐Boolean algebras, equipped with a compatible right action of a monoid S which is a special case of Boolean algebras with operators. In this article, we considered some category‐theoretic properties of the category Boo‐S of all S‐Boolean ...
H. Barzegar, Carmelo Antonio Finocchiaro
wiley +1 more source
The omega-inequality problem for concatenation hierarchies of star-free languages [PDF]
, 2017 The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages.
Almeida, J., Klíma, O., Kunc, M.
core +2 more sources
Norms on complex matrices induced by complete homogeneous symmetric polynomials
Bulletin of the London Mathematical Society, Volume 54, Issue 6, Page 2078-2100, December 2022., 2022 Abstract We introduce a remarkable new family of norms on the space of n×n$n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in non‐commuting variables.
Konrad Aguilar +3 more
wiley +1 more source
Eilenberg Theorems for Free [PDF]
, 2017 Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
Polyhedra, lattice structures, and extensions of semigroups
Journal of the London Mathematical Society, Volume 106, Issue 4, Page 3938-4008, December 2022., 2022 Abstract For an arbitrary rational polyhedron, we consider its decompositions into Minkowski summands and, dual to this, the so‐called free extensions of the associated pair of semigroups. Being free for a pair of semigroups is equivalent to flatness for the corresponding algebras.
Klaus Altmann +2 more
wiley +1 more source
Identities in the Algebra of Partial Maps [PDF]
, 2006 We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Jackson, Marcel, Stokes, Tim E.
core +2 more sources
Hypersurface singularities with monomial Jacobian ideal
Bulletin of the London Mathematical Society, Volume 54, Issue 3, Page 1067-1081, June 2022., 2022 Abstract We show that every convergent power series with monomial extended Jacobian ideal is right equivalent to a Thom–Sebastiani polynomial. This solves a problem posed by Hauser and Schicho. On the combinatorial side, we introduce a notion of Jacobian semigroup ideal involving a transversal matroid.
Raul Epure, Mathias Schulze
wiley +1 more source
Monoids with tests and the algebra of possibly non-halting programs [PDF]
, 2014 We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Jackson, Marcel, Stokes, Tim E.
core +4 more sources