Related papers: Standard Lyndon loop words: weighted orders
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the…
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
Motivated by the novel applications of the mathematical formalism of quantum theory and its generalizations in cognitive science, psychology, social and political sciences, and economics, we extend the notion of the tensor product and…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
We introduce a generalization, called a skew Clifford algebra, of a Clifford algebra, and relate these new algebras to the notion of graded skew Clifford algebra that was defined in 2010. In particular, we examine homogenizations of skew…
We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with…
We introduce generalizations of powers and factor complexity via orbits of group actions. These generalizations include concepts like abelian powers and abelian complexity. It is shown that this notion of factor complexity cannot be used to…
We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin's L* algorithm, that learns an automaton from a minimally adequate teacher. This…
The loop algebra construction by Allison, Berman, Faulkner, and Pianzola, describes graded-central-simple algebras with split centroid in terms of central simple algebras graded by a quotient of the original grading group. Here the…
We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…
We consider the problem of proving termination for triangular weakly non-linear loops (twn-loops) over some ring $\mathcal{S}$ like $\mathbb{Z}$, $\mathbb{Q}$, or $\mathbb{R}$. The guard of such a loop is an arbitrary quantifier-free…
We construct a basis for a modified quantum group of finite type, extending the PBW bases of positive and negative halves of a quantum group. Generalizing Lusztig's classic results on PBW bases, we show that this basis is orthogonal with…
Word embeddings are effective intermediate representations for capturing semantic regularities between words, when learning the representations of text sequences. We propose to view text classification as a label-word joint embedding…
In this paper, we find a more straightforward problem that is equivalent to one of the major challenges in knot theory: the classification of links in the 3-sphere. More precisely, we provide a simpler braid description for all links in the…
If the Lie group of a non-Abelian theory is replaced by the corresponding q-group, one is led to replace the Lie algebra by two dual algebras. The first of these lies close to the Lie algebra that it is replacing while the second introduces…
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon…
Matrix elements between nonorthogonal Slater determinants represent an essential component of many emerging electronic structure methods. However, evaluating nonorthogonal matrix elements is conceptually and computationally harder then…
The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…