Related papers: Two universal 3-quantifier representations of recu…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
We formulate and discuss two conjectures concerning recursive formulae for Branson's $Q$-curvatures. The proposed formulae describe all $Q$-curvatures on manifolds of all even dimensions in terms of respective lower order $Q$-curvatures and…
Explicit formulas of the universal $R$-matrix are given for all quantized nontwisted rank 3 affine Lie algebras $U_q(A_2^{(1)})\,,~U_q(C_2^{(1)})$ and $U_q(G_2^{(1)})$.
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…
In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].
In 1999, Neil Calkin and Herbert Wilf wrote "Recounting the rationals" which gave an explicit bijection between the positive integers and the positive rationals. We find several different (some new) ways to construct this enumeration and…
We consider existential problems over the reals. Extended quantifier elimination generalizes the concept of regular quantifier elimination by providing in addition answers, which are descriptions of possible assignments for the quantified…
In this note I give simple proofs of classical results of Euler, Legendre and Sylvester showing that for certain integers M there are no (or only a few) solutions of $x^3 + y^3 = M$, with $x$ and $y$ in $\mathbb{Q}$. The proofs all use a…
We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…
The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: (i) extending the representation to the process of setting the problem, (ii)…
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…
An observable canonical form is formulated for the set of rational systems on a variety each of which is a single-input-single-output, affine in the input, and a minimal realization of its response map. The equivalence relation for the…
We have proved in this paper that numbers can be expressed in algebraic form using one variable and two real rational quantities and thus sum of three cubes can also be expressed in algebraic form as a cubic polynomial. Using skeletal or…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…