Related papers: A new method for recognising Suzuki groups
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…
This paper looks at the class of groups admitting normal forms for which the right multiplication by a group element is computed in linear time on a multi-tape Turing machine. We show that the groups $\mathbb{Z}_2 \wr \mathbb{Z}^2$,…
We report the development of a new pattern-recognition scheme for the off- lattice self-learning kinetic Monte Carlo (KMC) method that is simple and flex ible enough that it can be applied to all types of surfaces. In this scheme, to…
This paper introduces SANGO (Socially Aware Navigation through Grouped Obstacles), a novel method that ensures socially appropriate behavior by dynamically grouping obstacles and adhering to social norms. Using deep reinforcement learning,…
An exact, nonlocal, finite step-size algorithm for Monte Carlo simulation of theories with dynamical fermions is proposed. The algorithm is based on obtaining the new configuration U' from the old one U by solving the equation $ M(U') \eta…
This paper proposes a new method for solving Bayesian decision problems. The method consists of representing a Bayesian decision problem as a valuation-based system and applying a fusion algorithm for solving it. The fusion algorithm is a…
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
In the present work, a simple algorithm for stabilizing an unknown linear time-invariant system is proposed, assuming only that this system is stabilizable. The suggested algorithm is based on first performing a partial identification of…
We present a time-step targetting scheme to simulate real-time dynamics efficiently using the density matrix renormalization group (DMRG). The algorithm works on ladders and systems with interactions beyond nearest neighbors, in contrast to…
Grouping structures arise naturally in many statistical modeling problems. Several methods have been proposed for variable selection that respect grouping structure in variables. Examples include the group LASSO and several concave group…
We study the Veech group of an origami, i.e. of a translation surface, tessellated by parallelograms. We show that it is isomorphic to the image of a certain subgroup of Aut(F_2) in SL_2(Z) = Out^+(F_2). Based on this we present an…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
We reconstruct the Lagrangian of a left-right symmetric model with the gauge group $SU(2)_L\times SU(2)_R\times U(1)_Y \times \pi_4(SU(2)_L\times SU(2)_R\times U(1)_Y) $. The Higgs fields appear as gauge fields on discrete gauge group…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
This paper proposes a semidefinite programming based method for estimating moments of a stochastic hybrid system (SHS). For polynomial SHSs -- which consist of polynomial continuous vector fields, reset maps, and transition intensities --…
In order to develop systems capable of artificial evolution, we need to identify which systems can produce complex behavior. We present a novel classification method applicable to any class of deterministic discrete space and time dynamical…
In this work, a novel approach for the reliable and efficient numerical integration of the Kuramoto model on graphs is studied. For this purpose, the notion of order parameters is revisited for the classical Kuramoto model describing…
This article analyzes the periodic orbits of Syracuse dynamical systems in a novel algebraic setting: the commutative ring of graded $n$-adic integers. Within this context, this article introduces a dual-radix modular division algorithm for…
An algorithm that uses the cycle structure of the rows, or the columns, of a Latin square to compute its autotopy group is introduced. As a result, a bound for the size of the autotopy group is obtained. This bound is used to show that the…
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…