相关论文: A new approach to the grammic monoid

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…

We study the subgroup structure of the semigroup of finitary tropical matrices under multiplication. We show that every maximal subgroup is isomorphic to the full linear automorphism group of a related tropical polytope, and that each of…

We investigate the expressive power of first-order quantifications in the context of monadic second-order logic over pictures. We show that k+1 set quantifier alternations allow to define a picture language that cannot be defined using k…

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…

Given a crystallographic reduced root system and an element v of the lattice generated by the roots we study the minimum number |v|, called the length of v, of roots needed to express v as sum of roots. This number is related to the linear…

In this note, we give a characterisation in terms of identities of the join of $\mathbf{V}$ with the variety of finite locally trivial semigroups $\mathbf{LI}$ for several well-known varieties of finite monoids $\mathbf{V}$ by using…

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to $n \times n$ alternating sign matrices when…

Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set $(P, \leq_P)$ by setting $u \leq_P w$ if there is a subword $v$ of $w$ of the same length as $u$ such that…

Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…

In this paper we prove that rank metric codes with special properties imply the existence of $q$-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a $[2d,d,d]$ dually almost MRD code $C\leq…

Let $G$ be a connected reductive algebraic group over an algebraically closed field $k$ of characteristic $p > 0$ and let $\ell$ be a prime number different from $p$. Let $U \subseteq G$ be a maximal unipotent subgroup, $T$ a maximal torus…

Let $G$ be a finite $p$-solvable group, where $p$ is an odd prime. We establish a connection between extendible irreducible characters of subgroups of $G$ that lie under monomial characters of $G$ and nilpotent subgroups of $G$. We also…

If $m \in \mathbb{N}$ and $A$ is a finite subset of $\bigcup_{k \in \mathbb{N} \setminus \{0,1\}} \{1,\ldots,m-1\}^k$, then we denote by \begin{align*} \mathscr{C}(m,A) = \left\{S\in \mathscr{S}_m \mid s_1+\cdots+s_k-m \in S \mbox{ if }…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

In this paper we study the structure of the monoid $\mathbf{I}\mathbb{N}_{\infty}^n$ of cofinite partial isometries of the $n$-th power of the set of positive integers $\mathbb{N}$ with the usual metric for a positive integer $n\geqslant…

We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…

Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the…