English
Related papers

Related papers: The isomorphism problem for reduced finitary power…

200 papers

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

Rings and Algebras · Mathematics 2019-04-10 P. Ara , J. Bosa , E. Pardo

In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…

Combinatorics · Mathematics 2026-01-13 Wilfried Imrich , Igor Klep , Daniel Smertnig

Formal power series come up in several areas such as formal language theory , algebraic and enumerative combinatorics, semigroup theory, number theory etc. This paper focuses on the set x R[[x]] consisting of formal power series with zero…

Rings and Algebras · Mathematics 2015-10-21 Edgar Enochs , Overtoun Jenda , Furuzan Ozbek

Let $A$ be a unital separable amenable \CA and $C$ be a unital \CA with certain infinite property. We show that two full monomorphisms $h_1, h_2: A\to C$ are approximately unitarily equivalent if and only if $[h_1]=[h_2]$ in $KL(A,C).$ Let…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

In this paper we obtain a complete characterization of reducing, invariant, and hyperinvariant subspaces for the completely non-unitary component of a power partial isometry. In particular, precise characterization of reducing, invariant,…

Functional Analysis · Mathematics 2025-05-06 Kritika Babbar , Amit Maji

We show how topological methods developed in a previous article can be applied to prove new results about topological and homological finiteness properties of monoids. A monoid presentation is called special if the right-hand side of each…

Group Theory · Mathematics 2024-04-29 Robert D. Gray , Benjamin Steinberg

Let $K$ be a finite group and let $G$ be a finite group acting on $K$ by automorphisms. In this paper we study two different but intimately related subjects: on the one side we classify all possible multiplicative and associative structures…

Quantum Algebra · Mathematics 2021-03-08 César Galindo , Ismael Gutiérrez , Bernardo Uribe

In this paper we study the isomonodromic deformations of systems of differential equations with poles of any order on the Riemann sphere as Hamiltonian flows on the product of co-adjoint orbits of the Takiff algebra (i.e. truncated current…

Algebraic Geometry · Mathematics 2022-12-13 Ilia Gaiur , Marta Mazzocco , Vladimir Rubtsov

In the recent progress [BE1], [M], [Z1] and [Z2], the well-known Jacobian conjecture ([BCW], [E]) has been reduced to a problem on HN (Hessian nilpotent) polynomials (the polynomials whose Hessian matrix are nilpotent) and their (deformed)…

Complex Variables · Mathematics 2009-02-02 Wenhua Zhao

Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…

Logic · Mathematics 2016-02-26 Manuel Bodirsky , Peter Jonsson , Trung Van Pham

Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both…

Computational Complexity · Computer Science 2026-05-06 Alberto Larrauri , Antoine Mottet , Stanislav Živný

We show four formulas for calculating the orders of finite reductive monoids with zero. As applications, these formulas are then used to calculate the orders of finite reductive monoids induced from the $F_q$-split $\J$-irreducible monoids…

Group Theory · Mathematics 2008-12-17 Zhuo Li , Zhenheng Li , You'an Cao

In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…

Logic · Mathematics 2020-12-11 Daniel Rogozin

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

Group Theory · Mathematics 2017-03-08 J. C. Birget

We provide explicit counterexamples to the so-called Complement Problem in every dimension $n\geq3$, i.e. pairs of non-isomorphic irreducible hypersurfaces $H_1, H_2\subset\mathbb{C}^{n}$ whose complements $\mathbb{C}^{n}\setminus H_1$ and…

Algebraic Geometry · Mathematics 2017-02-13 Pierre-Marie Poloni

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

Dynamical Systems · Mathematics 2015-09-01 Tullio Ceccherini-Silberstein , Michel Coornaert

Let $p$ be a prime $e$ be a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $m,n$, $1\le m,n\le q-1$, be integers. The monomial digraph $D= D(q;m,n)$ is defined as follows: the vertex set of…

Combinatorics · Mathematics 2018-07-31 Alex Kodess , Felix Lazebnik

We investigate quasisymmetric functions coming from combinatorial Hopf monoids. We show that these invariants arise naturally in Ehrhart theory, and that some of their specializations are Hilbert functions for relative simplicial complexes.…

Combinatorics · Mathematics 2016-04-04 Jacob White

We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…

Dynamical Systems · Mathematics 2014-12-02 Ethan Coven , Reem Yassawi

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur
‹ Prev 1 3 4 5 6 7 10 Next ›