Related papers: When is a numerical semigroup a quotient?

Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this…

A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition…

We give an optimal necessary and sufficient condition for the quotient polynomial and remainder in the division algorithm to have positive coefficients.

We contruct a one-to-one correspondence between a subset of numerical semigroups with genus $g$ and $\gamma$ even gaps and the integer points of a rational polytope. In particular, we give an overview to apply this correspondence to try to…

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

A subset $A$ of a semigroup $S$ is called a $chain$ ($antichain$) if $xy\in\{x,y\}$ ($xy\notin\{x,y\}$) for any (distinct) elements $x,y\in S$. A semigroup $S$ is called ($anti$)$chain$-$finite$ if $S$ contains no infinite (anti)chains. We…

We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…

Given a semigroup $S$, a diagonal subsemigroup $\rho$ is defined to be a reflexive and compatible relation on $S$, i.e. a subsemigroup of the direct square $S\times S$ containing the diagonal $\{ (s,s)\colon s\in S\}$. When $S$ is finite,…

In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…

Let $X$ be a Banach space, and $T:[0,\infty)\rightarrow {\mathcal{L}}(X,X),$ the bounded linear operators on $X.$ A family $\{T(t)\}_{t\ge 0}\subseteq {% \mathcal{L}}(X,X)$ is called a one-parameter semigroup if $T(s+t)=T(s)T(t),$ and…

Let $\Omega$ be an operator semigroup with generator $A$ in a sequentially complete locally convex topological vector space $E$. For a semigroup with generator $A+D$, where $D$ is a bounded linear operator on $E$, two integral equations are…

Given two numerical semigroups $S$ and $T$ and a positive integer $d$, $S$ is said to be one over $d$ of $T$ if $S=\{s \in \mathbb{N} \ | \ ds \in T \}$ and in this case $T$ is called a $d$-fold of $S$. We prove that the minimal genus of…

A Hausdorff topological group $(G,\tau)$ is called an $s$-group and $\tau$ is called an $s$-topology if there is a set $S$ of sequences in $G$ such that $\tau$ is the finest Hausdorff group topology on $G$ in which every sequence of $S$…

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

In this paper we study the limit theory of numerical semigroups with two generators. We give a complete axiomatization in some cases.

Let $S$ be a right group. Then there exist two congruences $\sim$ and $\equiv$ on $S$ such that $S$ is the product of its quotient semigroups $S/{\sim}$ and $S/{\equiv}$, where $S/{\sim}$ is a group and $S/{\equiv}$ is a right zero…

A new criterion is given for a semigroup to be the semigroup of a valuation dominating an equicharacteristic local domain. The criterion is used to construct examples of well ordered subsemigroups of the positive rational numbers which are…

A subsemigroup S of a semigroup Q is a local left order in Q if, for every maximal subgroup H of Q, the intersection of S with H is a local left order in the sense of group theory. That is, every q in H can be written as a#b for some a,b in…

Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy.…

We introduce the new notion of quotient-saturation as a measure of the immensity of the quotient structure of a group. We present a sufficient condition for a finitely presented group to be quotient-saturated, and use it to deduce that…