相关论文: A User's Guide to the Mapping Class Group: Once Pu…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…

In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…

Given a certain triangulation of a punctured surface with boundary, we construct a new triangulated surface without punctures which covers it. This new surface is naturally equipped with an action of a group of order two, and its quotient…

In this paper, we propose a novel parameterization method for genus-one and multiply connected genus-zero surfaces, called periodic conformal flattening. The conformal energy minimization technique is utilized to compute the desired…

This paper presents a method for computing two-dimensional constant mean curvature surfaces. The method in question uses the variational aspect of the problem to implement an efficient algorithm. In principle it is a flow like method in…

Let $\Sigma_{g,n}$ be an orientable surface of genus $g$ with $n$ punctures. We study actions of the mapping class group of $\Sigma_{g,n}$ via Hodge-theoretic and arithmetic techniques. We show that if $$\rho: \pi_1(\Sigma_{g,n})\to…

In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

A spatial surface is a compact surface embedded in the $3$-sphere. We assume that a spatial surface is oriented and that each connected component of a spatial surface is neither a disk nor without a boundary. A diagram of a spatial surface…

This work is devoted to solving the composite optimization problem with the mixture oracle: for the smooth part of the problem, we have access to the gradient, and for the non-smooth part, only the one-point zero-order oracle is available.…

It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…

Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a dichotomic search. This phase also allows the…

In this paper, we define and, then, we characterize constant angle spacelike and timelike surfaces in the three-dimensional Heisenberg group, equipped with a 1-parameter family of Lorentzian metrics. In particular, we give an explicit local…

This article first answers to questions about connectedness of a new family of graphs on unicellular maps. Answering these questions goes through a description of the mapping class group as surgeries on unicellular maps. We also show how…

For any unitary representation of an arbitrary Lie group I construct a moment mapping from the space of smooth vectors of the representation into the dual of the Lie algebra. This moment mapping is equivariant and smooth. For the space of…

A coloring of edges of a finite directed graph turns the graph into finite-state automaton. The synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton…

Many different tagsets are used in existing corpora; these tagsets vary according to the objectives of specific projects (which may be as far apart as robust parsing vs. spelling correction). In many situations, however, one would like to…

We propose a universal decomposition of unitary maps over a tensorial power of C^2, introducing the key concept of "phase maps", and investigate how this decomposition can be used to implement unitary maps directly in the measurement-based…