English
Related papers

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

200 papers

Given a group G, we construct, in a canonical way, an inverse semigroup S(G) associated to G. The actions of S(G) are shown to be in one-to-one correspondence with the partial actions of G, both in the case of actions on a set, and that of…

funct-an · Mathematics 2008-02-03 Ruy Exel

In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…

Machine Learning · Computer Science 2023-06-06 Seyed A. Esmaeili , Brian Brubach , Leonidas Tsepenekas , John P. Dickerson

The aim of the present paper is to define and study a new class of groups, namely Wm-groups with a single binary operation based on axioms of semi commutativity, right identity and left inverse. Moreover, we introduce the notions of right…

General Mathematics · Mathematics 2019-11-12 Hariwan Z. Ibrahim , Muwafaq M. Salih

We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…

Rings and Algebras · Mathematics 2022-06-06 Becky Armstrong , Lisa Orloff Clark , Astrid an Huef , Malcolm Jones , Ying-Fen Lin

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

Logic · Mathematics 2023-07-26 Mark Carney

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

Combinatorics · Mathematics 2013-01-22 Abdallah Assi , Pedro A. García-Sánchez

A regular semigroup is weakly generated by a set X if it has no proper regular subsemigroups containing X. In this paper, we study the regular semigroups weakly generated by idempotents. We show there exists a regular semigroup FI(X) weakly…

Group Theory · Mathematics 2021-12-22 Luís Oliveira

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…

Commutative Algebra · Mathematics 2016-07-12 J. I. García-García , M. A. Moreno-Frías , A. Vigneron-Tenorio

A graph $G$ is {\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\it weakly semiregular number} of a graph $G$, denoted by $wr(G)$, is the minimum number of subsets into which…

Combinatorics · Mathematics 2017-01-24 Arash Ahadi , Ali Dehghan , Mohsen Mollahajiaghaei

Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…

Group Theory · Mathematics 2016-07-27 Zachary Mesyan , J. D. Mitchell

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

Combinatorics · Mathematics 2009-12-23 Victor Blanco , Pedro A. Garcia-Sanchez , Justo Puerto

For a subset $B$ of $\mathbb{R}$, denote by $\operatorname{U}(B)$ be the semiring of (univariate) polynomials in $\mathbb{R}[X]$ that are strictly positive on $B$. Let $\mathbb{N}[X]$ be the semiring of (univariate) polynomials with…

Rings and Algebras · Mathematics 2022-10-27 Ruiwen Dong

A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…

Group Theory · Mathematics 2007-05-23 Jonathan P. McCammond , Daniel T. Wise

In this paper we study the regular semigroups weakly generated by a single element x, that is, with no proper regular subsemigroup containing x. We show there exists a regular semigroup $F_1$ weakly generated by x such that all other…

Group Theory · Mathematics 2023-02-17 Luís Oliveira

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

Group Theory · Mathematics 2022-10-24 Francesco Fournier-Facio , Clara Loeh , Marco Moraschini

The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…

Classical Analysis and ODEs · Mathematics 2025-05-13 Rachel Greenfeld , Terence Tao

This paper studies automatic structures for subsemigroups of Baumslag--Solitar semigroups (that is, semigroups presented by $\ < x,y \mid (yx^m, x^ny)\ >$, where $m$ and $n$ are natural numbers). A geometric argument (a rarity in the field…

Group Theory · Mathematics 2015-10-21 Alan J. Cain

In this paper we study decidability and complexity of decision problems on matrices from the special linear group $\mathrm{SL}(2,\mathbb{Z})$. In particular, we study the freeness problem: given a finite set of matrices $G$ generating a…

Computational Complexity · Computer Science 2016-11-01 Sang-Ki Ko , Igor Potapov