Related papers: Embedding a $\theta$-invariant code into a complet…
We give a precise, computable formula for comparing $\lambda$-invariants between modular forms in the anticyclotomic indefinite setting where the Selmer groups have positive rank. This is an improvement of Hatley-Lei \cite{HL19, HL21} where…
Let $G$ be a group with a finite subgroup $H$. We define the $L^2$-multiplicity of an irreducible representation of $H$ in the $L^2$-homology of a proper $G$-CW-complex. These invariants generalize the $L^2$-Betti numbers. Our main results…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…
Let $A$ be an integral domain. We study new conditions on families of integral ideals of $A$ in order to get that $A$ is of $t$-finite character (i.e., each nonzero element of $A$ is contained in finitely many $t$-maximal ideals). We also…
Lambda words are sequences obtained by encoding the differences between ordered elements of the form i+j\theta, where i and j are non-negative integers and 1 < \theta <2. Lambda words are right-infinite words defined over an infinite…
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (-\beta)-expansions. We give an admissibility criterion for more general case of…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a perfect and separable metric space (thus,…
We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…
In the past year several constructions of non-invertible symmetries in Quantum Field Theory in $d\geq 3$ have appeared. In this paper we provide a unified perspective on these constructions. Central to this framework are so-called theta…
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…
We introduce a new two-sided type system for verifying the correctness and incorrectness of functional programs with atoms and pattern matching. A key idea in the work is that types should range over sets of normal forms, rather than sets…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
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$,…
Let $G$ be a group and let $V$ be an algebraic variety over an algebraically closed field $K$. Let $A$ denote the set of $K$-points of $V$. We introduce algebraic sofic subshifts $\Sigma \subset A^G$ and study endomorphisms $\tau \colon…
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…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…