English
Related papers

Related papers: The Realization Problem for Delta Sets of Numerica…

200 papers

For a positive integer $m$, a finite set of integers is said to be equidistributed modulo $m$ if the set contains an equal number of elements in each congruence class modulo $m$. In this paper, we consider the problem of determining when…

Number Theory · Mathematics 2022-05-23 Caleb McKinley Shor

For a graph $G=(V,E)$, a set $D \subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$, and every vertex in $D$ is within distance~$2$ of another vertex of~$D$. The \textsc{Minimum Semitotal Domination}…

Discrete Mathematics · Computer Science 2017-11-30 Michael A. Henning , Arti Pandey

Let $S$ be a semigroup and $\mathbb F$ be a field. For an ideal $J$ of the semigroup algebra ${\mathbb F}[S]$ of $S$ over $\mathbb F$, let $\varrho _J$ denote the restriction (to $S$) of the congruence on ${\mathbb F}[S]$ defined by the…

Rings and Algebras · Mathematics 2015-11-30 Attila Nagy , Márton Zubor

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

Rings and Algebras · Mathematics 2024-08-19 Salvatore Tringali

The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…

Computational Complexity · Computer Science 2019-02-01 Shaull Almagor , Joël Oukanine , James Worrell

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…

Discrete Mathematics · Computer Science 2022-12-15 Émile Naquin , Maximilien Gadouleau

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

Combinatorics · Mathematics 2026-04-29 Nathan Kaplan , Kaylee Kim , Cole McGeorge , Fabian Ramirez , Deepesh Singhal

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

We present a study of semigroup compactifications of a semitopological semigroup $S$ using certain filters on $S$. We characterize closed subsemigroups and closed left, right, and two-sided ideals in any semigroup compactification of any…

General Topology · Mathematics 2013-07-12 Tomi Alaste

Attached to a singular analytic curve germ in $d$-space is a numerical semigroup: a subset $S$ of the non-negative integers which is closed under addition and whose complement isfinite. Conversely, associated to any numerical semigroup $S$…

Algebraic Geometry · Mathematics 2024-03-06 Richard Montgomery

The \emph{domination subdivision number} sd$(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of $G$. It has been shown…

Combinatorics · Mathematics 2013-10-15 Magda Dettlaff , Joanna Raczek , Jerzy Topp

Given a graph $G = (V, E)$ and an integer $k$, the Minimum Membership Dominating Set problem asks to compute a set $S \subseteq V$ such that for each $v \in V$, $1 \leq |N[v] \cap S| \leq k$. The problem is known to be NP-complete even on…

Data Structures and Algorithms · Computer Science 2024-08-05 Sangam Balchandar Reddy , Anjeneya Swami Kare

Given a semigroup $S$ and an $n$-partition $\mathcal{P}$ of $S$, $n\in \mathbb{N}$, do there exist $A\in \mathcal{P}$ and a subset $F$ of $S$ such that $S=F ^{-1} \{x \in S: x A \bigcap A\neq\emptyset\}$ and $|F |\leq n$? We give an…

Combinatorics · Mathematics 2015-08-31 Igor Protasov , Ksenia Protasova

Let $\Omega$ be a finite set and $T(\Omega)$ be the full transformation monoid on $\Omega$. The rank of a transformation $t\in T(\Omega)$ is the natural number $|\Omega t|$. Given $A\subseteq T(\Omega)$, denote by $\langle A\rangle$ the…

Group Theory · Mathematics 2019-10-21 João Araújo , Wolfram Bentz , Peter J. Cameron

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

Combinatorics · Mathematics 2021-08-16 Stephan Ramon Garcia , Christopher O'Neill , Gabe Udell

In this paper we define a congruence $\eta^{\ast}$ on semigroups. For the finite semigroups $S$, $\eta^{\ast}$ is the smallest congruence relation such that $S/\eta^{\ast}$ is a nilpotent semigroup (in the sense of Malcev). In order to…

Group Theory · Mathematics 2016-07-06 M. H. Shahzamanian

Let $\mathcal S$ be a semigroup of partial isometries acting on a complex, infinite-dimensional, separable Hilbert space. In this paper we seek criteria which will guarantee that the selfadjoint semigroup $\mathcal T$ generated by $\mathcal…

Operator Algebras · Mathematics 2014-11-21 Janez Bernik , Laurent W. Marcoux , Alexey I. Popov , Heydar Radjavi

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…

Combinatorics · Mathematics 2025-05-06 Carmelo Cisto , Gioia Failla , Francesco Navarra

In this paper we show that if $I$ is an ideal of a commutative semigroup $C$ such that the separator $SepI$ of $I$ is not empty then the factor semigroup $S=C/P_I$ ($P_I$ is the principal congruence on $C$ defined by $I$) satisfies…

Group Theory · Mathematics 2015-09-01 Attila Nagy

For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…

Group Theory · Mathematics 2023-11-17 Sergey V. Gusev , Mikhail V. Volkov
‹ Prev 1 4 5 6 7 8 10 Next ›