Related papers: An algorithm for counting number of all (normal) f…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
We calculate zeta and normal zeta functions of space groups with the point group isomorphic to the cyclic group of order 2. The obtained results are applied to determine the number of subgroups, resp. normal subgroups, of a given index for…
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
Let $\Gamma$ be a Schottky semigroup in $\mathrm{SL}_2(\mathbf{Z})$, and for $q\in \mathbf N$, let $\Gamma(q):=\{\gamma\in \Gamma: \gamma= e \text{ (mod $q$)}\}$ be its congruence subsemigroup of level $q$. We prove the following uniform…
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n, any m x 1 vector b, and any positive real number epsilon…
We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction.…
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…
To understand the structure of a network, it can be useful to break it down into its constituent pieces. This is the approach taken in a multitude of successful network analysis methods, such as motif analysis. These methods require one to…
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…
The notion of an $n$-ary group is a natural generalization of the notion of a group and has many applications in different branches. In this paper, the notion of (normal) fuzzy $n$-ary subgroup of an $n$-ary group is introduced and some…
Fuzzy structures such as fuzzy automata, fuzzy transition systems, weighted social networks and fuzzy interpretations in fuzzy description logics have been widely studied. For such structures, bisimulation is a natural notion for…
Fuzzy graph-based structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models, fuzzy social networks and fuzzy interpretations in fuzzy description logics are useful in various applications. Given two states,…
The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential…
This research concerns the estimation of latent linear or polychoric correlations from fuzzy frequency tables. Fuzzy counts are of particular interest to many disciplines including social and behavioral sciences, and are especially relevant…
In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…