Related papers: An algorithm for finding the Veech group of an ori…

We classify the Rauzy-Veech groups of all connected components of all strata of the moduli space of translation surfaces in absolute homology, showing, in particular, that they are commensurable to arithmetic lattices of symplectic groups.…

In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are isomorphic, finding an isomorphism if they are. This algorithm…

We study constructing an algebraic curve from a Riemann surface given via a translation surface, which is a collection of finitely many polygons in the plane with sides identified by translation. We use the theory of discrete Riemann…

For each closed orientable surface we introduce a simplical complex with some additional structure which is a version of the complex of curves of this surface adjusted to investigation of its Torelli group. We call this complex the Torelli…

Approximate subgraph matching, which is an important primitive for many applications like question answering, community detection, and motif discovery, often involves large labeled graphs such as knowledge graphs, social networks, and…

We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…

We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…

In this paper the authors find examples of translation surfaces that have infinitely generated Veech groups, satisfy the topological dichotomy property that for every direction either the flow in that direction is completely periodic or…

To accelerate the algorithms for the dihedral hidden subgroup problem, we present a new algorithm based on algorithm SV(shortest vector). A subroutine is given to get a transition quantum state by constructing a phase filter function, then…

The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…

Let $G$ be a finite group and $\mathrm{Irr}(G)$ the set of all irreducible complex characters of $G$. Define the codegree of $\chi \in \mathrm{Irr}(G)$ as $\mathrm{cod}(\chi):=\frac{|G:\mathrm{ker}(\chi) |}{\chi(1)}$ and denote by…

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

In this note, we exploit the arithmeticity criterion of Benoist--Miquel to exhibit an origami in the principal stratum of the moduli space of translation surfaces of genus three whose Kontsevich--Zorich monodromy is not thin in the sense of…

We study the outer automorphism group of a right-angled Artin group $A_\Gamma$ with finite defining graph $\Gamma$. We construct a subnormal series for $Out(A_\Gamma)$ such that each consecutive quotient is either finite, free-abelian,…

We give explicit pseudo-Anosov homeomorphisms with vanishing Sah-Arnoux-Fathi invariant. Any translation surface whose Veech group is commensurable to any of a large class of triangle groups is shown to have an affine pseudo-Anosov…

We present an algorithm for computing equations of canonically embedded Riemann surfaces with automorphisms. A variant of this algorithm with many heuristic improvements is used to produce equations of Riemann surfaces $X$ with large…

The paper investigates a significant part of the automorphic, in fact of the so-called Eisenstein cohomology of split odd orthogonal groups over Q. The main result provides a description of residual and regular Eisenstein cohomology classes…

A semiring scheme generalizes a scheme in such a way that the underlying algebra is that of semirings. We generalize \v{C}ech cohomology theory and invertible sheaves to semiring schemes. In particular, when $X=\mathbb{P}^n_M$, a projective…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…