Related papers: Bounding quantification in parametric expansions o…
We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation logic with various forms of Presburger arithmetic…
We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
We give a complete first-order axiomatization of the structure $(\mathbb{Z},+,(\ell^{\mathbb{N}})_{\ell\in L})$, where $L \subseteq \mathbb{Z}_{\ge 2}$ is a set of pairwise multiplicatively independent integers and $\ell^{\mathbb{N}} =…
For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable…
It is shown that for any fixed $i>0$, the $\Sigma_{i+1}$-fragment of Presburger arithmetic, i.e., its restriction to $i+1$ quantifier alternations beginning with an existential quantifier, is complete for…
This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…
We study the extension of Presburger arithmetic by the class of sub-polynomial Hardy field functions, and show the majority of these extensions to be undecidable. More precisely, we show that the theory $\mathrm{Th}(\mathbb{Z}; <, +,…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
In this note we define one more way of quantization of classical systems. The quantization we consider is an analogue of classical Jordan-Schwinger (J.-S.) map which has been known and used for a long time by physicists. The difference,…
We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…