English
Related papers

Related papers: Enumerating submonoids of finite commutative monoi…

200 papers

Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…

Logic in Computer Science · Computer Science 2020-12-24 Ugo Dal Lago , Claudia Faggian , Simona Ronchi Della Rocca

The study of the combinatorics of the modular group and of Coxeter's friezes naturally leads to the investigation of a matrix equation, sometimes referred to as the Conway-Coxeter equation. The solutions of size $n$ of this equation, called…

Combinatorics · Mathematics 2026-04-15 Flavien Mabilat

Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…

Rings and Algebras · Mathematics 2026-04-03 Volkan Yildiz

We introduce rational semimodules over semirings whose addition is idempotent, like the max-plus semiring, in order to extend the geometric approach of linear control to discrete event systems. We say that a subsemimodule of the free…

Optimization and Control · Mathematics 2007-05-23 Stephane Gaubert , Ricardo Katz

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

Group Theory · Mathematics 2023-05-15 L. Elliott , A. Levine , J. D. Mitchell

If $M$ is a submonoid of a finitely generated nilpotent group $G$, and $MG'$ is a finite index subgroup of $G$, then $M$ itself is a finite index subgroup of $G$. If $MG'=G$, then $M=G$. This generalizes a well-known theorem for subgroups…

Group Theory · Mathematics 2024-02-13 Doron Shafrir

Given a matrix-valued function $\mathcal{F}(\lambda)=\sum_{i=1}^d f_i(\lambda) A_i$, with complex matrices $A_i$ and $f_i(\lambda)$ entire functions for $i=1,\ldots,d$, we discuss a method for the numerical approximation of the distance to…

Numerical Analysis · Mathematics 2025-04-11 Miryam Gnazzo , Nicola Guglielmi

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

Rings and Algebras · Mathematics 2026-05-18 Salvatore Tringali

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

Logic · Mathematics 2011-05-31 Manuel Bodirsky , Michael Pinsker

Let R be a unital commutative ring and let $M$ be an $R$-module that is generated by $k$ elements but not less. Let $E_n(R)$ be the subgroup of $GL_n(R)$ generated by the elementary matrices. In this paper we study the action of $E_n(R)$ by…

Commutative Algebra · Mathematics 2017-02-06 Luc Guyot

Let $ x=(x_{n})_{n} $ be a bounded complex sequence and let $M_{x} = \sup_n |x_n|$. By using a normaloid operator related to the sequence $ x=(x_{n})_{n} $, we prove that $$ \sup_{\lambda \in \mathbb{C}, |\lambda| \leq M_x} \sup_n…

Functional Analysis · Mathematics 2019-01-29 Abderrahim Baghdad , Mohamed Chraibi kaadoud

We discuss boundedness and compactness properties of the embedding $M_\Lambda^1\subset L^1(\mu)$, where $M_\Lambda^1$ is the closure of the monomials $x^{\lambda_n}$ in $L1([0,1])$ and $\mu$ is a finite positive Borel measure on the…

Functional Analysis · Mathematics 2014-02-17 Isabelle Chalendar , Emmanuel Fricain , Dan Timotin

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

Let B be the Lie algebra with basis {L_{i,j},C|i,j\in Z} and relations [L_{i,j},L_{k,l}]=((j+1)k-i(l+1))L_{i+k,j+l}+i\delta_{i,-k}\delta_{j+l,-2}C, [C,L_{i,j}]=0. It is proved that an irreducible highest weight B-module is quasifinite if…

Representation Theory · Mathematics 2007-05-23 Qifen Jiang , Yuezhu Wu

$(1)$ Let $M\subset N$ be a commutative cancellative torsion-free and subintegral extension of monoids. Then we prove that in the case of ring extension $A[M]\subset A[N]$, the two notions, subintegral and weakly subintegral coincide…

Commutative Algebra · Mathematics 2025-07-21 Md Abu Raihan , Leslie G. Roberts , Husney Parvez Sarwar

We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…

Combinatorics · Mathematics 2020-07-07 Rosa Orellana , Mike Zabrocki

Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…

Logic in Computer Science · Computer Science 2016-10-06 Piotr Hofman , Jérôme Leroux , Patrick Totzke

The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…

Algebraic Geometry · Mathematics 2010-03-18 Z. Izhakian , E. Shustin

In this article, we study the Bruhat-Chevalley-Renner order on the complex symplectic monoid $MSp_n$. After showing that this order is completely determined by the Bruhat-Chevalley-Renner order on the linear algebraic monoid of $n\times n$…

Combinatorics · Mathematics 2020-06-02 Mahir Bilen Can , Hayden Houser , Corey Wolfe

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…

Formal Languages and Automata Theory · Computer Science 2014-04-23 Martin Huschenbett , Dietrich Kuske , Georg Zetzsche