Related papers: Two universal 3-quantifier representations of recu…
We study a certain family of finite-dimensional simple representations over quantum affine superalgebras associated to general linear Lie superalgebras, the so-called fundamental representations: the denominators of rational $R$-matrices…
We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q >= 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n >= 2.…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most…
We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…
For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…
The proofs that the real numbers are denumerable will be shown, i.e., that there exists one-to-one correspondence between the natural numbers $N$ and the real numbers $\Re$. The general element of the sequence that contains all real numbers…
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…
We study finite dimensional algebras that appear as fibers of quantum orders over a given point of variety of center. We present the formula for the number of irreducible representations and check it for it for the algebra of twisted…
We introduce representations of the Cuntz algebra $\con$ which are parameterized by sequences in the set of unit vectors in ${\bf C}^{N}$. These representations are natural generalizations of permutative representations by…
We discuss the notion about physical quantities as having values represented by real numbers, and its limiting to describe nature to be understood in relation to our appreciation that the quantum theory is a better theory of natural…
Quantum gauge theories with finite-dimensional representation spaces are constructed that can have canonical gauge field theories as singular limits. They describe nature as a recursive quantum assembly by iterating Fermi-Dirac…
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…
A positive quadratic form is $(k,\ell)$-universal if it represents all the numbers $kx+\ell$ where $x$ is a non-negative integer, and almost $(k,\ell)$-universal if it represents all but finitely many of them. We prove that for any $k,\ell$…
Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…
Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…