Related papers: Termination orders for 3-polygraphs

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…

We explore the existence of a class of generalised Laplace maps for third order partial differential operators of the form…

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.

Explicit relations of matrices for two-dimensional finite element method with third-order triangular elements are given. They are more simple than relations presented in other works and could be easily implemented in new algorithms for both…

The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.

In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficient conditions on a partial cyclic order to be totally…

The degeneration order of simultaneous similarity classes of $3\times 3$ nilpotent matrix tuples is determined, and is shown to be given by rank conditions.

This document describes algorithms for generating general Morton and Hilbert orderings for three-dimensional data volumes.

In this paper we consider successive iterations of the first-order differential operations in space ${\bf R}^3.$

We study a class of 3-dimensional paracontact metric manifolds and we revise some of the results obtain in \cite{SS}.

This is a revised version (replacing an older one) with typos fixed and the introduction expanded.

In this article, we mainly give the strictly copositive conditions of a special class of third order three dimensional symmetric tensors. More specifically, by means of the polynomial decomposition method, the analytic sufficient and…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

Binet formulae for three versions of third-order Pell polynomials are derived.

Article describes a class of efficient algorithms for 3SAT and their generalizations on SAT.

We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.

In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…

In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…