Related papers: Termination orders for 3-polygraphs
This article deals with 3-forms on 6-dimensional manifodls, the first dimension where the classification of 3-forms is not trivial. There are three classes of multisymplectic 3-forms there. We study the class which is closely related to…
We present a deterministic polynomial-time algorithm that solves the 3-satisfiability problem.
In this article, we propose a finite volume limiter function for a reconstruction on the three-point stencil. Compared to classical limiter functions in the MUSCL framework, which yield $2^{\text{nd}}$-order accuracy, the new limiter is…
We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni's polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of…
We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
The algorithm checks the propositional formulas for patterns of unsatisfiability.
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
We give a short introduction to the theory of twisted Alexander polynomials of a 3--manifold associated to a representation of its fundamental group. We summarize their formal properties and we explain their relationship to twisted…
In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.
We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line…
The purpose of this note is to start the systematic analysis of cofinal types of topological groups.
In this paper, we introduce a partial order on neighborhood equivalence classes of maximally spread essential multibranched surfaces embedded in a 3-manifold. We show that if a maximally spread essential multibranched surface is atoroidal…
We continue the study of exponent-cancellation for finite ordered sets. It is known that $A$ can be reconstructed from $A^{A}$, from $(A^{A})^{A}$, and from $A^{A^{A}}$. In this note we prove the next result in this hierarchy: the ordered…
We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…