Related papers: A note about words which coincide except in one po…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
The purpose of this note is to verify that the archimedean multiplicity one theorems shown for orthogonal groups (as well as general linear and unitary groups) in a previous paper of the authors remain valid for special orthogonal groups.…
We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
It is shown that harmonic functions on some subsets, subharmonic and coinciding everywhere outside of these sets, actually coincide everywhere.
This note corrects a technical error in the ACM Computing Surveys paper mentioned in the title. The flaw involved constructions for showing that timed automata with urgent locations have the same expressiveness as timed automata that allow…
We present a simple remark that assures that the invariant theory of certain real Lie groups coincides with that of the underlying affine, real algebraic groups. In particular, this result applies to the non-compact orthogonal or symplectic…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We exhibit combinatorial results on Christoffel words and binary balanced words that are motivated by their geometric interpretation as approximations of digital segments. We give a closed formula for counting the exact number of balanced…
We prove some statements of left- and right-continuous variants of generalized inverses of non-decreasing real functions.
Our published paper contains an incorrect statement of a result due to Artin and Zhang. This corrigendum gives the correct statement of their result and includes a new result that allows us to use their result to prove our main theorem.…
A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern…
This paper describes some experiments involving the automated theorem-proving program OTTER in the system TRC of illative combinatory logic. We show how OTTER can be steered to find a contradiction in an inconsistent variant of TRC, and…
We know that each effect algebra $E$ is isomorphic to $\pi(X)$ for some $E$-test spaces $(X,{\cal T})$.We describe when $\pi(x)\lor \pi(y)$ and $\pi(x)\land\pi(y)$ exists for $x,y\in{\cal E}(X,{\cal T})$. Moreover we give the formula for…
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
Composite theories are the algebraic equivalent of distributive laws. In this paper, we delve into the details of this correspondence and concretely show how to construct a composite theory from a distributive law and vice versa. Using term…
We explicitly fix a mistake in a preliminary statement of our previous paper on the conductor at a multiplanar singularity. The correction is not immediate and, though the mistake does not affect correctness of the subsequent results, the…
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
The performance of machine learning algorithms can be improved by combining the output of different systems. In this paper we apply this idea to the recognition of noun phrases.We generate different classifiers by using different…
The aim of this note is to give a detailed account of how symmetric operads can be constructed from planar (non-symmetric) operads, and to carefully spell out the algebraic interplay between these two notions. It is a companion note to the…
The paper shows that matching without replacement on propensity scores produces estimators that generally are inconsistent for the average treatment effect of the treated. To achieve consistency, practitioners must either assume that no…