English
Related papers

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

200 papers

Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 +…

Combinatorics · Mathematics 2015-03-12 Edita Pelantová , Štěpán Starosta

Representation theorems for formal systems often take the form of an inductive translation that satisfies certain invariants, which are proved inductively. Theory morphisms and logical relations are common patterns of such inductive…

Logic in Computer Science · Computer Science 2026-03-20 Thomas Traversié , Florian Rabe

We explain the exact meaning of a statement we made in a previous paper on invariants, namely that a complex-valued function of the data of the functional equation of an $L$-function is an invariant if and only if it is stable under the…

Number Theory · Mathematics 2026-03-17 Jerzy Kaczorowski , Alberto Perelli

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…

Logic in Computer Science · Computer Science 2022-08-02 David M. Cerna , Temur Kutsia

We introduce a notion of a uniform structure on the set of all representations of a given separable, not necessarilly commutative $C^*$-algebra $\mathfrak{A}$ by introducing a suitable family of metrics on the set of representations of…

Operator Algebras · Mathematics 2018-05-17 Adam Wegert

The logic L^1_\theta introduced in [Sh:797]; it is the maximal logic below L_theta theta in which a well ordering is not definable. We investigate it for theta a compact cardinal. We prove it satisfies several parallel of classical theorems…

Logic · Mathematics 2021-08-10 Saharon Shelah

Despite strong performance on a variety of tasks, neural sequence models trained with maximum likelihood have been shown to exhibit issues such as length bias and degenerate repetition. We study the related issue of receiving…

Machine Learning · Computer Science 2020-10-06 Sean Welleck , Ilia Kulikov , Jaedeok Kim , Richard Yuanzhe Pang , Kyunghyun Cho

We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…

Algebraic Geometry · Mathematics 2021-11-24 Francis Brown

In a recent work, N. Hindman, D. Strauss and L. Zamboni have shown that the Hales-Jewett theorem can be combined with a sufficiently well behaved homomorphisms. In this paper we will show that those combined extensions can be made if we…

Combinatorics · Mathematics 2020-12-09 Aninda Chakraborty , Sayan Goswami

Fix a field $k$. When $\Delta$ is a simplicial complex on $n$ vertices with Stanley-Reisner ideal $I_\Delta$, we define and study an invariant called the $\textit{type defect}$ of $\Delta$. Except when $\Delta$ is of a single simplex, the…

Commutative Algebra · Mathematics 2019-01-30 Hailong Dao , Jay Schweig

Given a TQFT in dimension d+1, and an infinite cyclic covering of a closed (d+1)-dimensional manifold M, we define an invariant taking values in a strong shift equivalence class of matrices. The notion of strong shift equivalence originated…

Geometric Topology · Mathematics 2015-12-22 Patrick M. Gilmer

We consider deformations of bounded complexes of modules for a profinite group G over a field of positive characteristic. We prove a finiteness theorem which provides some sufficient conditions for the versal deformation of such a complex…

Number Theory · Mathematics 2013-09-03 Frauke M. Bleher , Ted Chinburg

We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…

Group Theory · Mathematics 2007-05-23 B. Tan , Z. -X. Wen , Y. -P. Zhang

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

Formal Languages and Automata Theory · Computer Science 2010-04-26 Gabriele Fici , Elena V. Pribavkina , Jacques Sakarovitch

Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…

Mathematical Physics · Physics 2007-05-23 Michael Baake , Robert V. Moody

Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…

Rings and Algebras · Mathematics 2024-06-10 João Dias , Bruno Dinis

If $M$ is an $R$-module, we study the submodules $K\leq M$ with the property that $K$ is invariant with respect to all monomorphisms $K\rightarrow M$. Such submodules are called \textsl{strictly invariant}. For the case of $%…

Rings and Algebras · Mathematics 2019-02-05 Simion Breaz , Grigore Călugăreanu , Andrey Chekhlov

We give a reframing of Godel's first and second incompleteness theorems that applies even to some undefinable theories of arithmetic. The usual Hilbert-Bernays provability conditions and the diagonal lemma are replaced by a more direct…

Logic · Mathematics 2024-12-19 Yasha Savelyev

The purpose of this paper is to generalize Zhu's theorem about characters of modules over a vertex operator algebra graded by integer conformal weights, to the setting of a vertex operator superalgebra graded by rational conformal weights.…

Representation Theory · Mathematics 2013-07-19 Jethro van Ekeren

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux