Related papers: Bounding quantification in parametric expansions o…
A quantified Boolean formula (QBF) is a propositional formula extended with universal and existential quantification over propositions. There are two methodologies in CEGAR based QBF solving techniques, one that is based on a refinement…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
The concept of the quantum Pfaffian is rigorously examined and refurbished using the new method of quantum exterior algebras. We derive a complete family of Pl\"ucker relations for the quantum linear transformations, and then use them to…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
This paper gives a thorough overview of what is known about first-order logic with counting quantifiers and with arithmetic predicates. As a main theorem we show that Presburger arithmetic is closed under unary counting quantifiers.…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…
It is shown that several of Brafman's generating functions for the Gegenbauer polynomials are algebraic functions of their arguments, if the Gegenbauer parameter differs from an integer by one-fourth or one-sixth. Two examples are given,…
We use generalized Taylor formulae in order to give some simple constructions in the real closure of an \ovfz. We deduce a new, simple quantifier elimination algorithm for \rcvfs and some theorems about constructible subsets of real…
By using cocycle deformation, we construct a certain class of Hopf algebras, containing the quantized enveloping algebras and their analogues, from what we call pre-Nichols algebras. Our construction generalizes in some sense the known…
In the paper it is considered the generalized Faber polynomials defined inside and outside a regular curve on the complex plane. The weighted Smirnov spaces corresponding to bounded and unbounded regions are defined. It is proved that the…
Given a compact of ${\bf R}^n$, there is always a doubling measure having it as its support. We use this fact to construct an integral operator that extends differentiable functions defined on any compact set of ${\bf R}^n$ to the whole of…
We define generalized bialgebras and Hopf algebras and on this basis we introduce quantum categories and quantum groupoids. The quantization of the category of linear (super)spaces is constructed. We establish a criterion for the classical…
We determine all groups definable in Presburger arithmetic, up to a finite index subgroup.
We discuss a generalization of Kummer construction which, on the base of an integral representation of a finite group and local resolution of its quotient, produces a higher dimensional variety with trivial canonical class. As an…
A generalization of the q-(Pfaff)-Saalschutz summation formula is proved. This implies a generalization of the Burge transform, resulting in an additional dimension of the ``Burge tree''. Limiting cases of our summation formula imply the…
Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…