中文
相关论文

相关论文: Termination orders for 3-polygraphs

200 篇论文

Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an $(r,s)$-canonical order, which unifies many of the existing variants of canonical…

计算几何 · 计算机科学 2015-11-04 Therese Biedl , Martin Derka

The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…

数值分析 · 数学 2013-09-24 Anuradha Singh , J. P. Jaiswa

A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…

离散数学 · 计算机科学 2021-05-11 Asahi Takaoka

The aim of this paper is to classify reduction types of algebraic curves. Reduction types capture the discrete invariants of fibres in one-dimensional families of curves, and they have been described in genus 1, 2 and 3. For fixed genus…

代数几何 · 数学 2025-12-11 Tim Dokchitser

It is well known that every compact oriented 3-manifold admits an ideal triangulation, and that any two such triangulations with at least two ideal tetrahedra are related by a sequence of Pachner $2$-$3$ moves. Motivated by constructions in…

几何拓扑 · 数学 2026-05-29 Stavros Garoufalidis , Rinat Kashaev , Sakie Suzuki

The Size-Change Termination principle was first introduced to study the termination of first-order functional programs. In this work, we show that it can also be used to study the termination of higher-order rewriting in a system of…

计算机科学中的逻辑 · 计算机科学 2018-12-06 Frédéric Blanqui , Guillaume Genestier

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

组合数学 · 数学 2022-05-02 Somnath Basu , Dhruv Bhasin , Siddhartha Lal , Siddhartha Patra

We report on enumerating the triangulations of cyclic polytopes with the new software mptopcom. This is relevant for its connection with higher Stasheff-Tamari orders, which occur in category theory and algebraic combinatorics.

组合数学 · 数学 2018-10-30 Michael Joswig , Lars Kastner

We establish a best-possible minimum codegree condition for the existence of a perfect tiling of a $3$-uniform hypergraph $H$ with copies of the generalised triangle $T$, which is the 3-uniform hypergraph with five vertices $a, b, c, d, e$…

组合数学 · 数学 2025-05-12 Candida Bowtell , Amarja Kathapurkar , Natasha Morrison , Richard Mycroft

We study analytic deformations of holomorphic foliations given by homogeneous integrable one-forms in the complex affine space $\mathbb C^n$. The deformation is supposed to be of first order (order one in the parameter). We also assume that…

代数几何 · 数学 2020-08-14 Ariel Molinuevo , Bruno Scárdua

We count number of groupoids of order 3 with some Bol-Moufang type identities.

群论 · 数学 2018-12-07 Vladimir Chernov , Alexander Moldovyan , Victor Shcherbacov

We present methods of constructing examples of quandles of order 3n, where n is greater or equal to 3. The necessary and sufficient conditions for the constructed examples to be (i) connected (ii) group (conjugate) (iii) involutory and (iv)…

群论 · 数学 2022-07-18 Abednego Orobosa Isere , Abraham O. Elakhe , Cletus Ugbolo

The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their…

离散数学 · 计算机科学 2013-06-11 Mark Korenblit , Vadim E. Levit

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

组合数学 · 数学 2019-03-22 Kohei Tanaka

We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…

离散数学 · 计算机科学 2018-06-28 Pavol Hell , Jing Huang , Ross M. McConnell , Arash Rafiey

In this paper we introduce a different kind of graph energy, the minimum 3-covering energy of a graph, and determine the minimum 3-covering energy of complete graphs.

组合数学 · 数学 2013-03-20 Paul August Winter

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

计算机科学中的逻辑 · 计算机科学 2008-12-18 Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

群论 · 数学 2014-03-20 Dale Rolfsen

This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…

代数拓扑 · 数学 2014-03-20 Dale Rolfsen

We study three types of order convergence and related concepts of order continuous maps in partially ordered sets, partially ordered abelian groups and partially ordered vector spaces, respectively. An order topology is introduced such that…

泛函分析 · 数学 2017-11-09 Till Hauser , Anke Kalauch