Related papers: Towards Efficient Normalizers of Primitive Groups
I am showing how the ideas behind the renormalisation group can be generalised in order to produce the desired reduction in the degrees of freedom other that the ones considered up to now. Instead of looking only at the renormalisation…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
We enrich pregroups with a mapping which allows us to locally apply precyclic permutations to designated substrings. We prove a normalisation theorem for such algebraic structures and briefly formalise some known applications of pregroups…
This article aims at finding sufficient conditions for a family of meromorphic functions to be normal by involving partial sharing of sets with differential polynomials. Moreover, corresponding results for normal meromorphic functions are…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Given a planar differential system with a first integral, we show how to find a normalizer. For systems with a center, we give an integral formula for the derivative of its period function.
Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known technique designed for the specific problem in question while…
As we know that the normalization is a pre-processing stage of any type problem statement. Especially normalization takes important role in the field of soft computing, cloud computing etc. for manipulation of data like scale down or scale…
We consider the problem of discrete-time signal denoising, focusing on a specific family of non-linear convolution-type estimators. Each such estimator is associated with a time-invariant filter which is obtained adaptively, by solving a…
A new method, called the method of self-similar approximants, and its recent developments are described. The method is based on the ideas of renormalization group theory and optimal control theory. It allows for the effective extrapolation…
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
This paper is the first in a series devoted to the development of a rigorous renormalisation group method for lattice field theories involving boson fields, fermion fields, or both. Our immediate motivation is a specific model, involving…
In this note, a necessary and sufficient condition for the normalizer of a core-free subgroup $H$ of a finite group $G$ to be normal in $G$ is obtained. Also, a known result of finite groups is obtained through transversal.
In this paper, we present an improved methodology to compute $\omega$-invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a…
In this article, I give a pedagogical introduction and overview of percolation theory. Special emphasis will be put on the review of some of the most prominent of the algorithms that have been devised to study percolation numerically. At…
We describe the Density Matrix Renormalization Group algorithms for time dependent and time independent Hamiltonians. This paper is a brief but comprehensive introduction to the subject for anyone willing to enter in the field or write the…