Related papers: Deciding reducibility of mapping classes is in $\t…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
This paper completely determines the non-amenability of the mapping class groups of infinite-type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non-amenable stabiliser of a point…
The joint optimization of the reconstruction and classification error is a hard non convex problem, especially when a non linear mapping is utilized. In order to overcome this obstacle, a novel optimization strategy is proposed, in which a…
Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…
Classification of curves in a projective space occupies minds of many mathematicians. First step in doing so is classification of curves on a given surface. This brings us to consideration of the nonsingular Del Pezzo Surface in $P^4_k.$ We…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…
To any metric spaces there is an associated metric profile. The rectifiability of the metric profile gives a good notion of curvature of a sub-Riemannian space. We shall say that a curvature class is the rectifiability class of the metric…
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…
We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…
Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this approach for a class of selection problems. The aim is to choose…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
In this paper, an algorithm is developed to solve a multilevel mono-objective linear programming problem (ML(MO)LPP), where the constructive adaptive method of linear programming is nested. This procedure is the modified version of the SB.…
An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
We study the computational power of machines that specify their own acceptance types, and show that they accept exactly the languages that $\manyonesharp$-reduce to NP sets. A natural variant accepts exactly the languages that…
A MapReduce algorithm can be described by a mapping schema, which assigns inputs to a set of reducers, such that for each required output there exists a reducer that receives all the inputs that participate in the computation of this…