Testing isomorphism of circulant objects in polynomial time

12/15/2018
by   Mikhail Muzychuk, et al.
0

Let K be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that the isomorphism of any two objects X,Y∈ K can be tested in polynomial time in sizes of X and Y.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2019

Two-closure of supersolvable permutation group in polynomial time

The 2-closure G of a permutation group G on Ω is defined to be the large...
research
02/01/2018

A group law for PKC purposes

Let F be a field, let V=F^3, and let A V→ V a linear map. The polynomial...
research
04/16/2020

A polynomial time algorithm for solving the closest vector problem in zonotopal lattices

In this note we give a polynomial time algorithm for solving the closest...
research
02/14/2021

Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time

We consider combinatorial semi-bandits with uncorrelated Gaussian reward...
research
05/12/2023

Reconfiguration of Time-Respecting Arborescences

An arborescence, which is a directed analogue of a spanning tree in an u...
research
05/27/2022

Ranking Binary Unlabelled Necklaces in Polynomial Time

Unlabelled Necklaces are an equivalence class of cyclic words under both...
research
06/27/2020

On Dualization over Distributive Lattices

Given a partially order set (poset) P, and a pair of families of ideals ...

Please sign up or login with your details

Forgot password? Click here to reset