Related papers: Towards Efficient Normalizers of Primitive Groups

A method of quantizing parametrized systems is developed that is based on a kind of ``gauge invariant'' quantities---the so-called perennials (a perennial must also be an ``integral of motion''). The problem of time in its particular form…

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

A finite non-regular primitive permutation group $G$ is extremely primitive if a point stabiliser acts primitively on each of its nontrivial orbits. Such groups have been studied for almost a century, finding various applications. The…

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…

The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…

An algorithm based on Renormalization Group (RG) to analyze time series forecasting was proposed in cond-mat/0110285. In this paper we explicitly code and test it. We choose in particular some financial time series (stocks, indexes and…

We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

In this paper, we define normal soft int-groups and derive their some basic properties. We also investigate some relations on {\alpha}-inclusion, soft product and normal soft int-groups. Then we define normalizer, quotient group and give…

Let Omega be a quasisimple classical group in its natural representation over a finite vector space V, and let Delta be its normaliser in the general linear group. We construct the projection from Delta to Delta/Omega and provide fast,…

Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…

This thesis is concerned with continuous, static, and single-objective optimization problems subject to inequality constraints. Nevertheless, some methods to handle other kinds of problems are briefly reviewed. The particle swarm…

This paper presents algorithms for temporal parallelization of Bayesian smoothers. We define the elements and the operators to pose these problems as the solutions to all-prefix-sums operations for which efficient parallel scan-algorithms…

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…

We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…

Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

We consider the seriation problem, whose goal is to recover a hidden ordering from a noisy observation of a permuted Robinson matrix. We establish sharp minimax rates under average-Lipschitz conditions that strictly extend the bi-Lipschitz…