English
Related papers

Related papers: On the Complexity of Properties of Partial Bijecti…

200 papers

In this article, we investigate some relations between dynamical and algebraic properties of semigroups of entire maps with applications to semigroups of formal series. We show that two entire maps fixing the origin share the set of…

Dynamical Systems · Mathematics 2024-08-12 C. Cabrera , P. Dominguez , P. Makienko

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

Rings and Algebras · Mathematics 2025-06-26 Marina Anagnostopoulou-Merkouri , Reinis Cirpons , James D. Mitchell , Maria Tsalakou

A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…

Representation Theory · Mathematics 2011-10-10 Karl-Hermann Neeb , Christoph Zellner

In this paper, we study extremal problems for coefficient functionals associated with a distinguished subclass of holomorphic semigroup generators, denoted by $\mathcal{A}_{\beta}$ ($0 \le \beta \le 1$), defined on the unit disk…

Complex Variables · Mathematics 2026-04-29 Sanju Mandal , Molla Basir Ahamed

Given any quasi-countable, in particular any countable inverse semigroup $S$, we introduce a way to equip $S$ with a proper and right subinvariant extended metric. This generalizes the notion of proper, right invariant metrics for discrete…

Operator Algebras · Mathematics 2024-03-01 Yeong Chyuan Chung , Diego Martínez , Nóra Szakács

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Group Theory · Mathematics 2016-05-18 Michael Giudici , Bojan Kuzma

Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…

Combinatorics · Mathematics 2017-10-17 Tomer Bauer , Be'eri Greenfeld

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…

Logic in Computer Science · Computer Science 2015-07-01 George Metcalfe , Christoph Röthlisberger

This paper considers discrete and continuous semigroups of (weighted) composition operators on the Fock space. For discrete semigroups consisting of powers of a single operator, the asymptotic behaviour of the semigroups is analysed. For…

Functional Analysis · Mathematics 2022-06-02 I. Chalendar , J. R. Partington

In an earlier work, the author observed that Boolean inverse semi-groups, with semigroup homomorphisms preserving finite orthogonal joins, form a congruence-permutable variety of algebras, called biases. We give a full description of…

Group Theory · Mathematics 2016-10-25 Friedrich Wehrung

A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…

Discrete Mathematics · Computer Science 2018-11-13 Vadim E. Levit , David Tankus

The symmetric inverse semigroup $I(X)$ on a set $X$ is the collection of all partial bijections between subsets of $X$ with composition as the algebraic operation. We study a minimal Hausdorff inverse semigroup topologies on $I(X)$. When…

General Topology · Mathematics 2020-12-08 J. Perez , C. Uzcategui

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

Group Theory · Mathematics 2020-09-07 Mara Hashuga , Megan Herbine , Alathea Jensen

This paper is focused on numerical semigroups and presents a simple construction, that we call dilatation, which, from a starting semigroup $S$, permits to get an infinite family of semigroups which share several properties with $S$. The…

Commutative Algebra · Mathematics 2017-10-23 Valentina Barucci , Francesco Strazzanti

This paper investigates the interplay between algebraic structure, topology, and differentiability in Clifford semigroups. The study is developed along three main themes. First, in the compact Hausdorff setting, we provide an explicit…

General Topology · Mathematics 2026-04-28 Stefano Bonzio , Andrea Loi , Giuseppe Zecchini

We study the connection between amenability, F{\o}lner conditions and the geometry of finitely generated semigroups. Using results of Klawe, we show that within an extremely broad class of semigroups (encompassing all groups, left…

Group Theory · Mathematics 2015-05-25 Robert D. Gray , Mark Kambites

For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…

Combinatorics · Mathematics 2017-12-27 Maria Bras-Amorós , Julio Fernández-González

This paper provides a complete characterization of quasicontractive groups and analytic $C_0$-semigroups on Hardy and Dirichlet space on the unit disc with a prescribed generator of the form $Af=Gf'$. In the analytic case we also give a…

Functional Analysis · Mathematics 2016-01-13 C. Avicou , I. Chalendar , J. R. Partington

Let B be a p-block of the finite group G. We observe that the p-fusion of G constrains the module structure of B: Any basis of B that is invariant under the left and right multiplications of a chosen Sylow p-subgroup S of G must in fact…

Group Theory · Mathematics 2018-04-24 Matthew Gelvin

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget
‹ Prev 1 4 5 6 7 8 10 Next ›