Related papers: Models of $VTC^0$ as exponential integer parts
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the…
Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…
We analyse the fusion of representations of the triplet algebra, the maximally extended symmetry algebra of the Virasoro algebra at c=-2. It is shown that there exists a finite number of representations which are closed under fusion. These…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC -- that is, AC representing non-negative functions -- subsume many…
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…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Assuming Schanuel's conjecture, we prove that the complete theory $T_{\exp}$ of the real exponential field is axiomatized by the axioms of definably complete exponential fields satisfying $\exp' = \exp$. This implies the result of Macintyre…
Decomposable Negation Normal Forms (DNNFs) are Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove a strongly exponential lower bound on the size of…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
By a well-known result of Shepherdson, models of the theory IOpen (a first order arithmetic containing the scheme of induction for all quantifier free formulas) are exactly all the discretely ordered semirings that are integer parts of…
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…
We compute the ring of non-induced representations for a cyclic group, $C_n$, over an arbitrary field and show that it has rank $\varphi(n)$, where $\varphi$ is Euler's totient function - independent of the characteristic of the field.…
We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.
We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…