Related papers: Canonical forms for free {\kappa}-semigroups
We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…
Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…
Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…
In this paper we study $k$-noncrossing, canonical RNA pseudoknot structures with minimum arc-length $\ge 4$. Let ${\sf T}_{k,\sigma}^{[4]} (n)$ denote the number of these structures. We derive exact enumeration results by computing the…
Repetition avoidance has been studied since Thue's work. In this paper, we considered another type of repetition, which is called pseudo-power. This concept is inspired by Watson-Crick complementarity in DNA sequence and is defined over an…
In this paper we have studied the nature of kinematical and dynamical laws in $\kappa $-Minkowski spacetime from a new perspective: the canonical phase space approach. We discuss a particular form of $\kappa$-Minkowski phase space algebra…
Many invariants of finitely generated positive cancelative commutative semigroups can be studied from their Poincar\'e series. We offer and present several closed formulas for them. Moreover, those formulas have elementary proofs and are…
We prove that for infinite cardinals $\kappa<\lambda$ the alternating group $Alt(\lambda)$ (of even permutations) of $\lambda$ is not embeddable into the symmetric group $Sym(\kappa)$ (of all permutations) of $\kappa$. To prove this fact we…
Dual canonical bases of the quantum general linear supergroup are constructed which are invariant under the multiplication of the quantum Berezinian. By setting the quantum Berezinian to identity, we obtain dual canonical bases of the…
In the paper is we generalize known descriptions of rings of semi-invariants for regular modules over Euclidean and canonical algebras to arbitrary concealed-canonical algebras.
Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
For each natural number $n$, let $C^{(n)}$ be the closed and unbounded proper class of ordinals $\alpha$ such that $V_\alpha$ is a $\Sigma_n$ elementary substructure of $V$. We say that $\kappa$ is a \emph{$C^{(n)}$-cardinal} if it is the…
We prove that, for any theory defined over a space-time with boundary, the symplectic form derived in the covariant phase space is equivalent to the one derived from the canonical formalism.
Initial Semantics aims at characterizing the syntax associated to a signature as the initial object of some category. We present an initial semantics result for typed higher-order syntax together with its formalization in the Coq proof…
A canonical transformation is performed on the phase space of a number of homogeneous cosmologies to simplify the form of the scalar (or, Hamiltonian) constraint. Using the new canonical coordinates, it is then easy to obtain explicit…
Canonical correlation analysis (CCA) is a classic statistical method for discovering latent co-variation that underpins two or more observed random vectors. Several extensions and variations of CCA have been proposed that have strengthened…
General semifinite factor representations of the diffeomorphism group of euclidean space are constructed by means of a canonical correspondence with the finite factor representations of the inductive limit unitary group. This construction…
Simplification of expressions in computer algebra systems often involves a step known as "canonicalisation", which reduces equivalent expressions to the same form. However, such forms may not be natural from the perspective of a…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…