Related papers: Comparing Gr\"obner bases and word reversing
In this paper we prove that every recursively presented Lie algebra over a field which is a finite extention of its simple subfield can be embedded in a recursively presented Lie algebra defined by relations which are equalities of…
Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…
Solving inverse problems requires the knowledge of the forward operator, but accurate models can be computationally expensive and hence cheaper variants that do not compromise the reconstruction quality are desired. This chapter reviews…
Relating formal grammars is a hard problem that balances between language equivalence (which is known to be undecidable) and grammar identity (which is trivial). In this paper, we investigate several milestones between those two extremes…
Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
In reverse mathematics, is is possible to have a curious situation where we know that an implication does not reverse, but appear to have no information on on how to weaken the assumption while preserving the conclusion. A main cause of…
By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.
This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…
Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…
Shuffle operads were introduced to forget the symmetric group actions on symmetric operads while preserving all possible operadic compositions. Rewriting methods were then applied to symmetric operads via shuffle operads: in particular, a…
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…
A belief base revision is developed. The belief base is represented using Unified Answer Set Programs which is capable of representing imprecise and uncertain information and perform nonomonotonic reasoning with them. The base revision…
This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.
While an explicit basis is common in the study of Euclidean spaces, it is usually implied in the study of inertial relativistic systems. There are some conceptual advantages to including the basis in the study of special relativistic…
Let $K$ be a field and $R=\oplus_{p\in\mathbb{N}}R_p$ an $\mathbb{N}$-graded $K$-algebra, which has an SM $K$-basis (i.e. a skew multiplicative $K$-basis) such that $R$ holds a Gr\"obner basis theory. It is proved that there is a one-to-one…
In this expository style of writing I will give an introduction of Gr\"{o}bner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine…