Related papers: Termination orders for 3-polygraphs

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

The class of intersection bigraphs of unit intervals of the real line whose ends may be open or closed is called a class of mixed unit interval bigraphs. This class of bigraphs is a strict superclass of the class of unit interval bigraphs.…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

This note mainly studies the generic finiteness of \phi_m of a complex projective 3-fold of general type. A new result on the classification to bicanonical pencil for Gorenstein 3-folds is attached in the last section.

We give a complete description of all order 1 invariants of planar curves.

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…

All complex $3$-dimensional nilalgebras were described. As a corollary, all degenerations in the variety of complex $3$-dimensional nilalgebras were obtained.

This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…

Let us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to \emph{tuples} of natural numbers and higher-order…

We compute the graded polynomial identities and its graded codimension sequence for the elementary gradings of the Lie algebra of upper triangular matrices of order 3.

Min-Max orderings correspond to conservative lattice polymorphisms. Digraphs with Min-Max orderings have polynomial time solvable minimum cost homomorphism problems. They can also be viewed as digraph analogues of proper interval graphs and…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

We improve upon a recent result of Culler and Dunfield on orderability of certain Dehn fillings by removing a difficult condition they required.

This article discuss a class of tractable model in the form of polynomial type.

A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.

A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…

We study the structure of the space $\Omega_3(G)$ of $\partial$-invariant 3-paths in a directed graph $G$. We prove that $\Omega_3(G)$ admits a basis consisting of trapezohedral paths $\tau_m$ ($m \ge 2$) and their merging images. Moreover,…

Higher-order rewriting is a framework in which one can write higher-order programs and study their properties. One such property is termination: the situation that for all inputs, the program eventually halts its execution and produces an…