Related papers: Invariance: a Theoretical Approach for Coding Sets…
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
Decidability and synthesis of inductive invariants ranging in a given domain play an important role in many software and hardware verification systems. We consider here inductive invariants belonging to an abstract domain $A$ as defined in…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
We introduce a new arithmetic invariant for hermitian line bundles on an arithmetic variety. We use this invariant to measure the variation of the volume function with respect to the metric. The main result of this paper is a generalized…
We give a categorification of the notion of a mathematical structure originally given by Bourbaki in their set theory textbook. We show that any isomorphism-invariant property of a finite structure can be computed by counting the number of…
We give two results concerning the construction of modular invariant partition functions for conformal field theories constructed by tensoring together other conformal field theories. First we show how the possible modular invariants for…
We study succinctness as a measure of the expressive power of transformers. Succinctness -- how compactly a formalism can describe a language relative to other formalisms -- is a classical notion in logic and automata theory. We prove that…
We consider an Axiom A diffeomorphism and the invariant set $\Omega$ of orbits which never falls into a fixed hole. We study various aspects of the complexity of the symbolic representation of $\Omega$. Our main result are that each…
The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
The invariant $\Theta$ is an invariant of rational homology 3-spheres $M$ equipped with a combing $X$ over the complement of a point. It is related to the Casson-Walker invariant $\lambda$ by the formula $\Theta(M,X)=6\lambda(M)+p_1(X)/4$,…
Symbolic automata are finite state automata that support potentially infinite alphabets, such as the set of rational numbers, generally applied to regular expressions/languages over finite words. In symbolic automata (or automata modulo…
We study novel invariants of modular categories that are beyond the modular data, with an eye towards a simple set of complete invariants for modular categories. Our focus is on the $W$-matrix--the quantum invariant of a colored framed…
Within a category $\mathtt{C}$, having objects $\mathtt{C}_0$, it may be instructive to know not only that two objects are non-isomorphic, but also how far from being isomorphic they are. We introduce pseudo-metrics $d:\mathtt{C}_0 \times…
We consider an extension of logic programs, called \omega-programs, that can be used to define predicates over infinite lists. \omega-programs allow us to specify properties of the infinite behavior of reactive systems and, in general,…
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. We show how to…
The purpose of this survey paper is to bring to a large mathematical audience (containing also non-algebraists) some topics of invariant theory both in the classical commutative and the recent noncommutative case. We have included only…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…