Related papers: Multi-Dimensional Interpretations of Presburger Ar…
We give a quantifier elimination procedure for one-parametric Presburger arithmetic, the extension of Presburger arithmetic with the function $x \mapsto t \cdot x$, where $t$ is a fixed free variable ranging over the integers. This resolves…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…
We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic ($\sin$-PA), and systematically study decision problems for sets of sentences in $\sin$-PA. In particular, we detail a decision…
The Clifford algebra over the three-dimensional real linear space includes its linear structure and its exterior algebra, the subspaces spanned by multivectors of the same degree determine a gradation of the Clifford algebra. Through these…
The Copenhagen Interpretation describes individual systems, using the same Hilbert space formalism as does the statistical ensemble interpretation (SQM). This leads to the well-known paradoxes surrounding the Measurement Problem. We extend…
We construct an addition and a multiplication on the set of planar binary trees, closely related to addition and multiplication on the integers. This gives rise to a new kind of (noncommutative) arithmetic theory. The price to pay for this…
Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…
Let $G$ be a model of Presburger arithmetic. Let $\mathcal{L}$ be an expansion of the language of Presburger $\mathcal{L}_{Pres}$. In this paper we prove that the $\mathcal{L}$-theory of $G$ is $\mathcal{L}_{Pres}$-minimal iff it has the…
We provide a complete classification of three-dimensional associative algebras over the real and complex number fields based on a complete elementary proof. We list up all the multiplication tables of the algebras up to isomorphism. We…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…
We examine unitary and nonunitary representations of the Heisenberg-Weyl Lie algebra $\mathfrak{hw}_n$, with particular emphasis on tensor products of unitary representations and on indecomposable nonunitary representations. In the unitary…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
We develop a structure theory for transposed Poisson algebras over fields of characteristic different from two. In particular, we prove that every finite-dimensional transposed Poisson algebra over an algebraically closed field decomposes…
The representation dimension was defined by M. Auslander in 1970 and is, due to spectacular recent progress, one of the most interesting homological invariants in representation theory. The precise value is not known in general, and is very…
In this work, we consider the satisfiability problem in a logic that combines word equations over string variables denoting words of unbounded lengths, regular languages to which words belong and Presburger constraints on the length of…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natural ways to axiomatize them. Namely, on one hand, PrA can be…