Related papers: A new method for recognising Suzuki groups
The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begin with, by exploring structural observability of large-scale…
An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian-matrix combined with hierarchical-clustering techniques, and…
We construct a polynomial-time algorithm which given a graph $\Gamma$ finds the full set of non-equivalent Cayley representations of $\Gamma$ over the group $D\cong C_p\times C_{p^k}$, where $p\in\{2,3\}$ and $k\geq 1$. This result implies…
This document is a practical guide to computations using an automatic structure for the mapping class group of a once-punctured, oriented surface $S$. We describe a quadratic time algorithm for the word problem in this group, which can be…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…
Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of stochastic search approaches can be cast into the framework of Las Vegas Algorithms (LVAs). As the run-time…
Online system identification algorithms are widely used for monitoring, diagnostics and control by continuously adapting to time-varying dynamics. Typically, these algorithms consider a model structure that lacks parsimony and offers…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…
We review a family of local algorithms that permit the simulation of charged particles with purely local dynamics. Molecular dynamics formulations lead to discretizations similar to those of ``particle in cell'' methods in plasma physics.…
Improved algorithms for computing (partial and full) exterior algebraic shifts of hypergraphs and simplicial complexes are presented. The main benefit is in positive characteristic. Experiments with an implementation in OSCAR with various…
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…
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set of generators for semigroup S are equal in the semigroup if…
Hyperbolic Julia sets of complex polynomials are known to be computable in polynomial time due to pioneering work of Braverman in 2005 (10.1016/j.entcs.2004.06.031). In this paper, we present an alternative method for establishing poly-time…
Among the infinite classes of finite simple groups, the most exotic classes are probably the Suzuki groups and the Ree groups. They are "twisted versions" of groups of Lie type, but they cannot be directly obtained as groups of rational…
We have proposed new algorithms for the numerical integration of the equations of motion for classical spin systems. In close analogy to symplectic integrators for Hamiltonian equations of motion used in Molecular Dynamics these algorithms…
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the solution must be obtained on-line, thus the time required to solve…
For any positive integer $N$, we describe a natural complex representation of the symmetric group $\Sigma_N$ on the vector space spanned by its involutions that contains each irreducible representation exactly once.
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…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…