Related papers: Mapping Class Factorization via Fatgraph Nielsen R…

Every surface bundle with genus $g$ fiber has a canonical Heegaard splitting of genus $2g+1$. We classify the mapping class groups of such Heegaard splittings in the case when the surface bundle has a sufficiently complicated monodromy map.

We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides…

While large margin classifiers are originally an outcome of an optimization framework, support vectors (SVs) can be obtained from geometric approaches. This article presents advances in the use of Gabriel graphs (GGs) in binary and…

Nonnegative matrix factorization (NMF) with group sparsity constraints is formulated as a probabilistic graphical model and, assuming some observed data have been generated by the model, a feasible variational Bayesian algorithm is derived…

In [Tohoku Math. J. 62 (2010), 45--53] the second author showed that, except for a few cases, the order $N$ of a cyclic group of self-homeomorphisms of a closed orientable topological surface $S_g$ of genus $g \geq 2$ determines the group…

In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…

This paper focuses on the classification of classes of topological equivalence of finite group actions on Riemann surfaces. By the Riemann-Hurwitz bound, there are just finitely many groups that act conformally on a closed orientable…

We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…

In the weakly supervised localization setting, supervision is given as an image-level label. We propose to employ an image classifier $f$ and to train a generative network $g$ that outputs, given the input image, a per-pixel weight map that…

There have been several attempts to develop Feature Selection (FS) algorithms capable of identifying features that are relevant in a dataset. Although in certain applications the FS algorithms can be seen to be successful, they have similar…

This paper considers a restriction to non-negative matrix factorization in which at least one matrix factor is stochastic. That is, the elements of the matrix factors are non-negative and the columns of one matrix factor sum to 1. This…

We classify compact Riemann surfaces of genus $g$, where $g-1$ is a prime $p$, which have a group of automorphisms of order $\rho(g-1)$ for some integer $\rho\ge 1$, and determine isogeny decompositions of the corresponding Jacobian…

We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…

Polytopic matrix factorization (PMF) is a recently introduced matrix decomposition method in which the data vectors are modeled as linear transformations of samples from a polytope. The successful recovery of the original factors in the…

The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal…

We compute the mapping class group orbits in the homotopy set of framings of a compact connected oriented surface with non-empty boundary. In the case $g > 1$ the computation is some modification of Johnson's results and certain arguments…

Various Non-negative Matrix factorization (NMF) based methods add new terms to the cost function to adapt the model to specific tasks, such as clustering, or to preserve some structural properties in the reduced space (e.g., local…

Let $S_{g,1,p}$ be an orientable surface of genus $g$ with one boundary component and $p$ punctures. Let $\mathcal{M}_{g,1,p}$ be the mapping-class group of $S_{g,1,p}$ relative to the boundary. We construct homomorphisms…

In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group $F_N=F(a_1,\dots,a_N)$ the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of $F_N$…

This document is a practical guide to computations using an automatic structure for the mapping class group of a once-punctured, oriented surface $S$. We describe a quadratic time algorithm for the word problem in this group, which can be…