10,707 research outputs found
A linear time algorithm for the orbit problem over cyclic groups
The orbit problem is at the heart of symmetry reduction methods for model
checking concurrent systems. It asks whether two given configurations in a
concurrent system (represented as finite strings over some finite alphabet) are
in the same orbit with respect to a given finite permutation group (represented
by their generators) acting on this set of configurations by permuting indices.
It is known that the problem is in general as hard as the graph isomorphism
problem, whose precise complexity (whether it is solvable in polynomial-time)
is a long-standing open problem. In this paper, we consider the restriction of
the orbit problem when the permutation group is cyclic (i.e. generated by a
single permutation), an important restriction of the problem. It is known that
this subproblem is solvable in polynomial-time. Our main result is a
linear-time algorithm for this subproblem.Comment: Accepted in Acta Informatica in Nov 201
Message Encoding for Spread and Orbit Codes
Spread codes and orbit codes are special families of constant dimension
subspace codes. These codes have been well-studied for their error correction
capability and transmission rate, but the question of how to encode messages
has not been investigated. In this work we show how the message space can be
chosen for a given code and how message en- and decoding can be done.Comment: Submitted to IEEE International Symposium on Information Theory 201
Orbit decidability, applications and variations
We present the notion of orbit decidability into a more general framework,
exploring interesting generalizations and variations of this algorithmic
problem. A recent theorem by Bogopolski-Martino-Ventura gave a renovated
protagonism to this notion and motivated several interesting algebraic
applications
Orbit decidability and the conjugacy problem for some extensions of groups
Given a short exact sequence of groups with certain conditions, 1 ? F ? G ? H ? 1, weprove that G has solvable conjugacy problem if and only if the corresponding action subgroupA 6 Aut(F) is orbit decidable. From this, we deduce that the conjugacy problem is solvable,among others, for all groups of the form Z2?Fm, F2?Fm, Fn?Z, and Zn?A Fm with virtually solvable action group A 6 GLn(Z). Also, we give an easy way of constructing groups of the form Z4?Fn and F3?Fn with unsolvable conjugacy problem. On the way, we solve the twisted conjugacy problem for virtually surface and virtually polycyclic groups, and give an example of a group with solvable conjugacy problem but unsolvable twisted conjugacy problem. As an application, an alternative solution to the conjugacy problem in Aut(F2) is given
On the algebraic Brauer classes on open degree four del Pezzo surfaces
We study the algebraic Brauer classes on open del Pezzo surfaces of degree
. I.e., on the complements of geometrically irreducible hyperplane sections
of del Pezzo surfaces of degree . We show that the -torsion part is
generated by classes of two different types. Moreover, there are two types of
-torsion classes. For each type, we discuss methods for the evaluation of
such a class at a rational point over a -adic field
Orbit decidability and the conjugacy problem for some extensions of groups
Given a short exact sequence of groups with certain conditions, , we prove that has solvable conjugacy problem if and only if
the corresponding action subgroup is orbit decidable. From
this, we deduce that the conjugacy problem is solvable, among others, for all
groups of the form , , , and with virtually solvable action
group . Also, we give an easy way of constructing
groups of the form and with
unsolvable conjugacy problem. On the way, we solve the twisted conjugacy
problem for virtually surface and virtually polycyclic groups, and give an
example of a group with solvable conjugacy problem but unsolvable twisted
conjugacy problem. As an application, an alternative solution to the conjugacy
problem in is given
Estimation under group actions: recovering orbits from invariants
Motivated by geometric problems in signal processing, computer vision, and
structural biology, we study a class of orbit recovery problems where we
observe very noisy copies of an unknown signal, each acted upon by a random
element of some group (such as Z/p or SO(3)). The goal is to recover the orbit
of the signal under the group action in the high-noise regime. This generalizes
problems of interest such as multi-reference alignment (MRA) and the
reconstruction problem in cryo-electron microscopy (cryo-EM). We obtain
matching lower and upper bounds on the sample complexity of these problems in
high generality, showing that the statistical difficulty is intricately
determined by the invariant theory of the underlying symmetry group.
In particular, we determine that for cryo-EM with noise variance
and uniform viewing directions, the number of samples required scales as
. We match this bound with a novel algorithm for ab initio
reconstruction in cryo-EM, based on invariant features of degree at most 3. We
further discuss how to recover multiple molecular structures from heterogeneous
cryo-EM samples.Comment: 54 pages. This version contains a number of new result
- …