相关论文: An algorithm for finding the Veech group of an ori…

Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…

We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…

We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

We explicitly construct a del Pezzo surface $X$ of degree 4 over a field $k$ such that $\operatorname{H}^1(k,\operatorname{Pic}\overline X)$ is isomorphic to $\mathbb{ZZ}/2\mathbb{Z}$ while $\operatorname{Br} X/\operatorname{Br} k$ is…

Inspired by the allure of additive fabrication, we pose the problem of origami design from a new perspective: how can we grow a folded surface in three dimensions from a seed so that it is guaranteed to be isometric to the plane? We solve…

Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph $H_{un}=H(V,E)$ by carrying out edge-detecting tests. In the given paper we focus our attention…

We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

Given a closed surface $S$ with finitely generated Veech group $G$ and its $\pi_1(S)$-extension $\Gamma$, there exists a hyperbolic space $\hat{E}$ on which $\Gamma$ acts isometrically and cocompactly. The space $\hat{E}$ is obtained by…

We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…

In this paper we are interested in the stratum H^{hyp}(4) of translation surfaces, which consists of pairs (M,\omega), where M is a hyper-elliptic Riemann surface of genus 3, and \omega is a holopmorphic 1-form on M having only one zero. We…

Segmentation is often an essential intermediate step in image analysis. A volume segmentation characterizes the underlying volume image in terms of geometric information--segments, faces between segments, curves in which several faces…

We define and study convolution of parabolic character sheaves. As an application we attach to any parabolic character sheaf the orbit of a tame local system on the maximal torus under a subgroup of the Weyl group.

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

Thin sheets can be assembled into tubular origami structures that combine deployability with pronounced anisotropic stiffness, enabling applications ranging from robotics to deployable systems. However, most existing tubular origami designs…

Multiplex is a set of graphs on the same vertex set, i.e. $\{G(V,E_1),\ldots,G(V,E_m)\}$. It is a generalized graph to model multiple relationships with parallel edges between vertices. This paper is a literature review of existing…

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

In this paper, we explicitly determine the automorphism group of every nonhyperelliptic superspecial curve of genus $4$ over $\mathbb{F}_{11}$. Our algorithm determining automorphism groups works for any nonhyperelliptic curves of genus $4$…