相关论文: Numerical semigroups in a problem about economic i…

Let $S$ be a subsemigroup of a second countable locally compact group $G$, such that $S^{-1}S=G$. We consider the $C^*$-algebra $C^*_\delta(S)$ generated by the operators of translation by all elements of $S$ in $L^2(S)$. We show that this…

We analyze how numerical experiments regarding elections were conducted within the computational social choice literature (focusing on papers published in the IJCAI, AAAI, and AAMAS conferences). We analyze the sizes of the studied…

In this note we observe that the Frobenius number and therefore the conductor of a numerical semigroup can be obtained from the maximal socle degree of the quotient of the corresponding semigroup algebra by the ideal generated by the…

In 1990, Backelin showed that the number of numerical semigroups with Frobenius number $f$ approaches $C_i \cdot 2^{f/2}$ for constants $C_0$ and $C_1$ depending on the parity of $f$. In this paper, we generalize this result to semigroups…

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

In this paper we describe an algorithm visiting all numerical semigroups up to a given genus using a well suited representation. The interest of this algorithm is that it fits particularly well the architecture of modern computers allowing…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…

Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…

We introduce a ``Statistical Query Sampling'' model, in which the goal of an algorithm is to produce an element in a hidden set $Ssubseteqbit^n$ with reasonable probability. The algorithm gains information about $S$ through oracle calls…

Given a sample of size $N$, it is often useful to select a subsample of smaller size $n<N$ to be used for statistical estimation or learning. Such a data selection step is useful to reduce the requirements of data labeling and the…

In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…

We present a new algorithm to explore or count the numerical semigroups of a given genus which uses the unleaved version of the tree of numerical semigroups. In the unleaved tree there are no leaves rather than the ones at depth equal to…

We study the problem of contextual combinatorial semi-bandits, where input contexts are mapped into subsets of size $m$ of a collection of $K$ possible actions. In each round, the learner observes the realized reward of the predicted…

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

We study some aspects of the functor of parabolic induction within the context of reduced group C*-algebras and related operator algebras. We explain how Frobenius reciprocity fits naturally within the context of operator modules, and…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

While methods for measuring and correcting differential performance in risk prediction models have proliferated in recent years, most existing techniques can only be used to assess fairness across relatively large subgroups. The purpose of…