We study 4-dimensional homology cobordisms without 3-handles, showing that they interact nicely with Thurston geometries, character varieties, and instanton Heegaard Floer homologies. Using these, we derive obstructions to such cobordisms. As one example of these obstructions, generalize other recent results on the behavior knot under ribbon concordances. Finally, provide topological applicatio...

First we recall the layout recommended within a bibliography for a translation of a document. Then we explain why entries for translated works cannot be specified nicely if we use BibTEX. A solution is proposed for future implementation in MlBibTEX.

In this paper, we prove that the Birget-Rhodes expansion G̃R of a group G is not a semidirect product of a semilattice by a group but it can be nicely embedded into such a semidirect product.

The problem of teaching the notion of logical consequence is discussed, and a solution proposed. The essential idea is to make concrete the abstract notion of interpretation through computer programs. Constraint Logic Programming appears to meet this idea nicely.

Twin-width is a newly introduced graph width parameter that aims at generalizing wide range of “nicely structured” classes. In this work, we focus on obtaining good bounds twin-width $$\textbf{tww}(G)$$ for graphs G from number classic We prove the following: An important idea behind planar to use an embedding and sphere-cut decompositions obtain neighbourhood complexity.

The Transition System Miner, together with the Simple Log Filter and the Transition System Analyzer, is used to investigate the log used for the BPI Challenge 2012. Conclusions are drawn for the control-flow perspective, the date perspective, and the resource perspective, which shows the flexibility of the Miner. The results show that the process as captured in the event log is nicely structure...

Symbolic automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend classic automata to operate over infinite alphabets, such as the set of rational numbers. In this paper, we study the foundational problem of learning symbolic automata. We first present Λ∗, a symbolic automata extension of Angluin’s L∗ algorithm for learning regu...

a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.

A well-known security problem with MPOA is that cut-through connections generally bypasses firewall routers if there are any. None of the previously proposed approaches solved the problem properly. In this paper, we propose a novel firewalling scheme for MPOA that nicely fixes the security hole. Our firewalling scheme has three outstanding advantages that make it ideal for securing MPOA-based e...