Related papers: Implementing Anti-Unification Modulo Equational Th…
Cuntz algebras $\mathcal{O}_n$, $n>1$, are celebrated examples of a separable infinite simple C*-algebra with a number of fascinating properties. Their K-theory allows an embedding of $\mathcal O_m$ in $\mathcal O_n$ whenever $n-1$ divides…
My recent book Antieigenvalue Analysis, World-Scientific, 2012, presented the theory of antieigenvalues from its inception in 1966 up to 2010, and its applications within those forty-five years to Numerical Analysis, Wavelets, Statistics,…
The famous equivalence theorem is reexamined in order to make it applicable to the case of intrinsically quantum infinite-component effective theories. We slightly modify the formulation of this theorem and prove it basing on the notion of…
We prove a version of Quillen's stratification theorem in equivariant homotopy theory for a finite group $G$, generalizing the classical theorem in two directions. Firstly, we work with arbitrary commutative equivariant ring spectra as…
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…
In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…
Potential-based formulation with generalized Lorenz gauge can be used in the quantization of electromagnetic fields in inhomogeneous media. However, one often faces the redundancy of modes when finding eigenmodes from potential-based…
Classic grammars and regular expressions can be used for a variety of purposes, including parsing, intent detection, and matching. However, the comparisons are performed at a structural level, with constituent elements (words or characters)…
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what…
Antiunitary representations of Lie groups take values in the group of unitary and antiunitary operators on a Hilbert space H. In quantum physics, antiunitary operators implement time inversion or a PCT symmetry, and in the modular theory of…
In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…
We show that a A-linear map of Hilbert A-modules is induced by a unitary Hilbert module operator if and only if it extends to an ordinary unitary on appropriately defined enveloping Hilbert spaces. Applications to the theory of…
We propose new methods for Support Vector Machines (SVMs) using tree architecture for multi-class classi- fication. In each node of the tree, we select an appropriate binary classifier using entropy and generalization error estimation, then…
This paper addresses the representation theory of the insertion-elimination Lie algebra, a Lie algebra that can be naturally realized in terms of tree-inserting and tree-eliminating operations on rooted trees. The insertion-elimination…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
Positivity bounds in effective field theories (EFTs) can be extracted through the moment problem approach, utilizing well-established results from the mathematical literature. We generalize this formalism using the matrix moment approach to…
\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…
We present a new approach to stochastic modeling of constraint-based grammars that is based on log-linear models and uses EM for estimation from unannotated data. The techniques are applied to an LFG grammar for German. Evaluation on an…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
In the context of orientable circuits and subcomplexes of these as representing certain singular spaces, we consider characteristic class formulas generalizing those classical results as seen for the Riemann-Hurwitz formula for regulating…