English
Related papers

Related papers: Finite bands are finitely related

200 papers

Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…

Rings and Algebras · Mathematics 2012-10-30 Ivan Trendafilov , Dimitrinka Vladeva

We show that every finite ring has a partition, where each block corresponds to one idempotent. Remarkably, this partition provides a way to \emph{lift} a wide variety of special elements such as idempotents, nilpotents, unipotents, roots…

Rings and Algebras · Mathematics 2023-04-19 Vineeth Chintala

For a finite group G, we introduce the complete suboperad $Q_G$ of the categorical G-Barratt-Eccles operad $P_G$. We prove that $P_G$ is not finitely generated, but $Q_G$ is finitely generated and is a genuine $E_\infty$ G-operad (i.e., it…

Algebraic Topology · Mathematics 2020-04-02 Kayleigh Bangs , Skye Binegar , Young Kim , Kyle Ormsby , Angélica M. Osorno , David Tamas-Parris , Livia Xu

We study the class of symmetric $n$-ary bands. These are $n$-ary semigroups $(X,F)$ such that $F$ is invariant under the action of permutations and idempotent, i.e., satisfies $F(x,\ldots,x)=x$ for all $x\in X$. We first provide a structure…

Rings and Algebras · Mathematics 2020-04-28 Jimmy Devillet , Pierre Mathonet

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Group Theory · Mathematics 2026-02-24 Sathasivam Kalithasan , Viji Z. Thomas

We present new conditions for semigroups of positive operators to converge strongly as time tends to infinity. Our proofs are based on a novel approach combining the well-known splitting theorem by Jacobs, de Leeuw and Glicksberg with a…

Functional Analysis · Mathematics 2019-01-29 Moritz Gerlach , Jochen Glück

In the present work we explore relationships between multiplicative functions defined in \cite{Garonzi_2018}, \cite{Lazorec}. To do so, we use other important quotients defined and studied in \cite{ndeg}, \cite{Marius}, thus establishing…

Group Theory · Mathematics 2025-09-12 João Victor Monteiros de Andrade , Leonardo Santos da Cruz

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

Logic · Mathematics 2011-05-17 Ehud Hrushovski

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Logic in Computer Science · Computer Science 2022-05-27 Eric Finster , David Reutter , Alex Rice , Jamie Vicary

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Formal Languages and Automata Theory · Computer Science 2015-03-17 Laurent Bartholdi , Pedro V. Silva

In 1985, Bucher, Ehrenfeucht and Haussler studied derivation relations associated with a given set of context-free rules. Their research motivated a question regarding homomorphisms from the semigroup of all words onto a finite ordered…

Formal Languages and Automata Theory · Computer Science 2022-03-15 Ondřej Klíma , Jonatan Kolegar

We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some…

Geometric Topology · Mathematics 2011-08-19 Kyler Siegel

We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.

Discrete Mathematics · Computer Science 2009-03-16 Jean Berstel , Luc Boasson , Olivier Carton , Isabelle Fagnot

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

Computational Complexity · Computer Science 2016-05-31 Peter Fulla , Stanislav Zivny

This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…

Commutative Algebra · Mathematics 2025-10-16 J. I. Farrán , J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

We develop a systematic theory of eventually positive semigroups of linear operators mainly on spaces of continuous functions. By eventually positive we mean that for every positive initial condition the solution to the corresponding Cauchy…

Functional Analysis · Mathematics 2015-12-01 Daniel Daners , Jochen Glück , James B. Kennedy

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

Commutative Algebra · Mathematics 2014-01-14 Tomáš Kepka , Miroslav Korbelář

Answering a question of A. V. Vasil'ev, we show that each finite symmetric (or alternating) group $H$ is a retract of any group containing $H$ as a verbally closed subgroup.

Group Theory · Mathematics 2025-10-14 Olga K. Karimova , Anton A. Klyachko

A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates that if a finite algebra A possesses a weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary…

Group Theory · Mathematics 2015-01-20 Clifford Bergman , David Failing
‹ Prev 1 8 9 10 Next ›