Related papers: Deciding reducibility of mapping classes is in $\t…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that…
We review and extend the results of [1] that gives a condition for reducibility of quantum representations of mapping class groups constructed from Reshetikhin-Turaev type topological quantum field theories based on modular categories. This…
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionality. The best approaches to the identification of modular…
Let $S_{g,n}$ be an oriented surface of genus $g$ with $n$ punctures, where $2g-2+n>0$ and $n>0$. Any ideal triangulation of $S_{g,n}$ induces a global parametrization of the Teichm\"uller space $\mathcal{T}_{g,n}$ called the shearing…
As is well-known, a conformal class of a surface $M$ with boundary $\Gamma$ is determined by its DN map $\Lambda$. In the paper, the algorithm for determination of the $b$-period matrix $\mathbb{B}$ of the (Schottky) double of surface with…
We discuss a number of open problems about mapping class groups of surfaces. In particular, we discuss problems related to linearity, congruence subgroups, cohomology, pseudo-Anosov stretch factors, Torelli subgroups, and normal subgroups.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Let $C$ be an irreducible projective plane curve in the complex projective space ${\mathbb{P}}^2$. The classification of such curves, up to the action of the automorphism group $PGL(3,{\mathbb{C}})$ on ${\mathbb{P}}^2$, is a very difficult…
We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…
We prove that if $f\colon X\to Y$ is a closed surjective map between metric spaces such that every fiber $f^{-1}(y)$ belongs to a class of space $\mathrm S$, then there exists an $F_\sigma$-set $A\subset X$ such that $A\in\mathrm S$ and…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
Submodularity is one of the most well-studied properties of problem classes in combinatorial optimization and many applications of machine learning and data mining, with strong implications for guaranteed optimization. In this thesis, we…
Given a finite modular tensor category, we associate with each compact surface with boundary a cochain complex in such a way that the mapping class group of the surface acts projectively on its cohomology groups. In degree zero, this action…
We show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also…