Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9812097

Applications of Rewriting Systems and Groebner Bases to Computing Kan Extensions and Identities Among Relations

Anne Heyworth
View original source ↗Read source document ↗Export metadata ↓

Abstract

This thesis concentrates on the development and application of rewriting and Groebner basis methods to a range of combinatorial problems. Chapter Two contains the most important result, which is the application of Knuth-Bendix procedures to Kan extensions, showing how rewriting provides a useful method for attempting to solve a variety of combinatorial problems which can be phrased in terms of Kan extensions. Chapter Three shows that the standard Knuth-Bendix algorithm is step-for-step a special case of Buchberger's algorithm. The one-sided cases and higher dimensions are considered. Chapter Four relates rewrite systems, Groebner bases and automata. Automata which only accept irreducibles, and automata which output reduced forms are discussed for presentations of Kan extensions. Reduction machines for rewrite systems are identified with standard output automata and the reduction machines devised for algebras are expressed as Petri nets. Chapter Five uses the completion of a group rewriting system to algorithmically determine a contracting homotopy necessary in order to compute the set of generators for the module of identities among relations using the covering groupoid methods devised by Brown and Razak Salleh. Reducing the resulting set of submodule generators is identified as a Groebner basis problem. Algorithms are implemented in GAP3.

Explore related subjects

math.CT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anne Heyworth. 2000-03-22. Applications of Rewriting Systems and Groebner Bases to Computing Kan Extensions and Identities Among Relations. https://arxiv.org/abs/math/9812097

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Categorical Generalization of Counterpoint

We extend Mazzola's counterpoint model using category theory, generalizing from the category $\mathbf{Set}$ to an arbitrary topos other than $\mathbf{Set}$. This generalization suggests that counterpoint's essential structure depends on specific categorical conditions rather than classical set-theoretic reasoning. A key contribution is identifying sufficient requirements for a well-behaved counterpoint theory in a topos: some version of Zorn's Lemma (GJZL), and two-valuedness and split supports (NS). Within a topos, we introduce (weak) quasidichotomies alongside the classical notion of dichotomy. These structures capture varying degrees of oppositional structure between consonance and dissonance, with weak quasidichotomies preserving the non-Boolean flexibility essential to musical practice while quasidichotomies represent maximal opposition short of complete partition. We prove a generalized counterpoint theorem giving sufficient conditions for the existence of admitted successors. When the ambient topos turns non-zero successor objects into points, admitted succession can be iterated to form counterpoint paths, which may terminate at consonances with no admitted successor. The framework naturally accommodates counterpoint with sets instead of pure pitches, relaxing the ``yes/no'' character of classical consonance definitions and emphasizing context-dependence. Mazzola's model allows a Kuratowski closure operator induced by a polarity, which defines an internal topology enabling algebraic-topological analysis of counterpoint structure. We conclude by showing this construction generalizes to involutive morphisms. This categorical approach provides foundations for understanding both the historical evolution of contrapuntal practice and cross-cultural divergences in interval organization.

math.CT↗
arXiv2026

From 3-crossed modules to Gray-type 4-categories

In this paper, we investigate the relation between the category of 3-crossed modules and the category of Gray-type 4-groups. The notion of a 3-crossed module was first introduced by Arvasi \textit{et al.}, motivated by the question of what kind of algebraic structure completely encodes a homotopy 4-type. On the other hand, from the point of view that higher groups are equivalent to algebraic realizations of higher categories -- as exemplified by the relationship between 2-crossed modules and Gray 3-groups established by Sarikaya--Ulualan -- it had not been clear how the 3-crossed modules of Arvasi \textit{et al.} relate to any higher category. In our previous paper, we proposed a new definition of a 3-crossed module and observed that it admits a natural interpretation in terms of higher categories. In this paper, we make this interpretation precise: we introduce a 4-category, which reduces to a semistrict braided monoidal 2-category when restricted to a single object and a single 1-morphism, and prove that the category of our 3-crossed modules is equivalent to the category of Gray 4-groups, defined as single-object versions of this 4-category in which all morphisms are invertible. We therefore expect that these structures can correctly capture the topological nature of surface knots and higher-dimensional manifolds.

math.CT↗
arXiv2026

Observations on the variety of equationally linear Heyting semilattices

In previous work, we analysed a number of categorical properties, of interest in the context of Janelidze-Márki-Tholen semi-abelian categories, for the variety $\mathsf{HSLat}$ of Heyting semilattices. In this paper, we focus on the subvariety $\mathsf{ELHSLat}$ of equationally linear Heyting semilattices. Our main objective is to show that, unlike $\mathsf{HSLat}$, this category is algebraically coherent. We furthermore prove that it is neither locally algebraically cartesian closed nor cosmash associative.

math.CT↗