Related papers: An algorithm for counting number of all (normal) f…
We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…
We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
This paper suggests an effective method for facial recognition using fuzzy theory and Shannon entropy. Combination of fuzzy theory and Shannon entropy eliminates the complication of other methods. Shannon entropy calculates the ratio of an…
Aiming at the group decision - making problem with multi - objective attributes, this study proposes a group decision - making system that integrates fuzzy inference and Bayesian network. A fuzzy rule base is constructed by combining…
Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy…
Given a recurrent sequence ${\bf U}:=\{U_n\}_{n\ge 0}$ we consider the problem of counting ${\mathcal M}_U(x)$, the number of integers $n\le x$ such that $U_n=u^2+nv^2$ for some integers $u,v$. We will show that ${\mathcal M}_U(x)\ll x(\log…
We present a uniform approach to the construction of the groups of type $\mathrm{E}_6$ over arbitrary fields without using Lie theory. This gives a simple description of the group generators and some of the subgroup structure. In the finite…
We present a new distributed fuzzy partitioning method to reduce the complexity of multi-way fuzzy decision trees in Big Data classification problems. The proposed algorithm builds a fixed number of fuzzy sets for all variables and adjusts…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
Counting the frequency of small subgraphs is a fundamental technique in network analysis across various domains, most notably in bioinformatics and social networks. The special case of triangle counting has received much attention. Getting…
The paper focuses on mining patterns that are characterized by a fuzzy lagged relationship between the data objects forming them. Such a regulatory mechanism is quite common in real life settings. It appears in a variety of fields: finance,…
We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
We study the classic problem of subgraph counting, where we wish to determine the number of occurrences of a fixed pattern graph $H$ in an input graph $G$ of $n$ vertices. Our focus is on bounded degeneracy inputs, a rich family of graph…
This paper introduces a novel and general algorithm for approximately counting the number of orbits under group actions. The method is based on combining the Burnside process and importance sampling. Specializing to unitriangular groups…
Subdivergences constitute a major obstacle to the evaluation of Feynman integrals and an expression in terms of finite quantities can be a considerable advantage for both analytic and numeric calculations. We report on our implementation of…
We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.
The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of…