Related papers: An algorithm for counting number of all (normal) f…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
We consider the problem of computing approximate solution of Poisson equation in the low-parametric tensor formats. We propose a new algorithm to compute the solution based on the cross approximation algorithm in the frequency space, and it…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…
In the paper, we show that quantum logic of linear subspaces can be used for recognition of random signals by a Bayesian energy discriminant classifier. The energy distribution on linear subspaces is described by the correlation matrix of…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
The fuzzy or soft $k$-means objective is a popular generalization of the well-known $k$-means problem, extending the clustering capability of the $k$-means to datasets that are uncertain, vague, and otherwise hard to cluster. In this paper,…
We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and…
The nature of an atom in a bonded structure -- such as in molecules, in nanoparticles or solids, at surfaces or interfaces -- depends on its local atomic environment. In atomic-scale modeling and simulation, identifying groups of atoms with…
Fuzzy clustering, which allows an article to belong to multiple clusters with soft membership degrees, plays a vital role in analyzing publication data. This problem can be formulated as a constrained optimization model, where the goal is…
A non-quantitative version of the Freiman-Ruzsa theorem is obtained for finite stable sets with small tripling in arbitrary groups, as well as for (finite) weakly normal subsets in abelian groups.
An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…
The "all-or-nothing" clause evaluation strategy is a core mechanism in the Tsetlin Machine (TM) family of algorithms. In this approach, each clause - a logical pattern composed of binary literals mapped to input data - is disqualified from…
A fuzzy clustering algorithm for multidimensional data is proposed in this article. The data is described by vectors whose components are linguistic variables defined in an ordinal scale. The obtained results confirm the efficiency of the…
The theory of fuzzy mathematics has been proven very effective for defining and solving optimization problems. Fuzzy quadratic programming (FQP) is a consequence of this approach. In this paper, an algorithm has been proposed to solve FQP…
We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…