Related papers: Invariance: a Theoretical Approach for Coding Sets…

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…

We define an invariant for compact spin manifolds $X$ of dimension $4k$ equipped with a metric $h$ of positive Yamabe invariant on its boundary. The vanishing of this invariant is a necessary condition for the conformal class of $h$ to be…

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Software verification has emerged as a key concern for ensuring the continued progress of information technology. Full verification generally requires, as a crucial step, equipping each loop with a "loop invariant". Beyond their role in…

We state and prove a simple Theorem that allows one to generate invariant quantities in Metric-Affine Geometry, under a given transformation of the affine connection. We start by a general functional of the metric and the connection and…

We generalize the notion of length to an ordinal-valued invariant defined on the class of finitely generated modules over a Noetherian ring. A key property of this invariant is its semi-additivity on short exact sequences. As an…

Let V be a complex vector space with basis {x_1,x_2,...,x_n} and G be a finite subgroup of GL(V). The tensor algebra T(V) over the complex is isomorphic to the polynomials in the non-commutative variables x_1, x_2,..., x_n with complex…

In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…

We consider the infinite symmetric group and its infinite index subgroup given as the stabilizer subgroup of one element under the natural action on a countable set. This inclusion of discrete groups induces a hyperfinite subfactor for each…

Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining…

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…

Suppose V is a finite dimensional, complex vector space, A is a finite set of codimension one subspaces of V, and G is a finite subgroup of the general linear group GL(V) that permutes the hyperplanes in A. In this paper we study invariants…

The study of homological invariants such as Tor, Ext and local cohomology modules constitutes an important direction in commutative algebra. Explicit descriptions of these invariants are notoriously difficult to find and often involve…

This paper investigates the relation between Toda brackets and congruences of modular forms. It determines the $f$-invariant of Toda brackets and thereby generalizes the formulas of J.F.\ Adams for the classical $e$-invariant to the…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

The (-\beta)-integers are natural generalisations of the \beta-integers, and thus of the integers, for negative real bases. They can be described by infinite words which are fixed points of anti-morphisms. We show that they are not…

Language models lack the notion of interchangeable tokens: symbols that are semantically equivalent yet distinct, such as bound variables in formal logic. This limitation prevents generalization to larger vocabularies and hinders the…

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…

This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…