English
Related papers

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

200 papers

An outer automorphism of a free group is geometric if it can be represented by a homeomorphism of a compact surface. Bestvina and Handel gave an algorithmic characterization of geometric irreducible outer automorphisms using relative train…

Group Theory · Mathematics 2024-01-26 Edgar A. Bering , Yulan Qing , Derrick R. Wigglesworth

We describe algorithms to represent and compute groups of Hecke characters. We make use of an id{\`e}lic point of view and obtain the whole family of such characters, including transcendental ones. We also show how to isolate the algebraic…

Symbolic Computation · Computer Science 2022-10-07 Pascal Molin , Aurel Page

We suggest a new algorithm to estimate representations of compact Lie groups from finite samples of their orbits. Different from other reported techniques, our method allows the retrieval of the precise representation type as a direct sum…

Optimization and Control · Mathematics 2025-09-23 Henrique Ennes , Raphaël Tinarrage

The present work deals with the formulation of a Virtual Element Method (VEM) for two dimensional structural problems. The contribution is split in two parts: in part I, the elastic problem is discussed, while in part II [3] the method is…

Numerical Analysis · Mathematics 2018-10-24 Edoardo Artioli , Lourenco Beirao da Veiga , Carlo Lovadina , Elio Sacco

In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the…

Formal Languages and Automata Theory · Computer Science 2014-02-19 Anthony Gasperin , Maurice Margenstern

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Combinatorics · Mathematics 2015-05-26 Egon Schulte , Gordon Ian Williams

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

Data Structures and Algorithms · Computer Science 2013-11-04 Chandra Chekuri , Anastasios Sidiropoulos

Though the uniformization theorem guarantees an equivalence of Riemann surfaces and smooth algebraic curves, moving between analytic and algebraic representations is inherently transcendental. Our analytic curves identify pairs of circles…

Geometric Topology · Mathematics 2024-01-26 Samantha Fairchild , Ángel David Ríos Ortiz

We determine explicitly the structure of the automorphism group of a parabolic Inoue surface. We also describe the quotients of the surface by typical cyclic subgroups of the automorphism group.

Algebraic Geometry · Mathematics 2009-04-01 A. Fujiki

We give upper bounds of the numbers of holomorphic sections of Veech holomorphic families of Riemann surfaces. The numbers depend only on the topological types of base Riemann surfaces and fibers. We also show a relation between types of…

Complex Variables · Mathematics 2012-11-16 Yoshihiko Shinomiya

In this paper, we present an algorithm for evaluating lexical similarity between a given language and several reference language clusters. As an input, we have a list of concepts and the corresponding translations in all considered…

Computation and Language · Computer Science 2025-04-10 Karol Mikula , Mariana Sarkociová Remešíková

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

Algebraic Geometry · Mathematics 2025-03-06 Sergei Kovalenko , Alexander Perepechko , Mikhail Zaidenberg

We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…

Algebraic Geometry · Mathematics 2007-05-23 Toshinori Oaku , Nobuki Takayama

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

Combinatorics · Mathematics 2016-11-10 Steven Schluchter

We study an example of a Teichmueller curve in the moduli space of algebraic curves of genus 2 coming from an origami S. It is particular in that its points admit the Klein four group as a subgroup of the automorphism group. We give an…

Algebraic Geometry · Mathematics 2008-05-14 Frank Herrlich , André Kappes , Gabriela Schmithüsen

Let $C$ be a smooth projective curve and $G$ a finite subgroup of $\mathrm{Aut}(C)^2\rtimes \mathbb Z_2$ whose action is \textit{mixed}, i.e.~there are elements in $G$ exchanging the two isotrivial fibrations of $C\times C$. Let…

Algebraic Geometry · Mathematics 2017-07-10 Nicola Cancian , Davide Frapporti

We give an algorithm which computes a presentation for a subgroup, denoted $\AM_{g,1,p}$, of the automorphism group of a free group. It is known that $\AM_{g,1,p}$ is isomorphic to the mapping-class group of an orientable genus-$g$ surface…

Group Theory · Mathematics 2011-01-04 Lluís Bacardit

A threefold isogenous to a product of curves $X$ is a quotient of a product of three compact Riemann surfaces of genus at least two by the free action of a finite group. In this paper we study these threefolds under the assumption that the…

Algebraic Geometry · Mathematics 2017-03-09 Davide Frapporti , Christian Gleissner

Recently, patch-wise contrastive learning is drawing attention for the image translation by exploring the semantic correspondence between the input and output images. To further explore the patch-wise topology for high-level semantic…

Computer Vision and Pattern Recognition · Computer Science 2024-02-21 Chanyong Jung , Gihyun Kwon , Jong Chul Ye

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

Combinatorics · Mathematics 2007-05-23 Aleksandr Golubchik
‹ Prev 1 4 5 6 7 8 10 Next ›